xfs_itable.c 26 KB

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