xfs_itable.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937
  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_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"
  41. STATIC int
  42. xfs_internal_inum(
  43. xfs_mount_t *mp,
  44. xfs_ino_t ino)
  45. {
  46. return (ino == mp->m_sb.sb_rbmino || ino == mp->m_sb.sb_rsumino ||
  47. (xfs_sb_version_hasquota(&mp->m_sb) &&
  48. (ino == mp->m_sb.sb_uquotino || ino == mp->m_sb.sb_gquotino)));
  49. }
  50. STATIC int
  51. xfs_bulkstat_one_iget(
  52. xfs_mount_t *mp, /* mount point for filesystem */
  53. xfs_ino_t ino, /* inode number to get data for */
  54. xfs_daddr_t bno, /* starting bno of inode cluster */
  55. xfs_bstat_t *buf, /* return buffer */
  56. int *stat) /* BULKSTAT_RV_... */
  57. {
  58. xfs_icdinode_t *dic; /* dinode core info pointer */
  59. xfs_inode_t *ip; /* incore inode pointer */
  60. int error;
  61. error = xfs_iget(mp, NULL, ino,
  62. XFS_IGET_BULKSTAT, XFS_ILOCK_SHARED, &ip, bno);
  63. if (error) {
  64. *stat = BULKSTAT_RV_NOTHING;
  65. return error;
  66. }
  67. ASSERT(ip != NULL);
  68. ASSERT(ip->i_imap.im_blkno != 0);
  69. dic = &ip->i_d;
  70. /* xfs_iget returns the following without needing
  71. * further change.
  72. */
  73. buf->bs_nlink = dic->di_nlink;
  74. buf->bs_projid = dic->di_projid;
  75. buf->bs_ino = ino;
  76. buf->bs_mode = dic->di_mode;
  77. buf->bs_uid = dic->di_uid;
  78. buf->bs_gid = dic->di_gid;
  79. buf->bs_size = dic->di_size;
  80. /*
  81. * We are reading the atime from the Linux inode because the
  82. * dinode might not be uptodate.
  83. */
  84. buf->bs_atime.tv_sec = VFS_I(ip)->i_atime.tv_sec;
  85. buf->bs_atime.tv_nsec = VFS_I(ip)->i_atime.tv_nsec;
  86. buf->bs_mtime.tv_sec = dic->di_mtime.t_sec;
  87. buf->bs_mtime.tv_nsec = dic->di_mtime.t_nsec;
  88. buf->bs_ctime.tv_sec = dic->di_ctime.t_sec;
  89. buf->bs_ctime.tv_nsec = dic->di_ctime.t_nsec;
  90. buf->bs_xflags = xfs_ip2xflags(ip);
  91. buf->bs_extsize = dic->di_extsize << mp->m_sb.sb_blocklog;
  92. buf->bs_extents = dic->di_nextents;
  93. buf->bs_gen = dic->di_gen;
  94. memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
  95. buf->bs_dmevmask = dic->di_dmevmask;
  96. buf->bs_dmstate = dic->di_dmstate;
  97. buf->bs_aextents = dic->di_anextents;
  98. switch (dic->di_format) {
  99. case XFS_DINODE_FMT_DEV:
  100. buf->bs_rdev = ip->i_df.if_u2.if_rdev;
  101. buf->bs_blksize = BLKDEV_IOSIZE;
  102. buf->bs_blocks = 0;
  103. break;
  104. case XFS_DINODE_FMT_LOCAL:
  105. case XFS_DINODE_FMT_UUID:
  106. buf->bs_rdev = 0;
  107. buf->bs_blksize = mp->m_sb.sb_blocksize;
  108. buf->bs_blocks = 0;
  109. break;
  110. case XFS_DINODE_FMT_EXTENTS:
  111. case XFS_DINODE_FMT_BTREE:
  112. buf->bs_rdev = 0;
  113. buf->bs_blksize = mp->m_sb.sb_blocksize;
  114. buf->bs_blocks = dic->di_nblocks + ip->i_delayed_blks;
  115. break;
  116. }
  117. xfs_iput(ip, XFS_ILOCK_SHARED);
  118. return error;
  119. }
  120. STATIC void
  121. xfs_bulkstat_one_dinode(
  122. xfs_mount_t *mp, /* mount point for filesystem */
  123. xfs_ino_t ino, /* inode number to get data for */
  124. xfs_dinode_t *dic, /* dinode inode pointer */
  125. xfs_bstat_t *buf) /* return buffer */
  126. {
  127. /*
  128. * The inode format changed when we moved the link count and
  129. * made it 32 bits long. If this is an old format inode,
  130. * convert it in memory to look like a new one. If it gets
  131. * flushed to disk we will convert back before flushing or
  132. * logging it. We zero out the new projid field and the old link
  133. * count field. We'll handle clearing the pad field (the remains
  134. * of the old uuid field) when we actually convert the inode to
  135. * the new format. We don't change the version number so that we
  136. * can distinguish this from a real new format inode.
  137. */
  138. if (dic->di_version == 1) {
  139. buf->bs_nlink = be16_to_cpu(dic->di_onlink);
  140. buf->bs_projid = 0;
  141. } else {
  142. buf->bs_nlink = be32_to_cpu(dic->di_nlink);
  143. buf->bs_projid = be16_to_cpu(dic->di_projid);
  144. }
  145. buf->bs_ino = ino;
  146. buf->bs_mode = be16_to_cpu(dic->di_mode);
  147. buf->bs_uid = be32_to_cpu(dic->di_uid);
  148. buf->bs_gid = be32_to_cpu(dic->di_gid);
  149. buf->bs_size = be64_to_cpu(dic->di_size);
  150. buf->bs_atime.tv_sec = be32_to_cpu(dic->di_atime.t_sec);
  151. buf->bs_atime.tv_nsec = be32_to_cpu(dic->di_atime.t_nsec);
  152. buf->bs_mtime.tv_sec = be32_to_cpu(dic->di_mtime.t_sec);
  153. buf->bs_mtime.tv_nsec = be32_to_cpu(dic->di_mtime.t_nsec);
  154. buf->bs_ctime.tv_sec = be32_to_cpu(dic->di_ctime.t_sec);
  155. buf->bs_ctime.tv_nsec = be32_to_cpu(dic->di_ctime.t_nsec);
  156. buf->bs_xflags = xfs_dic2xflags(dic);
  157. buf->bs_extsize = be32_to_cpu(dic->di_extsize) << mp->m_sb.sb_blocklog;
  158. buf->bs_extents = be32_to_cpu(dic->di_nextents);
  159. buf->bs_gen = be32_to_cpu(dic->di_gen);
  160. memset(buf->bs_pad, 0, sizeof(buf->bs_pad));
  161. buf->bs_dmevmask = be32_to_cpu(dic->di_dmevmask);
  162. buf->bs_dmstate = be16_to_cpu(dic->di_dmstate);
  163. buf->bs_aextents = be16_to_cpu(dic->di_anextents);
  164. switch (dic->di_format) {
  165. case XFS_DINODE_FMT_DEV:
  166. buf->bs_rdev = xfs_dinode_get_rdev(dic);
  167. buf->bs_blksize = BLKDEV_IOSIZE;
  168. buf->bs_blocks = 0;
  169. break;
  170. case XFS_DINODE_FMT_LOCAL:
  171. case XFS_DINODE_FMT_UUID:
  172. buf->bs_rdev = 0;
  173. buf->bs_blksize = mp->m_sb.sb_blocksize;
  174. buf->bs_blocks = 0;
  175. break;
  176. case XFS_DINODE_FMT_EXTENTS:
  177. case XFS_DINODE_FMT_BTREE:
  178. buf->bs_rdev = 0;
  179. buf->bs_blksize = mp->m_sb.sb_blocksize;
  180. buf->bs_blocks = be64_to_cpu(dic->di_nblocks);
  181. break;
  182. }
  183. }
  184. /* Return 0 on success or positive error */
  185. STATIC int
  186. xfs_bulkstat_one_fmt(
  187. void __user *ubuffer,
  188. int ubsize,
  189. int *ubused,
  190. const xfs_bstat_t *buffer)
  191. {
  192. if (ubsize < sizeof(*buffer))
  193. return XFS_ERROR(ENOMEM);
  194. if (copy_to_user(ubuffer, buffer, sizeof(*buffer)))
  195. return XFS_ERROR(EFAULT);
  196. if (ubused)
  197. *ubused = sizeof(*buffer);
  198. return 0;
  199. }
  200. /*
  201. * Return stat information for one inode.
  202. * Return 0 if ok, else errno.
  203. */
  204. int /* error status */
  205. xfs_bulkstat_one_int(
  206. xfs_mount_t *mp, /* mount point for filesystem */
  207. xfs_ino_t ino, /* inode number to get data for */
  208. void __user *buffer, /* buffer to place output in */
  209. int ubsize, /* size of buffer */
  210. bulkstat_one_fmt_pf formatter, /* formatter, copy to user */
  211. xfs_daddr_t bno, /* starting bno of inode cluster */
  212. int *ubused, /* bytes used by me */
  213. void *dibuff, /* on-disk inode buffer */
  214. int *stat) /* BULKSTAT_RV_... */
  215. {
  216. xfs_bstat_t *buf; /* return buffer */
  217. int error = 0; /* error value */
  218. xfs_dinode_t *dip; /* dinode inode pointer */
  219. dip = (xfs_dinode_t *)dibuff;
  220. *stat = BULKSTAT_RV_NOTHING;
  221. if (!buffer || xfs_internal_inum(mp, ino))
  222. return XFS_ERROR(EINVAL);
  223. buf = kmem_alloc(sizeof(*buf), KM_SLEEP);
  224. if (dip == NULL) {
  225. /* We're not being passed a pointer to a dinode. This happens
  226. * if BULKSTAT_FG_IGET is selected. Do the iget.
  227. */
  228. error = xfs_bulkstat_one_iget(mp, ino, bno, buf, stat);
  229. if (error)
  230. goto out_free;
  231. } else {
  232. xfs_bulkstat_one_dinode(mp, ino, dip, buf);
  233. }
  234. error = formatter(buffer, ubsize, ubused, buf);
  235. if (error)
  236. goto out_free;
  237. *stat = BULKSTAT_RV_DIDONE;
  238. out_free:
  239. kmem_free(buf);
  240. return error;
  241. }
  242. int
  243. xfs_bulkstat_one(
  244. xfs_mount_t *mp, /* mount point for filesystem */
  245. xfs_ino_t ino, /* inode number to get data for */
  246. void __user *buffer, /* buffer to place output in */
  247. int ubsize, /* size of buffer */
  248. void *private_data, /* my private data */
  249. xfs_daddr_t bno, /* starting bno of inode cluster */
  250. int *ubused, /* bytes used by me */
  251. void *dibuff, /* on-disk inode buffer */
  252. int *stat) /* BULKSTAT_RV_... */
  253. {
  254. return xfs_bulkstat_one_int(mp, ino, buffer, ubsize,
  255. xfs_bulkstat_one_fmt, bno,
  256. ubused, dibuff, stat);
  257. }
  258. /*
  259. * Test to see whether we can use the ondisk inode directly, based
  260. * on the given bulkstat flags, filling in dipp accordingly.
  261. * Returns zero if the inode is dodgey.
  262. */
  263. STATIC int
  264. xfs_bulkstat_use_dinode(
  265. xfs_mount_t *mp,
  266. int flags,
  267. xfs_buf_t *bp,
  268. int clustidx,
  269. xfs_dinode_t **dipp)
  270. {
  271. xfs_dinode_t *dip;
  272. unsigned int aformat;
  273. *dipp = NULL;
  274. if (!bp || (flags & BULKSTAT_FG_IGET))
  275. return 1;
  276. dip = (xfs_dinode_t *)
  277. xfs_buf_offset(bp, clustidx << mp->m_sb.sb_inodelog);
  278. /*
  279. * Check the buffer containing the on-disk inode for di_mode == 0.
  280. * This is to prevent xfs_bulkstat from picking up just reclaimed
  281. * inodes that have their in-core state initialized but not flushed
  282. * to disk yet. This is a temporary hack that would require a proper
  283. * fix in the future.
  284. */
  285. if (be16_to_cpu(dip->di_magic) != XFS_DINODE_MAGIC ||
  286. !XFS_DINODE_GOOD_VERSION(dip->di_version) ||
  287. !dip->di_mode)
  288. return 0;
  289. if (flags & BULKSTAT_FG_QUICK) {
  290. *dipp = dip;
  291. return 1;
  292. }
  293. /* BULKSTAT_FG_INLINE: if attr fork is local, or not there, use it */
  294. aformat = dip->di_aformat;
  295. if ((XFS_DFORK_Q(dip) == 0) ||
  296. (aformat == XFS_DINODE_FMT_LOCAL) ||
  297. (aformat == XFS_DINODE_FMT_EXTENTS && !dip->di_anextents)) {
  298. *dipp = dip;
  299. return 1;
  300. }
  301. return 1;
  302. }
  303. #define XFS_BULKSTAT_UBLEFT(ubleft) ((ubleft) >= statstruct_size)
  304. /*
  305. * Return stat information in bulk (by-inode) for the filesystem.
  306. */
  307. int /* error status */
  308. xfs_bulkstat(
  309. xfs_mount_t *mp, /* mount point for filesystem */
  310. xfs_ino_t *lastinop, /* last inode returned */
  311. int *ubcountp, /* size of buffer/count returned */
  312. bulkstat_one_pf formatter, /* func that'd fill a single buf */
  313. void *private_data,/* private data for formatter */
  314. size_t statstruct_size, /* sizeof struct filling */
  315. char __user *ubuffer, /* buffer with inode stats */
  316. int flags, /* defined in xfs_itable.h */
  317. int *done) /* 1 if there are more stats to get */
  318. {
  319. xfs_agblock_t agbno=0;/* allocation group block number */
  320. xfs_buf_t *agbp; /* agi header buffer */
  321. xfs_agi_t *agi; /* agi header data */
  322. xfs_agino_t agino; /* inode # in allocation group */
  323. xfs_agnumber_t agno; /* allocation group number */
  324. xfs_daddr_t bno; /* inode cluster start daddr */
  325. int chunkidx; /* current index into inode chunk */
  326. int clustidx; /* current index into inode cluster */
  327. xfs_btree_cur_t *cur; /* btree cursor for ialloc btree */
  328. int end_of_ag; /* set if we've seen the ag end */
  329. int error; /* error code */
  330. int fmterror;/* bulkstat formatter result */
  331. int i; /* loop index */
  332. int icount; /* count of inodes good in irbuf */
  333. size_t irbsize; /* size of irec buffer in bytes */
  334. xfs_ino_t ino; /* inode number (filesystem) */
  335. xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */
  336. xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
  337. xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */
  338. xfs_ino_t lastino; /* last inode number returned */
  339. int nbcluster; /* # of blocks in a cluster */
  340. int nicluster; /* # of inodes in a cluster */
  341. int nimask; /* mask for inode clusters */
  342. int nirbuf; /* size of irbuf */
  343. int rval; /* return value error code */
  344. int tmp; /* result value from btree calls */
  345. int ubcount; /* size of user's buffer */
  346. int ubleft; /* bytes left in user's buffer */
  347. char __user *ubufp; /* pointer into user's buffer */
  348. int ubelem; /* spaces used in user's buffer */
  349. int ubused; /* bytes used by formatter */
  350. xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */
  351. xfs_dinode_t *dip; /* ptr into bp for specific inode */
  352. /*
  353. * Get the last inode value, see if there's nothing to do.
  354. */
  355. ino = (xfs_ino_t)*lastinop;
  356. lastino = ino;
  357. dip = NULL;
  358. agno = XFS_INO_TO_AGNO(mp, ino);
  359. agino = XFS_INO_TO_AGINO(mp, ino);
  360. if (agno >= mp->m_sb.sb_agcount ||
  361. ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
  362. *done = 1;
  363. *ubcountp = 0;
  364. return 0;
  365. }
  366. if (!ubcountp || *ubcountp <= 0) {
  367. return EINVAL;
  368. }
  369. ubcount = *ubcountp; /* statstruct's */
  370. ubleft = ubcount * statstruct_size; /* bytes */
  371. *ubcountp = ubelem = 0;
  372. *done = 0;
  373. fmterror = 0;
  374. ubufp = ubuffer;
  375. nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ?
  376. mp->m_sb.sb_inopblock :
  377. (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog);
  378. nimask = ~(nicluster - 1);
  379. nbcluster = nicluster >> mp->m_sb.sb_inopblog;
  380. irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4,
  381. KM_SLEEP | KM_MAYFAIL | KM_LARGE);
  382. nirbuf = irbsize / sizeof(*irbuf);
  383. /*
  384. * Loop over the allocation groups, starting from the last
  385. * inode returned; 0 means start of the allocation group.
  386. */
  387. rval = 0;
  388. while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
  389. cond_resched();
  390. bp = NULL;
  391. down_read(&mp->m_peraglock);
  392. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  393. up_read(&mp->m_peraglock);
  394. if (error) {
  395. /*
  396. * Skip this allocation group and go to the next one.
  397. */
  398. agno++;
  399. agino = 0;
  400. continue;
  401. }
  402. agi = XFS_BUF_TO_AGI(agbp);
  403. /*
  404. * Allocate and initialize a btree cursor for ialloc btree.
  405. */
  406. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
  407. irbp = irbuf;
  408. irbufend = irbuf + nirbuf;
  409. end_of_ag = 0;
  410. /*
  411. * If we're returning in the middle of an allocation group,
  412. * we need to get the remainder of the chunk we're in.
  413. */
  414. if (agino > 0) {
  415. xfs_inobt_rec_incore_t r;
  416. /*
  417. * Lookup the inode chunk that this inode lives in.
  418. */
  419. error = xfs_inobt_lookup_le(cur, agino, 0, 0, &tmp);
  420. if (!error && /* no I/O error */
  421. tmp && /* lookup succeeded */
  422. /* got the record, should always work */
  423. !(error = xfs_inobt_get_rec(cur, &r, &i)) &&
  424. i == 1 &&
  425. /* this is the right chunk */
  426. agino < r.ir_startino + XFS_INODES_PER_CHUNK &&
  427. /* lastino was not last in chunk */
  428. (chunkidx = agino - r.ir_startino + 1) <
  429. XFS_INODES_PER_CHUNK &&
  430. /* there are some left allocated */
  431. xfs_inobt_maskn(chunkidx,
  432. XFS_INODES_PER_CHUNK - chunkidx) &
  433. ~r.ir_free) {
  434. /*
  435. * Grab the chunk record. Mark all the
  436. * uninteresting inodes (because they're
  437. * before our start point) free.
  438. */
  439. for (i = 0; i < chunkidx; i++) {
  440. if (XFS_INOBT_MASK(i) & ~r.ir_free)
  441. r.ir_freecount++;
  442. }
  443. r.ir_free |= xfs_inobt_maskn(0, chunkidx);
  444. irbp->ir_startino = r.ir_startino;
  445. irbp->ir_freecount = r.ir_freecount;
  446. irbp->ir_free = r.ir_free;
  447. irbp++;
  448. agino = r.ir_startino + XFS_INODES_PER_CHUNK;
  449. icount = XFS_INODES_PER_CHUNK - r.ir_freecount;
  450. } else {
  451. /*
  452. * If any of those tests failed, bump the
  453. * inode number (just in case).
  454. */
  455. agino++;
  456. icount = 0;
  457. }
  458. /*
  459. * In any case, increment to the next record.
  460. */
  461. if (!error)
  462. error = xfs_btree_increment(cur, 0, &tmp);
  463. } else {
  464. /*
  465. * Start of ag. Lookup the first inode chunk.
  466. */
  467. error = xfs_inobt_lookup_ge(cur, 0, 0, 0, &tmp);
  468. icount = 0;
  469. }
  470. /*
  471. * Loop through inode btree records in this ag,
  472. * until we run out of inodes or space in the buffer.
  473. */
  474. while (irbp < irbufend && icount < ubcount) {
  475. xfs_inobt_rec_incore_t r;
  476. /*
  477. * Loop as long as we're unable to read the
  478. * inode btree.
  479. */
  480. while (error) {
  481. agino += XFS_INODES_PER_CHUNK;
  482. if (XFS_AGINO_TO_AGBNO(mp, agino) >=
  483. be32_to_cpu(agi->agi_length))
  484. break;
  485. error = xfs_inobt_lookup_ge(cur, agino, 0, 0,
  486. &tmp);
  487. cond_resched();
  488. }
  489. /*
  490. * If ran off the end of the ag either with an error,
  491. * or the normal way, set end and stop collecting.
  492. */
  493. if (error) {
  494. end_of_ag = 1;
  495. break;
  496. }
  497. error = xfs_inobt_get_rec(cur, &r, &i);
  498. if (error || i == 0) {
  499. end_of_ag = 1;
  500. break;
  501. }
  502. /*
  503. * If this chunk has any allocated inodes, save it.
  504. * Also start read-ahead now for this chunk.
  505. */
  506. if (r.ir_freecount < XFS_INODES_PER_CHUNK) {
  507. /*
  508. * Loop over all clusters in the next chunk.
  509. * Do a readahead if there are any allocated
  510. * inodes in that cluster.
  511. */
  512. agbno = XFS_AGINO_TO_AGBNO(mp, r.ir_startino);
  513. for (chunkidx = 0;
  514. chunkidx < XFS_INODES_PER_CHUNK;
  515. chunkidx += nicluster,
  516. agbno += nbcluster) {
  517. if (xfs_inobt_maskn(chunkidx, nicluster)
  518. & ~r.ir_free)
  519. xfs_btree_reada_bufs(mp, agno,
  520. agbno, nbcluster);
  521. }
  522. irbp->ir_startino = r.ir_startino;
  523. irbp->ir_freecount = r.ir_freecount;
  524. irbp->ir_free = r.ir_free;
  525. irbp++;
  526. icount += XFS_INODES_PER_CHUNK - r.ir_freecount;
  527. }
  528. /*
  529. * Set agino to after this chunk and bump the cursor.
  530. */
  531. agino = r.ir_startino + XFS_INODES_PER_CHUNK;
  532. error = xfs_btree_increment(cur, 0, &tmp);
  533. cond_resched();
  534. }
  535. /*
  536. * Drop the btree buffers and the agi buffer.
  537. * We can't hold any of the locks these represent
  538. * when calling iget.
  539. */
  540. xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
  541. xfs_buf_relse(agbp);
  542. /*
  543. * Now format all the good inodes into the user's buffer.
  544. */
  545. irbufend = irbp;
  546. for (irbp = irbuf;
  547. irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
  548. /*
  549. * Now process this chunk of inodes.
  550. */
  551. for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
  552. XFS_BULKSTAT_UBLEFT(ubleft) &&
  553. irbp->ir_freecount < XFS_INODES_PER_CHUNK;
  554. chunkidx++, clustidx++, agino++) {
  555. ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
  556. /*
  557. * Recompute agbno if this is the
  558. * first inode of the cluster.
  559. *
  560. * Careful with clustidx. There can be
  561. * multiple clusters per chunk, a single
  562. * cluster per chunk or a cluster that has
  563. * inodes represented from several different
  564. * chunks (if blocksize is large).
  565. *
  566. * Because of this, the starting clustidx is
  567. * initialized to zero in this loop but must
  568. * later be reset after reading in the cluster
  569. * buffer.
  570. */
  571. if ((chunkidx & (nicluster - 1)) == 0) {
  572. agbno = XFS_AGINO_TO_AGBNO(mp,
  573. irbp->ir_startino) +
  574. ((chunkidx & nimask) >>
  575. mp->m_sb.sb_inopblog);
  576. if (flags & (BULKSTAT_FG_QUICK |
  577. BULKSTAT_FG_INLINE)) {
  578. int offset;
  579. ino = XFS_AGINO_TO_INO(mp, agno,
  580. agino);
  581. bno = XFS_AGB_TO_DADDR(mp, agno,
  582. agbno);
  583. /*
  584. * Get the inode cluster buffer
  585. */
  586. if (bp)
  587. xfs_buf_relse(bp);
  588. error = xfs_inotobp(mp, NULL, ino, &dip,
  589. &bp, &offset,
  590. XFS_IGET_BULKSTAT);
  591. if (!error)
  592. clustidx = offset / mp->m_sb.sb_inodesize;
  593. if (XFS_TEST_ERROR(error != 0,
  594. mp, XFS_ERRTAG_BULKSTAT_READ_CHUNK,
  595. XFS_RANDOM_BULKSTAT_READ_CHUNK)) {
  596. bp = NULL;
  597. ubleft = 0;
  598. rval = error;
  599. break;
  600. }
  601. }
  602. }
  603. ino = XFS_AGINO_TO_INO(mp, agno, agino);
  604. bno = XFS_AGB_TO_DADDR(mp, agno, agbno);
  605. /*
  606. * Skip if this inode is free.
  607. */
  608. if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
  609. lastino = ino;
  610. continue;
  611. }
  612. /*
  613. * Count used inodes as free so we can tell
  614. * when the chunk is used up.
  615. */
  616. irbp->ir_freecount++;
  617. if (!xfs_bulkstat_use_dinode(mp, flags, bp,
  618. clustidx, &dip)) {
  619. lastino = ino;
  620. continue;
  621. }
  622. /*
  623. * If we need to do an iget, cannot hold bp.
  624. * Drop it, until starting the next cluster.
  625. */
  626. if ((flags & BULKSTAT_FG_INLINE) && !dip) {
  627. if (bp)
  628. xfs_buf_relse(bp);
  629. bp = NULL;
  630. }
  631. /*
  632. * Get the inode and fill in a single buffer.
  633. * BULKSTAT_FG_QUICK uses dip to fill it in.
  634. * BULKSTAT_FG_IGET uses igets.
  635. * BULKSTAT_FG_INLINE uses dip if we have an
  636. * inline attr fork, else igets.
  637. * See: xfs_bulkstat_one & xfs_dm_bulkstat_one.
  638. * This is also used to count inodes/blks, etc
  639. * in xfs_qm_quotacheck.
  640. */
  641. ubused = statstruct_size;
  642. error = formatter(mp, ino, ubufp,
  643. ubleft, private_data,
  644. bno, &ubused, dip, &fmterror);
  645. if (fmterror == BULKSTAT_RV_NOTHING) {
  646. if (error && error != ENOENT &&
  647. error != EINVAL) {
  648. ubleft = 0;
  649. rval = error;
  650. break;
  651. }
  652. lastino = ino;
  653. continue;
  654. }
  655. if (fmterror == BULKSTAT_RV_GIVEUP) {
  656. ubleft = 0;
  657. ASSERT(error);
  658. rval = error;
  659. break;
  660. }
  661. if (ubufp)
  662. ubufp += ubused;
  663. ubleft -= ubused;
  664. ubelem++;
  665. lastino = ino;
  666. }
  667. cond_resched();
  668. }
  669. if (bp)
  670. xfs_buf_relse(bp);
  671. /*
  672. * Set up for the next loop iteration.
  673. */
  674. if (XFS_BULKSTAT_UBLEFT(ubleft)) {
  675. if (end_of_ag) {
  676. agno++;
  677. agino = 0;
  678. } else
  679. agino = XFS_INO_TO_AGINO(mp, lastino);
  680. } else
  681. break;
  682. }
  683. /*
  684. * Done, we're either out of filesystem or space to put the data.
  685. */
  686. kmem_free(irbuf);
  687. *ubcountp = ubelem;
  688. /*
  689. * Found some inodes, return them now and return the error next time.
  690. */
  691. if (ubelem)
  692. rval = 0;
  693. if (agno >= mp->m_sb.sb_agcount) {
  694. /*
  695. * If we ran out of filesystem, mark lastino as off
  696. * the end of the filesystem, so the next call
  697. * will return immediately.
  698. */
  699. *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
  700. *done = 1;
  701. } else
  702. *lastinop = (xfs_ino_t)lastino;
  703. return rval;
  704. }
  705. /*
  706. * Return stat information in bulk (by-inode) for the filesystem.
  707. * Special case for non-sequential one inode bulkstat.
  708. */
  709. int /* error status */
  710. xfs_bulkstat_single(
  711. xfs_mount_t *mp, /* mount point for filesystem */
  712. xfs_ino_t *lastinop, /* inode to return */
  713. char __user *buffer, /* buffer with inode stats */
  714. int *done) /* 1 if there are more stats to get */
  715. {
  716. int count; /* count value for bulkstat call */
  717. int error; /* return value */
  718. xfs_ino_t ino; /* filesystem inode number */
  719. int res; /* result from bs1 */
  720. /*
  721. * note that requesting valid inode numbers which are not allocated
  722. * to inodes will most likely cause xfs_itobp to generate warning
  723. * messages about bad magic numbers. This is ok. The fact that
  724. * the inode isn't actually an inode is handled by the
  725. * error check below. Done this way to make the usual case faster
  726. * at the expense of the error case.
  727. */
  728. ino = (xfs_ino_t)*lastinop;
  729. error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t),
  730. NULL, 0, NULL, NULL, &res);
  731. if (error) {
  732. /*
  733. * Special case way failed, do it the "long" way
  734. * to see if that works.
  735. */
  736. (*lastinop)--;
  737. count = 1;
  738. if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one,
  739. NULL, sizeof(xfs_bstat_t), buffer,
  740. BULKSTAT_FG_IGET, done))
  741. return error;
  742. if (count == 0 || (xfs_ino_t)*lastinop != ino)
  743. return error == EFSCORRUPTED ?
  744. XFS_ERROR(EINVAL) : error;
  745. else
  746. return 0;
  747. }
  748. *done = 0;
  749. return 0;
  750. }
  751. int
  752. xfs_inumbers_fmt(
  753. void __user *ubuffer, /* buffer to write to */
  754. const xfs_inogrp_t *buffer, /* buffer to read from */
  755. long count, /* # of elements to read */
  756. long *written) /* # of bytes written */
  757. {
  758. if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
  759. return -EFAULT;
  760. *written = count * sizeof(*buffer);
  761. return 0;
  762. }
  763. /*
  764. * Return inode number table for the filesystem.
  765. */
  766. int /* error status */
  767. xfs_inumbers(
  768. xfs_mount_t *mp, /* mount point for filesystem */
  769. xfs_ino_t *lastino, /* last inode returned */
  770. int *count, /* size of buffer/count returned */
  771. void __user *ubuffer,/* buffer with inode descriptions */
  772. inumbers_fmt_pf formatter)
  773. {
  774. xfs_buf_t *agbp;
  775. xfs_agino_t agino;
  776. xfs_agnumber_t agno;
  777. int bcount;
  778. xfs_inogrp_t *buffer;
  779. int bufidx;
  780. xfs_btree_cur_t *cur;
  781. int error;
  782. xfs_inobt_rec_incore_t r;
  783. int i;
  784. xfs_ino_t ino;
  785. int left;
  786. int tmp;
  787. ino = (xfs_ino_t)*lastino;
  788. agno = XFS_INO_TO_AGNO(mp, ino);
  789. agino = XFS_INO_TO_AGINO(mp, ino);
  790. left = *count;
  791. *count = 0;
  792. bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
  793. buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
  794. error = bufidx = 0;
  795. cur = NULL;
  796. agbp = NULL;
  797. while (left > 0 && agno < mp->m_sb.sb_agcount) {
  798. if (agbp == NULL) {
  799. down_read(&mp->m_peraglock);
  800. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  801. up_read(&mp->m_peraglock);
  802. if (error) {
  803. /*
  804. * If we can't read the AGI of this ag,
  805. * then just skip to the next one.
  806. */
  807. ASSERT(cur == NULL);
  808. agbp = NULL;
  809. agno++;
  810. agino = 0;
  811. continue;
  812. }
  813. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
  814. error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp);
  815. if (error) {
  816. xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
  817. cur = NULL;
  818. xfs_buf_relse(agbp);
  819. agbp = NULL;
  820. /*
  821. * Move up the last inode in the current
  822. * chunk. The lookup_ge will always get
  823. * us the first inode in the next chunk.
  824. */
  825. agino += XFS_INODES_PER_CHUNK - 1;
  826. continue;
  827. }
  828. }
  829. error = xfs_inobt_get_rec(cur, &r, &i);
  830. if (error || i == 0) {
  831. xfs_buf_relse(agbp);
  832. agbp = NULL;
  833. xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
  834. cur = NULL;
  835. agno++;
  836. agino = 0;
  837. continue;
  838. }
  839. agino = r.ir_startino + XFS_INODES_PER_CHUNK - 1;
  840. buffer[bufidx].xi_startino =
  841. XFS_AGINO_TO_INO(mp, agno, r.ir_startino);
  842. buffer[bufidx].xi_alloccount =
  843. XFS_INODES_PER_CHUNK - r.ir_freecount;
  844. buffer[bufidx].xi_allocmask = ~r.ir_free;
  845. bufidx++;
  846. left--;
  847. if (bufidx == bcount) {
  848. long written;
  849. if (formatter(ubuffer, buffer, bufidx, &written)) {
  850. error = XFS_ERROR(EFAULT);
  851. break;
  852. }
  853. ubuffer += written;
  854. *count += bufidx;
  855. bufidx = 0;
  856. }
  857. if (left) {
  858. error = xfs_btree_increment(cur, 0, &tmp);
  859. if (error) {
  860. xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
  861. cur = NULL;
  862. xfs_buf_relse(agbp);
  863. agbp = NULL;
  864. /*
  865. * The agino value has already been bumped.
  866. * Just try to skip up to it.
  867. */
  868. agino += XFS_INODES_PER_CHUNK;
  869. continue;
  870. }
  871. }
  872. }
  873. if (!error) {
  874. if (bufidx) {
  875. long written;
  876. if (formatter(ubuffer, buffer, bufidx, &written))
  877. error = XFS_ERROR(EFAULT);
  878. else
  879. *count += bufidx;
  880. }
  881. *lastino = XFS_AGINO_TO_INO(mp, agno, agino);
  882. }
  883. kmem_free(buffer);
  884. if (cur)
  885. xfs_btree_del_cursor(cur, (error ? XFS_BTREE_ERROR :
  886. XFS_BTREE_NOERROR));
  887. if (agbp)
  888. xfs_buf_relse(agbp);
  889. return error;
  890. }