xfs_itable.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654
  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. STATIC int
  34. xfs_internal_inum(
  35. xfs_mount_t *mp,
  36. xfs_ino_t ino)
  37. {
  38. return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino ||
  39. (xfs_sb_version_hasquota(&mp->m_sb) &&
  40. xfs_is_quota_inode(&mp->m_sb, ino)));
  41. }
  42. /*
  43. * Return stat information for one inode.
  44. * Return 0 if ok, else errno.
  45. */
  46. int
  47. xfs_bulkstat_one_int(
  48. struct xfs_mount *mp, /* mount point for filesystem */
  49. xfs_ino_t ino, /* inode to get data for */
  50. void __user *buffer, /* buffer to place output in */
  51. int ubsize, /* size of buffer */
  52. bulkstat_one_fmt_pf formatter, /* formatter, copy to user */
  53. int *ubused, /* bytes used by me */
  54. int *stat) /* BULKSTAT_RV_... */
  55. {
  56. struct xfs_icdinode *dic; /* dinode core info pointer */
  57. struct xfs_inode *ip; /* incore inode pointer */
  58. struct xfs_bstat *buf; /* return buffer */
  59. int error = 0; /* error value */
  60. *stat = BULKSTAT_RV_NOTHING;
  61. if (!buffer || xfs_internal_inum(mp, ino))
  62. return -EINVAL;
  63. buf = kmem_alloc(sizeof(*buf), KM_SLEEP | KM_MAYFAIL);
  64. if (!buf)
  65. return -ENOMEM;
  66. error = xfs_iget(mp, NULL, ino,
  67. (XFS_IGET_DONTCACHE | XFS_IGET_UNTRUSTED),
  68. XFS_ILOCK_SHARED, &ip);
  69. if (error)
  70. goto out_free;
  71. ASSERT(ip != NULL);
  72. ASSERT(ip->i_imap.im_blkno != 0);
  73. dic = &ip->i_d;
  74. /* xfs_iget returns the following without needing
  75. * further change.
  76. */
  77. buf->bs_nlink = dic->di_nlink;
  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_mode = dic->di_mode;
  82. buf->bs_uid = dic->di_uid;
  83. buf->bs_gid = dic->di_gid;
  84. buf->bs_size = dic->di_size;
  85. buf->bs_atime.tv_sec = dic->di_atime.t_sec;
  86. buf->bs_atime.tv_nsec = dic->di_atime.t_nsec;
  87. buf->bs_mtime.tv_sec = dic->di_mtime.t_sec;
  88. buf->bs_mtime.tv_nsec = dic->di_mtime.t_nsec;
  89. buf->bs_ctime.tv_sec = dic->di_ctime.t_sec;
  90. buf->bs_ctime.tv_nsec = dic->di_ctime.t_nsec;
  91. buf->bs_xflags = xfs_ip2xflags(ip);
  92. buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog;
  93. buf->bs_extents = dic->di_nextents;
  94. buf->bs_gen = dic->di_gen;
  95. memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
  96. buf->bs_dmevmask = dic->di_dmevmask;
  97. buf->bs_dmstate = dic->di_dmstate;
  98. buf->bs_aextents = dic->di_anextents;
  99. buf->bs_forkoff = XFS_IFORK_BOFF(ip);
  100. switch (dic->di_format) {
  101. case XFS_DINODE_FMT_DEV:
  102. buf->bs_rdev = ip->i_df.if_u2.if_rdev;
  103. buf->bs_blksize = BLKDEV_IOSIZE;
  104. buf->bs_blocks = 0;
  105. break;
  106. case XFS_DINODE_FMT_LOCAL:
  107. case XFS_DINODE_FMT_UUID:
  108. buf->bs_rdev = 0;
  109. buf->bs_blksize = mp->m_sb.sb_blocksize;
  110. buf->bs_blocks = 0;
  111. break;
  112. case XFS_DINODE_FMT_EXTENTS:
  113. case XFS_DINODE_FMT_BTREE:
  114. buf->bs_rdev = 0;
  115. buf->bs_blksize = mp->m_sb.sb_blocksize;
  116. buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
  117. break;
  118. }
  119. xfs_iunlock(ip, XFS_ILOCK_SHARED);
  120. IRELE(ip);
  121. error = formatter(buffer, ubsize, ubused, buf);
  122. if (!error)
  123. *stat = BULKSTAT_RV_DIDONE;
  124. out_free:
  125. kmem_free(buf);
  126. return error;
  127. }
  128. /* Return 0 on success or positive error */
  129. STATIC int
  130. xfs_bulkstat_one_fmt(
  131. void __user *ubuffer,
  132. int ubsize,
  133. int *ubused,
  134. const xfs_bstat_t *buffer)
  135. {
  136. if (ubsize < sizeof(*buffer))
  137. return -ENOMEM;
  138. if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
  139. return -EFAULT;
  140. if (ubused)
  141. *ubused = sizeof(*buffer);
  142. return 0;
  143. }
  144. int
  145. xfs_bulkstat_one(
  146. xfs_mount_t *mp, /* mount point for filesystem */
  147. xfs_ino_t ino, /* inode number to get data for */
  148. void __user *buffer, /* buffer to place output in */
  149. int ubsize, /* size of buffer */
  150. int *ubused, /* bytes used by me */
  151. int *stat) /* BULKSTAT_RV_... */
  152. {
  153. return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
  154. xfs_bulkstat_one_fmt, ubused, stat);
  155. }
  156. /*
  157. * Loop over all clusters in a chunk for a given incore inode allocation btree
  158. * record. Do a readahead if there are any allocated inodes in that cluster.
  159. */
  160. STATIC void
  161. xfs_bulkstat_ichunk_ra(
  162. struct xfs_mount *mp,
  163. xfs_agnumber_t agno,
  164. struct xfs_inobt_rec_incore *irec)
  165. {
  166. xfs_agblock_t agbno;
  167. struct blk_plug plug;
  168. int blks_per_cluster;
  169. int inodes_per_cluster;
  170. int i; /* inode chunk index */
  171. agbno = XFS_AGINO_TO_AGBNO(mp, irec->ir_startino);
  172. blks_per_cluster = xfs_icluster_size_fsb(mp);
  173. inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog;
  174. blk_start_plug(&plug);
  175. for (i = 0; i < XFS_INODES_PER_CHUNK;
  176. i += inodes_per_cluster, agbno += blks_per_cluster) {
  177. if (xfs_inobt_maskn(i, inodes_per_cluster) & ~irec->ir_free) {
  178. xfs_btree_reada_bufs(mp, agno, agbno, blks_per_cluster,
  179. &xfs_inode_buf_ops);
  180. }
  181. }
  182. blk_finish_plug(&plug);
  183. }
  184. /*
  185. * Lookup the inode chunk that the given inode lives in and then get the record
  186. * if we found the chunk. If the inode was not the last in the chunk and there
  187. * are some left allocated, update the data for the pointed-to record as well as
  188. * return the count of grabbed inodes.
  189. */
  190. STATIC int
  191. xfs_bulkstat_grab_ichunk(
  192. struct xfs_btree_cur *cur, /* btree cursor */
  193. xfs_agino_t agino, /* starting inode of chunk */
  194. int *icount,/* return # of inodes grabbed */
  195. struct xfs_inobt_rec_incore *irec) /* btree record */
  196. {
  197. int idx; /* index into inode chunk */
  198. int stat;
  199. int error = 0;
  200. /* Lookup the inode chunk that this inode lives in */
  201. error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &stat);
  202. if (error)
  203. return error;
  204. if (!stat) {
  205. *icount = 0;
  206. return error;
  207. }
  208. /* Get the record, should always work */
  209. error = xfs_inobt_get_rec(cur, irec, &stat);
  210. if (error)
  211. return error;
  212. XFS_WANT_CORRUPTED_RETURN(cur->bc_mp, stat == 1);
  213. /* Check if the record contains the inode in request */
  214. if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) {
  215. *icount = 0;
  216. return 0;
  217. }
  218. idx = agino - irec->ir_startino + 1;
  219. if (idx < XFS_INODES_PER_CHUNK &&
  220. (xfs_inobt_maskn(idx, XFS_INODES_PER_CHUNK - idx) & ~irec->ir_free)) {
  221. int i;
  222. /* We got a right chunk with some left inodes allocated at it.
  223. * Grab the chunk record. Mark all the uninteresting inodes
  224. * free -- because they're before our start point.
  225. */
  226. for (i = 0; i < idx; i++) {
  227. if (XFS_INOBT_MASK(i) & ~irec->ir_free)
  228. irec->ir_freecount++;
  229. }
  230. irec->ir_free |= xfs_inobt_maskn(0, idx);
  231. *icount = irec->ir_count - irec->ir_freecount;
  232. }
  233. return 0;
  234. }
  235. #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
  236. struct xfs_bulkstat_agichunk {
  237. char __user **ac_ubuffer;/* pointer into user's buffer */
  238. int ac_ubleft; /* bytes left in user's buffer */
  239. int ac_ubelem; /* spaces used in user's buffer */
  240. };
  241. /*
  242. * Process inodes in chunk with a pointer to a formatter function
  243. * that will iget the inode and fill in the appropriate structure.
  244. */
  245. static int
  246. xfs_bulkstat_ag_ichunk(
  247. struct xfs_mount *mp,
  248. xfs_agnumber_t agno,
  249. struct xfs_inobt_rec_incore *irbp,
  250. bulkstat_one_pf formatter,
  251. size_t statstruct_size,
  252. struct xfs_bulkstat_agichunk *acp,
  253. xfs_agino_t *last_agino)
  254. {
  255. char __user **ubufp = acp->ac_ubuffer;
  256. int chunkidx;
  257. int error = 0;
  258. xfs_agino_t agino = irbp->ir_startino;
  259. for (chunkidx = 0; chunkidx < XFS_INODES_PER_CHUNK;
  260. chunkidx++, agino++) {
  261. int fmterror;
  262. int ubused;
  263. /* inode won't fit in buffer, we are done */
  264. if (acp->ac_ubleft < statstruct_size)
  265. break;
  266. /* Skip if this inode is free */
  267. if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free)
  268. continue;
  269. /* Get the inode and fill in a single buffer */
  270. ubused = statstruct_size;
  271. error = formatter(mp, XFS_AGINO_TO_INO(mp, agno, agino),
  272. *ubufp, acp->ac_ubleft, &ubused, &fmterror);
  273. if (fmterror == BULKSTAT_RV_GIVEUP ||
  274. (error && error != -ENOENT && error != -EINVAL)) {
  275. acp->ac_ubleft = 0;
  276. ASSERT(error);
  277. break;
  278. }
  279. /* be careful not to leak error if at end of chunk */
  280. if (fmterror == BULKSTAT_RV_NOTHING || error) {
  281. error = 0;
  282. continue;
  283. }
  284. *ubufp += ubused;
  285. acp->ac_ubleft -= ubused;
  286. acp->ac_ubelem++;
  287. }
  288. /*
  289. * Post-update *last_agino. At this point, agino will always point one
  290. * inode past the last inode we processed successfully. Hence we
  291. * substract that inode when setting the *last_agino cursor so that we
  292. * return the correct cookie to userspace. On the next bulkstat call,
  293. * the inode under the lastino cookie will be skipped as we have already
  294. * processed it here.
  295. */
  296. *last_agino = agino - 1;
  297. return error;
  298. }
  299. /*
  300. * Return stat information in bulk (by-inode) for the filesystem.
  301. */
  302. int /* error status */
  303. xfs_bulkstat(
  304. xfs_mount_t *mp, /* mount point for filesystem */
  305. xfs_ino_t *lastinop, /* last inode returned */
  306. int *ubcountp, /* size of buffer/count returned */
  307. bulkstat_one_pf formatter, /* func that'd fill a single buf */
  308. size_t statstruct_size, /* sizeof struct filling */
  309. char __user *ubuffer, /* buffer with inode stats */
  310. int *done) /* 1 if there are more stats to get */
  311. {
  312. xfs_buf_t *agbp; /* agi header buffer */
  313. xfs_agino_t agino; /* inode # in allocation group */
  314. xfs_agnumber_t agno; /* allocation group number */
  315. xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
  316. xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
  317. int nirbuf; /* size of irbuf */
  318. int ubcount; /* size of user's buffer */
  319. struct xfs_bulkstat_agichunk ac;
  320. int error = 0;
  321. /*
  322. * Get the last inode value, see if there's nothing to do.
  323. */
  324. agno = XFS_INO_TO_AGNO(mp, *lastinop);
  325. agino = XFS_INO_TO_AGINO(mp, *lastinop);
  326. if (agno >= mp->m_sb.sb_agcount ||
  327. *lastinop != XFS_AGINO_TO_INO(mp, agno, agino)) {
  328. *done = 1;
  329. *ubcountp = 0;
  330. return 0;
  331. }
  332. ubcount = *ubcountp; /* statstruct's */
  333. ac.ac_ubuffer = &ubuffer;
  334. ac.ac_ubleft = ubcount * statstruct_size; /* bytes */;
  335. ac.ac_ubelem = 0;
  336. *ubcountp = 0;
  337. *done = 0;
  338. irbuf = kmem_zalloc_large(PAGE_SIZE * 4, KM_SLEEP);
  339. if (!irbuf)
  340. return -ENOMEM;
  341. nirbuf = (PAGE_SIZE * 4) / sizeof(*irbuf);
  342. /*
  343. * Loop over the allocation groups, starting from the last
  344. * inode returned; 0 means start of the allocation group.
  345. */
  346. while (agno < mp->m_sb.sb_agcount) {
  347. struct xfs_inobt_rec_incore *irbp = irbuf;
  348. struct xfs_inobt_rec_incore *irbufend = irbuf + nirbuf;
  349. bool end_of_ag = false;
  350. int icount = 0;
  351. int stat;
  352. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  353. if (error)
  354. break;
  355. /*
  356. * Allocate and initialize a btree cursor for ialloc btree.
  357. */
  358. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
  359. XFS_BTNUM_INO);
  360. if (agino > 0) {
  361. /*
  362. * In the middle of an allocation group, we need to get
  363. * the remainder of the chunk we're in.
  364. */
  365. struct xfs_inobt_rec_incore r;
  366. error = xfs_bulkstat_grab_ichunk(cur, agino, &icount, &r);
  367. if (error)
  368. goto del_cursor;
  369. if (icount) {
  370. irbp->ir_startino = r.ir_startino;
  371. irbp->ir_holemask = r.ir_holemask;
  372. irbp->ir_count = r.ir_count;
  373. irbp->ir_freecount = r.ir_freecount;
  374. irbp->ir_free = r.ir_free;
  375. irbp++;
  376. }
  377. /* Increment to the next record */
  378. error = xfs_btree_increment(cur, 0, &stat);
  379. } else {
  380. /* Start of ag. Lookup the first inode chunk */
  381. error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &stat);
  382. }
  383. if (error || stat == 0) {
  384. end_of_ag = true;
  385. goto del_cursor;
  386. }
  387. /*
  388. * Loop through inode btree records in this ag,
  389. * until we run out of inodes or space in the buffer.
  390. */
  391. while (irbp < irbufend && icount < ubcount) {
  392. struct xfs_inobt_rec_incore r;
  393. error = xfs_inobt_get_rec(cur, &r, &stat);
  394. if (error || stat == 0) {
  395. end_of_ag = true;
  396. goto del_cursor;
  397. }
  398. /*
  399. * If this chunk has any allocated inodes, save it.
  400. * Also start read-ahead now for this chunk.
  401. */
  402. if (r.ir_freecount < r.ir_count) {
  403. xfs_bulkstat_ichunk_ra(mp, agno, &r);
  404. irbp->ir_startino = r.ir_startino;
  405. irbp->ir_holemask = r.ir_holemask;
  406. irbp->ir_count = r.ir_count;
  407. irbp->ir_freecount = r.ir_freecount;
  408. irbp->ir_free = r.ir_free;
  409. irbp++;
  410. icount += r.ir_count - r.ir_freecount;
  411. }
  412. error = xfs_btree_increment(cur, 0, &stat);
  413. if (error || stat == 0) {
  414. end_of_ag = true;
  415. goto del_cursor;
  416. }
  417. cond_resched();
  418. }
  419. /*
  420. * Drop the btree buffers and the agi buffer as we can't hold any
  421. * of the locks these represent when calling iget. If there is a
  422. * pending error, then we are done.
  423. */
  424. del_cursor:
  425. xfs_btree_del_cursor(cur, error ?
  426. XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
  427. xfs_buf_relse(agbp);
  428. if (error)
  429. break;
  430. /*
  431. * Now format all the good inodes into the user's buffer. The
  432. * call to xfs_bulkstat_ag_ichunk() sets up the agino pointer
  433. * for the next loop iteration.
  434. */
  435. irbufend = irbp;
  436. for (irbp = irbuf;
  437. irbp < irbufend && ac.ac_ubleft >= statstruct_size;
  438. irbp++) {
  439. error = xfs_bulkstat_ag_ichunk(mp, agno, irbp,
  440. formatter, statstruct_size, &ac,
  441. &agino);
  442. if (error)
  443. break;
  444. cond_resched();
  445. }
  446. /*
  447. * If we've run out of space or had a formatting error, we
  448. * are now done
  449. */
  450. if (ac.ac_ubleft < statstruct_size || error)
  451. break;
  452. if (end_of_ag) {
  453. agno++;
  454. agino = 0;
  455. }
  456. }
  457. /*
  458. * Done, we're either out of filesystem or space to put the data.
  459. */
  460. kmem_free(irbuf);
  461. *ubcountp = ac.ac_ubelem;
  462. /*
  463. * We found some inodes, so clear the error status and return them.
  464. * The lastino pointer will point directly at the inode that triggered
  465. * any error that occurred, so on the next call the error will be
  466. * triggered again and propagated to userspace as there will be no
  467. * formatted inodes in the buffer.
  468. */
  469. if (ac.ac_ubelem)
  470. error = 0;
  471. /*
  472. * If we ran out of filesystem, lastino will point off the end of
  473. * the filesystem so the next call will return immediately.
  474. */
  475. *lastinop = XFS_AGINO_TO_INO(mp, agno, agino);
  476. if (agno >= mp->m_sb.sb_agcount)
  477. *done = 1;
  478. return error;
  479. }
  480. int
  481. xfs_inumbers_fmt(
  482. void __user *ubuffer, /* buffer to write to */
  483. const struct xfs_inogrp *buffer, /* buffer to read from */
  484. long count, /* # of elements to read */
  485. long *written) /* # of bytes written */
  486. {
  487. if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
  488. return -EFAULT;
  489. *written = count * sizeof(*buffer);
  490. return 0;
  491. }
  492. /*
  493. * Return inode number table for the filesystem.
  494. */
  495. int /* error status */
  496. xfs_inumbers(
  497. struct xfs_mount *mp,/* mount point for filesystem */
  498. xfs_ino_t *lastino,/* last inode returned */
  499. int *count,/* size of buffer/count returned */
  500. void __user *ubuffer,/* buffer with inode descriptions */
  501. inumbers_fmt_pf formatter)
  502. {
  503. xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, *lastino);
  504. xfs_agino_t agino = XFS_INO_TO_AGINO(mp, *lastino);
  505. struct xfs_btree_cur *cur = NULL;
  506. struct xfs_buf *agbp = NULL;
  507. struct xfs_inogrp *buffer;
  508. int bcount;
  509. int left = *count;
  510. int bufidx = 0;
  511. int error = 0;
  512. *count = 0;
  513. if (agno >= mp->m_sb.sb_agcount ||
  514. *lastino != XFS_AGINO_TO_INO(mp, agno, agino))
  515. return error;
  516. bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
  517. buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
  518. do {
  519. struct xfs_inobt_rec_incore r;
  520. int stat;
  521. if (!agbp) {
  522. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  523. if (error)
  524. break;
  525. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno,
  526. XFS_BTNUM_INO);
  527. error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_GE,
  528. &stat);
  529. if (error)
  530. break;
  531. if (!stat)
  532. goto next_ag;
  533. }
  534. error = xfs_inobt_get_rec(cur, &r, &stat);
  535. if (error)
  536. break;
  537. if (!stat)
  538. goto next_ag;
  539. agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
  540. buffer[bufidx].xi_startino =
  541. XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
  542. buffer[bufidx].xi_alloccount = r.ir_count - r.ir_freecount;
  543. buffer[bufidx].xi_allocmask = ~r.ir_free;
  544. if (++bufidx == bcount) {
  545. long written;
  546. error = formatter(ubuffer, buffer, bufidx, &written);
  547. if (error)
  548. break;
  549. ubuffer += written;
  550. *count += bufidx;
  551. bufidx = 0;
  552. }
  553. if (!--left)
  554. break;
  555. error = xfs_btree_increment(cur, 0, &stat);
  556. if (error)
  557. break;
  558. if (stat)
  559. continue;
  560. next_ag:
  561. xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
  562. cur = NULL;
  563. xfs_buf_relse(agbp);
  564. agbp = NULL;
  565. agino = 0;
  566. agno++;
  567. } while (agno < mp->m_sb.sb_agcount);
  568. if (!error) {
  569. if (bufidx) {
  570. long written;
  571. error = formatter(ubuffer, buffer, bufidx, &written);
  572. if (!error)
  573. *count += bufidx;
  574. }
  575. *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
  576. }
  577. kmem_free(buffer);
  578. if (cur)
  579. xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
  580. XFS_BTREE_NOERROR));
  581. if (agbp)
  582. xfs_buf_relse(agbp);
  583. return error;
  584. }