xfs_itable.c 26 KB

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