xfs_itable.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933
  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. 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. __int32_t gcnt; /* current btree rec's count */
  332. xfs_inofree_t gfree; /* current btree rec's free mask */
  333. xfs_agino_t gino; /* current btree rec's start inode */
  334. int i; /* loop index */
  335. int icount; /* count of inodes good in irbuf */
  336. size_t irbsize; /* size of irec buffer in bytes */
  337. xfs_ino_t ino; /* inode number (filesystem) */
  338. xfs_inobt_rec_incore_t *irbp; /* current irec buffer pointer */
  339. xfs_inobt_rec_incore_t *irbuf; /* start of irec buffer */
  340. xfs_inobt_rec_incore_t *irbufend; /* end of good irec buffer entries */
  341. xfs_ino_t lastino; /* last inode number returned */
  342. int nbcluster; /* # of blocks in a cluster */
  343. int nicluster; /* # of inodes in a cluster */
  344. int nimask; /* mask for inode clusters */
  345. int nirbuf; /* size of irbuf */
  346. int rval; /* return value error code */
  347. int tmp; /* result value from btree calls */
  348. int ubcount; /* size of user's buffer */
  349. int ubleft; /* bytes left in user's buffer */
  350. char __user *ubufp; /* pointer into user's buffer */
  351. int ubelem; /* spaces used in user's buffer */
  352. int ubused; /* bytes used by formatter */
  353. xfs_buf_t *bp; /* ptr to on-disk inode cluster buf */
  354. xfs_dinode_t *dip; /* ptr into bp for specific inode */
  355. /*
  356. * Get the last inode value, see if there's nothing to do.
  357. */
  358. ino = (xfs_ino_t)*lastinop;
  359. lastino = ino;
  360. dip = NULL;
  361. agno = XFS_INO_TO_AGNO(mp, ino);
  362. agino = XFS_INO_TO_AGINO(mp, ino);
  363. if (agno >= mp->m_sb.sb_agcount ||
  364. ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
  365. *done = 1;
  366. *ubcountp = 0;
  367. return 0;
  368. }
  369. if (!ubcountp || *ubcountp <= 0) {
  370. return EINVAL;
  371. }
  372. ubcount = *ubcountp; /* statstruct's */
  373. ubleft = ubcount * statstruct_size; /* bytes */
  374. *ubcountp = ubelem = 0;
  375. *done = 0;
  376. fmterror = 0;
  377. ubufp = ubuffer;
  378. nicluster = mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp) ?
  379. mp->m_sb.sb_inopblock :
  380. (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog);
  381. nimask = ~(nicluster - 1);
  382. nbcluster = nicluster >> mp->m_sb.sb_inopblog;
  383. irbuf = kmem_zalloc_greedy(&irbsize, PAGE_SIZE, PAGE_SIZE * 4,
  384. KM_SLEEP | KM_MAYFAIL | KM_LARGE);
  385. nirbuf = irbsize / sizeof(*irbuf);
  386. /*
  387. * Loop over the allocation groups, starting from the last
  388. * inode returned; 0 means start of the allocation group.
  389. */
  390. rval = 0;
  391. while (XFS_BULKSTAT_UBLEFT(ubleft) && agno < mp->m_sb.sb_agcount) {
  392. cond_resched();
  393. bp = NULL;
  394. down_read(&mp->m_peraglock);
  395. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  396. up_read(&mp->m_peraglock);
  397. if (error) {
  398. /*
  399. * Skip this allocation group and go to the next one.
  400. */
  401. agno++;
  402. agino = 0;
  403. continue;
  404. }
  405. agi = XFS_BUF_TO_AGI(agbp);
  406. /*
  407. * Allocate and initialize a btree cursor for ialloc btree.
  408. */
  409. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
  410. irbp = irbuf;
  411. irbufend = irbuf + nirbuf;
  412. end_of_ag = 0;
  413. /*
  414. * If we're returning in the middle of an allocation group,
  415. * we need to get the remainder of the chunk we're in.
  416. */
  417. if (agino > 0) {
  418. /*
  419. * Lookup the inode chunk that this inode lives in.
  420. */
  421. error = xfs_inobt_lookup_le(cur, agino, 0, 0, &tmp);
  422. if (!error && /* no I/O error */
  423. tmp && /* lookup succeeded */
  424. /* got the record, should always work */
  425. !(error = xfs_inobt_get_rec(cur, &gino, &gcnt,
  426. &gfree, &i)) &&
  427. i == 1 &&
  428. /* this is the right chunk */
  429. agino < gino + XFS_INODES_PER_CHUNK &&
  430. /* lastino was not last in chunk */
  431. (chunkidx = agino - gino + 1) <
  432. XFS_INODES_PER_CHUNK &&
  433. /* there are some left allocated */
  434. xfs_inobt_maskn(chunkidx,
  435. XFS_INODES_PER_CHUNK - chunkidx) & ~gfree) {
  436. /*
  437. * Grab the chunk record. Mark all the
  438. * uninteresting inodes (because they're
  439. * before our start point) free.
  440. */
  441. for (i = 0; i < chunkidx; i++) {
  442. if (XFS_INOBT_MASK(i) & ~gfree)
  443. gcnt++;
  444. }
  445. gfree |= xfs_inobt_maskn(0, chunkidx);
  446. irbp->ir_startino = gino;
  447. irbp->ir_freecount = gcnt;
  448. irbp->ir_free = gfree;
  449. irbp++;
  450. agino = gino + XFS_INODES_PER_CHUNK;
  451. icount = XFS_INODES_PER_CHUNK - gcnt;
  452. } else {
  453. /*
  454. * If any of those tests failed, bump the
  455. * inode number (just in case).
  456. */
  457. agino++;
  458. icount = 0;
  459. }
  460. /*
  461. * In any case, increment to the next record.
  462. */
  463. if (!error)
  464. error = xfs_btree_increment(cur, 0, &tmp);
  465. } else {
  466. /*
  467. * Start of ag. Lookup the first inode chunk.
  468. */
  469. error = xfs_inobt_lookup_ge(cur, 0, 0, 0, &tmp);
  470. icount = 0;
  471. }
  472. /*
  473. * Loop through inode btree records in this ag,
  474. * until we run out of inodes or space in the buffer.
  475. */
  476. while (irbp < irbufend && icount < ubcount) {
  477. /*
  478. * Loop as long as we're unable to read the
  479. * inode btree.
  480. */
  481. while (error) {
  482. agino += XFS_INODES_PER_CHUNK;
  483. if (XFS_AGINO_TO_AGBNO(mp, agino) >=
  484. be32_to_cpu(agi->agi_length))
  485. break;
  486. error = xfs_inobt_lookup_ge(cur, agino, 0, 0,
  487. &tmp);
  488. cond_resched();
  489. }
  490. /*
  491. * If ran off the end of the ag either with an error,
  492. * or the normal way, set end and stop collecting.
  493. */
  494. if (error ||
  495. (error = xfs_inobt_get_rec(cur, &gino, &gcnt,
  496. &gfree, &i)) ||
  497. i == 0) {
  498. end_of_ag = 1;
  499. break;
  500. }
  501. /*
  502. * If this chunk has any allocated inodes, save it.
  503. * Also start read-ahead now for this chunk.
  504. */
  505. if (gcnt < XFS_INODES_PER_CHUNK) {
  506. /*
  507. * Loop over all clusters in the next chunk.
  508. * Do a readahead if there are any allocated
  509. * inodes in that cluster.
  510. */
  511. for (agbno = XFS_AGINO_TO_AGBNO(mp, gino),
  512. chunkidx = 0;
  513. chunkidx < XFS_INODES_PER_CHUNK;
  514. chunkidx += nicluster,
  515. agbno += nbcluster) {
  516. if (xfs_inobt_maskn(chunkidx,
  517. nicluster) & ~gfree)
  518. xfs_btree_reada_bufs(mp, agno,
  519. agbno, nbcluster);
  520. }
  521. irbp->ir_startino = gino;
  522. irbp->ir_freecount = gcnt;
  523. irbp->ir_free = gfree;
  524. irbp++;
  525. icount += XFS_INODES_PER_CHUNK - gcnt;
  526. }
  527. /*
  528. * Set agino to after this chunk and bump the cursor.
  529. */
  530. agino = gino + XFS_INODES_PER_CHUNK;
  531. error = xfs_btree_increment(cur, 0, &tmp);
  532. cond_resched();
  533. }
  534. /*
  535. * Drop the btree buffers and the agi buffer.
  536. * We can't hold any of the locks these represent
  537. * when calling iget.
  538. */
  539. xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
  540. xfs_buf_relse(agbp);
  541. /*
  542. * Now format all the good inodes into the user's buffer.
  543. */
  544. irbufend = irbp;
  545. for (irbp = irbuf;
  546. irbp < irbufend && XFS_BULKSTAT_UBLEFT(ubleft); irbp++) {
  547. /*
  548. * Now process this chunk of inodes.
  549. */
  550. for (agino = irbp->ir_startino, chunkidx = clustidx = 0;
  551. XFS_BULKSTAT_UBLEFT(ubleft) &&
  552. irbp->ir_freecount < XFS_INODES_PER_CHUNK;
  553. chunkidx++, clustidx++, agino++) {
  554. ASSERT(chunkidx < XFS_INODES_PER_CHUNK);
  555. /*
  556. * Recompute agbno if this is the
  557. * first inode of the cluster.
  558. *
  559. * Careful with clustidx. There can be
  560. * multiple clusters per chunk, a single
  561. * cluster per chunk or a cluster that has
  562. * inodes represented from several different
  563. * chunks (if blocksize is large).
  564. *
  565. * Because of this, the starting clustidx is
  566. * initialized to zero in this loop but must
  567. * later be reset after reading in the cluster
  568. * buffer.
  569. */
  570. if ((chunkidx & (nicluster - 1)) == 0) {
  571. agbno = XFS_AGINO_TO_AGBNO(mp,
  572. irbp->ir_startino) +
  573. ((chunkidx & nimask) >>
  574. mp->m_sb.sb_inopblog);
  575. if (flags & (BULKSTAT_FG_QUICK |
  576. BULKSTAT_FG_INLINE)) {
  577. int offset;
  578. ino = XFS_AGINO_TO_INO(mp, agno,
  579. agino);
  580. bno = XFS_AGB_TO_DADDR(mp, agno,
  581. agbno);
  582. /*
  583. * Get the inode cluster buffer
  584. */
  585. if (bp)
  586. xfs_buf_relse(bp);
  587. error = xfs_inotobp(mp, NULL, ino, &dip,
  588. &bp, &offset,
  589. XFS_IGET_BULKSTAT);
  590. if (!error)
  591. clustidx = offset / mp->m_sb.sb_inodesize;
  592. if (XFS_TEST_ERROR(error != 0,
  593. mp, XFS_ERRTAG_BULKSTAT_READ_CHUNK,
  594. XFS_RANDOM_BULKSTAT_READ_CHUNK)) {
  595. bp = NULL;
  596. ubleft = 0;
  597. rval = error;
  598. break;
  599. }
  600. }
  601. }
  602. ino = XFS_AGINO_TO_INO(mp, agno, agino);
  603. bno = XFS_AGB_TO_DADDR(mp, agno, agbno);
  604. /*
  605. * Skip if this inode is free.
  606. */
  607. if (XFS_INOBT_MASK(chunkidx) & irbp->ir_free) {
  608. lastino = ino;
  609. continue;
  610. }
  611. /*
  612. * Count used inodes as free so we can tell
  613. * when the chunk is used up.
  614. */
  615. irbp->ir_freecount++;
  616. if (!xfs_bulkstat_use_dinode(mp, flags, bp,
  617. clustidx, &dip)) {
  618. lastino = ino;
  619. continue;
  620. }
  621. /*
  622. * If we need to do an iget, cannot hold bp.
  623. * Drop it, until starting the next cluster.
  624. */
  625. if ((flags & BULKSTAT_FG_INLINE) && !dip) {
  626. if (bp)
  627. xfs_buf_relse(bp);
  628. bp = NULL;
  629. }
  630. /*
  631. * Get the inode and fill in a single buffer.
  632. * BULKSTAT_FG_QUICK uses dip to fill it in.
  633. * BULKSTAT_FG_IGET uses igets.
  634. * BULKSTAT_FG_INLINE uses dip if we have an
  635. * inline attr fork, else igets.
  636. * See: xfs_bulkstat_one & xfs_dm_bulkstat_one.
  637. * This is also used to count inodes/blks, etc
  638. * in xfs_qm_quotacheck.
  639. */
  640. ubused = statstruct_size;
  641. error = formatter(mp, ino, ubufp,
  642. ubleft, private_data,
  643. bno, &ubused, dip, &fmterror);
  644. if (fmterror == BULKSTAT_RV_NOTHING) {
  645. if (error && error != ENOENT &&
  646. error != EINVAL) {
  647. ubleft = 0;
  648. rval = error;
  649. break;
  650. }
  651. lastino = ino;
  652. continue;
  653. }
  654. if (fmterror == BULKSTAT_RV_GIVEUP) {
  655. ubleft = 0;
  656. ASSERT(error);
  657. rval = error;
  658. break;
  659. }
  660. if (ubufp)
  661. ubufp += ubused;
  662. ubleft -= ubused;
  663. ubelem++;
  664. lastino = ino;
  665. }
  666. cond_resched();
  667. }
  668. if (bp)
  669. xfs_buf_relse(bp);
  670. /*
  671. * Set up for the next loop iteration.
  672. */
  673. if (XFS_BULKSTAT_UBLEFT(ubleft)) {
  674. if (end_of_ag) {
  675. agno++;
  676. agino = 0;
  677. } else
  678. agino = XFS_INO_TO_AGINO(mp, lastino);
  679. } else
  680. break;
  681. }
  682. /*
  683. * Done, we're either out of filesystem or space to put the data.
  684. */
  685. kmem_free(irbuf);
  686. *ubcountp = ubelem;
  687. /*
  688. * Found some inodes, return them now and return the error next time.
  689. */
  690. if (ubelem)
  691. rval = 0;
  692. if (agno >= mp->m_sb.sb_agcount) {
  693. /*
  694. * If we ran out of filesystem, mark lastino as off
  695. * the end of the filesystem, so the next call
  696. * will return immediately.
  697. */
  698. *lastinop = (xfs_ino_t)XFS_AGINO_TO_INO(mp, agno, 0);
  699. *done = 1;
  700. } else
  701. *lastinop = (xfs_ino_t)lastino;
  702. return rval;
  703. }
  704. /*
  705. * Return stat information in bulk (by-inode) for the filesystem.
  706. * Special case for non-sequential one inode bulkstat.
  707. */
  708. int /* error status */
  709. xfs_bulkstat_single(
  710. xfs_mount_t *mp, /* mount point for filesystem */
  711. xfs_ino_t *lastinop, /* inode to return */
  712. char __user *buffer, /* buffer with inode stats */
  713. int *done) /* 1 if there are more stats to get */
  714. {
  715. int count; /* count value for bulkstat call */
  716. int error; /* return value */
  717. xfs_ino_t ino; /* filesystem inode number */
  718. int res; /* result from bs1 */
  719. /*
  720. * note that requesting valid inode numbers which are not allocated
  721. * to inodes will most likely cause xfs_itobp to generate warning
  722. * messages about bad magic numbers. This is ok. The fact that
  723. * the inode isn't actually an inode is handled by the
  724. * error check below. Done this way to make the usual case faster
  725. * at the expense of the error case.
  726. */
  727. ino = (xfs_ino_t)*lastinop;
  728. error = xfs_bulkstat_one(mp, ino, buffer, sizeof(xfs_bstat_t),
  729. NULL, 0, NULL, NULL, &res);
  730. if (error) {
  731. /*
  732. * Special case way failed, do it the "long" way
  733. * to see if that works.
  734. */
  735. (*lastinop)--;
  736. count = 1;
  737. if (xfs_bulkstat(mp, lastinop, &count, xfs_bulkstat_one,
  738. NULL, sizeof(xfs_bstat_t), buffer,
  739. BULKSTAT_FG_IGET, done))
  740. return error;
  741. if (count == 0 || (xfs_ino_t)*lastinop != ino)
  742. return error == EFSCORRUPTED ?
  743. XFS_ERROR(EINVAL) : error;
  744. else
  745. return 0;
  746. }
  747. *done = 0;
  748. return 0;
  749. }
  750. int
  751. xfs_inumbers_fmt(
  752. void __user *ubuffer, /* buffer to write to */
  753. const xfs_inogrp_t *buffer, /* buffer to read from */
  754. long count, /* # of elements to read */
  755. long *written) /* # of bytes written */
  756. {
  757. if (copy_to_user(ubuffer, buffer, count * sizeof(*buffer)))
  758. return -EFAULT;
  759. *written = count * sizeof(*buffer);
  760. return 0;
  761. }
  762. /*
  763. * Return inode number table for the filesystem.
  764. */
  765. int /* error status */
  766. xfs_inumbers(
  767. xfs_mount_t *mp, /* mount point for filesystem */
  768. xfs_ino_t *lastino, /* last inode returned */
  769. int *count, /* size of buffer/count returned */
  770. void __user *ubuffer,/* buffer with inode descriptions */
  771. inumbers_fmt_pf formatter)
  772. {
  773. xfs_buf_t *agbp;
  774. xfs_agino_t agino;
  775. xfs_agnumber_t agno;
  776. int bcount;
  777. xfs_inogrp_t *buffer;
  778. int bufidx;
  779. xfs_btree_cur_t *cur;
  780. int error;
  781. __int32_t gcnt;
  782. xfs_inofree_t gfree;
  783. xfs_agino_t gino;
  784. int i;
  785. xfs_ino_t ino;
  786. int left;
  787. int tmp;
  788. ino = (xfs_ino_t)*lastino;
  789. agno = XFS_INO_TO_AGNO(mp, ino);
  790. agino = XFS_INO_TO_AGINO(mp, ino);
  791. left = *count;
  792. *count = 0;
  793. bcount = MIN(left, (int)(PAGE_SIZE / sizeof(*buffer)));
  794. buffer = kmem_alloc(bcount * sizeof(*buffer), KM_SLEEP);
  795. error = bufidx = 0;
  796. cur = NULL;
  797. agbp = NULL;
  798. while (left > 0 && agno < mp->m_sb.sb_agcount) {
  799. if (agbp == NULL) {
  800. down_read(&mp->m_peraglock);
  801. error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp);
  802. up_read(&mp->m_peraglock);
  803. if (error) {
  804. /*
  805. * If we can't read the AGI of this ag,
  806. * then just skip to the next one.
  807. */
  808. ASSERT(cur == NULL);
  809. agbp = NULL;
  810. agno++;
  811. agino = 0;
  812. continue;
  813. }
  814. cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno);
  815. error = xfs_inobt_lookup_ge(cur, agino, 0, 0, &tmp);
  816. if (error) {
  817. xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
  818. cur = NULL;
  819. xfs_buf_relse(agbp);
  820. agbp = NULL;
  821. /*
  822. * Move up the last inode in the current
  823. * chunk. The lookup_ge will always get
  824. * us the first inode in the next chunk.
  825. */
  826. agino += XFS_INODES_PER_CHUNK - 1;
  827. continue;
  828. }
  829. }
  830. if ((error = xfs_inobt_get_rec(cur, &gino, &gcnt, &gfree,
  831. &i)) ||
  832. i == 0) {
  833. xfs_buf_relse(agbp);
  834. agbp = NULL;
  835. xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
  836. cur = NULL;
  837. agno++;
  838. agino = 0;
  839. continue;
  840. }
  841. agino = gino + XFS_INODES_PER_CHUNK - 1;
  842. buffer[bufidx].xi_startino = XFS_AGINO_TO_INO(mp, agno, gino);
  843. buffer[bufidx].xi_alloccount = XFS_INODES_PER_CHUNK - gcnt;
  844. buffer[bufidx].xi_allocmask = ~gfree;
  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. }