xfs_itable.c 26 KB

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