xfs_dir2_readdir.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645
  1. /*
  2. * Copyright (c) 2000-2005 Silicon Graphics, Inc.
  3. * Copyright (c) 2013 Red Hat, Inc.
  4. * All Rights Reserved.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License as
  8. * published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it would be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write the Free Software Foundation,
  17. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  18. */
  19. #include "xfs.h"
  20. #include "xfs_fs.h"
  21. #include "xfs_types.h"
  22. #include "xfs_bit.h"
  23. #include "xfs_log.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_mount.h"
  28. #include "xfs_da_btree.h"
  29. #include "xfs_bmap_btree.h"
  30. #include "xfs_dinode.h"
  31. #include "xfs_inode.h"
  32. #include "xfs_dir2_format.h"
  33. #include "xfs_dir2_priv.h"
  34. #include "xfs_error.h"
  35. #include "xfs_trace.h"
  36. #include "xfs_bmap.h"
  37. STATIC int
  38. xfs_dir2_sf_getdents(
  39. xfs_inode_t *dp, /* incore directory inode */
  40. struct dir_context *ctx)
  41. {
  42. int i; /* shortform entry number */
  43. xfs_mount_t *mp; /* filesystem mount point */
  44. xfs_dir2_dataptr_t off; /* current entry's offset */
  45. xfs_dir2_sf_entry_t *sfep; /* shortform directory entry */
  46. xfs_dir2_sf_hdr_t *sfp; /* shortform structure */
  47. xfs_dir2_dataptr_t dot_offset;
  48. xfs_dir2_dataptr_t dotdot_offset;
  49. xfs_ino_t ino;
  50. mp = dp->i_mount;
  51. ASSERT(dp->i_df.if_flags & XFS_IFINLINE);
  52. /*
  53. * Give up if the directory is way too short.
  54. */
  55. if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) {
  56. ASSERT(XFS_FORCED_SHUTDOWN(mp));
  57. return XFS_ERROR(EIO);
  58. }
  59. ASSERT(dp->i_df.if_bytes == dp->i_d.di_size);
  60. ASSERT(dp->i_df.if_u1.if_data != NULL);
  61. sfp = (xfs_dir2_sf_hdr_t *)dp->i_df.if_u1.if_data;
  62. ASSERT(dp->i_d.di_size >= xfs_dir2_sf_hdr_size(sfp->i8count));
  63. /*
  64. * If the block number in the offset is out of range, we're done.
  65. */
  66. if (xfs_dir2_dataptr_to_db(mp, ctx->pos) > mp->m_dirdatablk)
  67. return 0;
  68. /*
  69. * Precalculate offsets for . and .. as we will always need them.
  70. *
  71. * XXX(hch): the second argument is sometimes 0 and sometimes
  72. * mp->m_dirdatablk.
  73. */
  74. dot_offset = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
  75. XFS_DIR3_DATA_DOT_OFFSET(mp));
  76. dotdot_offset = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
  77. XFS_DIR3_DATA_DOTDOT_OFFSET(mp));
  78. /*
  79. * Put . entry unless we're starting past it.
  80. */
  81. if (ctx->pos <= dot_offset) {
  82. ctx->pos = dot_offset & 0x7fffffff;
  83. if (!dir_emit(ctx, ".", 1, dp->i_ino, DT_DIR))
  84. return 0;
  85. }
  86. /*
  87. * Put .. entry unless we're starting past it.
  88. */
  89. if (ctx->pos <= dotdot_offset) {
  90. ino = xfs_dir2_sf_get_parent_ino(sfp);
  91. ctx->pos = dotdot_offset & 0x7fffffff;
  92. if (!dir_emit(ctx, "..", 2, ino, DT_DIR))
  93. return 0;
  94. }
  95. /*
  96. * Loop while there are more entries and put'ing works.
  97. */
  98. sfep = xfs_dir2_sf_firstentry(sfp);
  99. for (i = 0; i < sfp->count; i++) {
  100. off = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
  101. xfs_dir2_sf_get_offset(sfep));
  102. if (ctx->pos > off) {
  103. sfep = xfs_dir2_sf_nextentry(sfp, sfep);
  104. continue;
  105. }
  106. ino = xfs_dir2_sfe_get_ino(sfp, sfep);
  107. ctx->pos = off & 0x7fffffff;
  108. if (!dir_emit(ctx, (char *)sfep->name, sfep->namelen,
  109. ino, DT_UNKNOWN))
  110. return 0;
  111. sfep = xfs_dir2_sf_nextentry(sfp, sfep);
  112. }
  113. ctx->pos = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk + 1, 0) &
  114. 0x7fffffff;
  115. return 0;
  116. }
  117. /*
  118. * Readdir for block directories.
  119. */
  120. STATIC int
  121. xfs_dir2_block_getdents(
  122. xfs_inode_t *dp, /* incore inode */
  123. struct dir_context *ctx)
  124. {
  125. xfs_dir2_data_hdr_t *hdr; /* block header */
  126. struct xfs_buf *bp; /* buffer for block */
  127. xfs_dir2_block_tail_t *btp; /* block tail */
  128. xfs_dir2_data_entry_t *dep; /* block data entry */
  129. xfs_dir2_data_unused_t *dup; /* block unused entry */
  130. char *endptr; /* end of the data entries */
  131. int error; /* error return value */
  132. xfs_mount_t *mp; /* filesystem mount point */
  133. char *ptr; /* current data entry */
  134. int wantoff; /* starting block offset */
  135. xfs_off_t cook;
  136. mp = dp->i_mount;
  137. /*
  138. * If the block number in the offset is out of range, we're done.
  139. */
  140. if (xfs_dir2_dataptr_to_db(mp, ctx->pos) > mp->m_dirdatablk)
  141. return 0;
  142. error = xfs_dir3_block_read(NULL, dp, &bp);
  143. if (error)
  144. return error;
  145. /*
  146. * Extract the byte offset we start at from the seek pointer.
  147. * We'll skip entries before this.
  148. */
  149. wantoff = xfs_dir2_dataptr_to_off(mp, ctx->pos);
  150. hdr = bp->b_addr;
  151. xfs_dir3_data_check(dp, bp);
  152. /*
  153. * Set up values for the loop.
  154. */
  155. btp = xfs_dir2_block_tail_p(mp, hdr);
  156. ptr = (char *)xfs_dir3_data_entry_p(hdr);
  157. endptr = (char *)xfs_dir2_block_leaf_p(btp);
  158. /*
  159. * Loop over the data portion of the block.
  160. * Each object is a real entry (dep) or an unused one (dup).
  161. */
  162. while (ptr < endptr) {
  163. dup = (xfs_dir2_data_unused_t *)ptr;
  164. /*
  165. * Unused, skip it.
  166. */
  167. if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
  168. ptr += be16_to_cpu(dup->length);
  169. continue;
  170. }
  171. dep = (xfs_dir2_data_entry_t *)ptr;
  172. /*
  173. * Bump pointer for the next iteration.
  174. */
  175. ptr += xfs_dir2_data_entsize(dep->namelen);
  176. /*
  177. * The entry is before the desired starting point, skip it.
  178. */
  179. if ((char *)dep - (char *)hdr < wantoff)
  180. continue;
  181. cook = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
  182. (char *)dep - (char *)hdr);
  183. ctx->pos = cook & 0x7fffffff;
  184. /*
  185. * If it didn't fit, set the final offset to here & return.
  186. */
  187. if (!dir_emit(ctx, (char *)dep->name, dep->namelen,
  188. be64_to_cpu(dep->inumber), DT_UNKNOWN)) {
  189. xfs_trans_brelse(NULL, bp);
  190. return 0;
  191. }
  192. }
  193. /*
  194. * Reached the end of the block.
  195. * Set the offset to a non-existent block 1 and return.
  196. */
  197. ctx->pos = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk + 1, 0) &
  198. 0x7fffffff;
  199. xfs_trans_brelse(NULL, bp);
  200. return 0;
  201. }
  202. struct xfs_dir2_leaf_map_info {
  203. xfs_extlen_t map_blocks; /* number of fsbs in map */
  204. xfs_dablk_t map_off; /* last mapped file offset */
  205. int map_size; /* total entries in *map */
  206. int map_valid; /* valid entries in *map */
  207. int nmap; /* mappings to ask xfs_bmapi */
  208. xfs_dir2_db_t curdb; /* db for current block */
  209. int ra_current; /* number of read-ahead blks */
  210. int ra_index; /* *map index for read-ahead */
  211. int ra_offset; /* map entry offset for ra */
  212. int ra_want; /* readahead count wanted */
  213. struct xfs_bmbt_irec map[]; /* map vector for blocks */
  214. };
  215. STATIC int
  216. xfs_dir2_leaf_readbuf(
  217. struct xfs_inode *dp,
  218. size_t bufsize,
  219. struct xfs_dir2_leaf_map_info *mip,
  220. xfs_dir2_off_t *curoff,
  221. struct xfs_buf **bpp)
  222. {
  223. struct xfs_mount *mp = dp->i_mount;
  224. struct xfs_buf *bp = *bpp;
  225. struct xfs_bmbt_irec *map = mip->map;
  226. struct blk_plug plug;
  227. int error = 0;
  228. int length;
  229. int i;
  230. int j;
  231. /*
  232. * If we have a buffer, we need to release it and
  233. * take it out of the mapping.
  234. */
  235. if (bp) {
  236. xfs_trans_brelse(NULL, bp);
  237. bp = NULL;
  238. mip->map_blocks -= mp->m_dirblkfsbs;
  239. /*
  240. * Loop to get rid of the extents for the
  241. * directory block.
  242. */
  243. for (i = mp->m_dirblkfsbs; i > 0; ) {
  244. j = min_t(int, map->br_blockcount, i);
  245. map->br_blockcount -= j;
  246. map->br_startblock += j;
  247. map->br_startoff += j;
  248. /*
  249. * If mapping is done, pitch it from
  250. * the table.
  251. */
  252. if (!map->br_blockcount && --mip->map_valid)
  253. memmove(&map[0], &map[1],
  254. sizeof(map[0]) * mip->map_valid);
  255. i -= j;
  256. }
  257. }
  258. /*
  259. * Recalculate the readahead blocks wanted.
  260. */
  261. mip->ra_want = howmany(bufsize + mp->m_dirblksize,
  262. mp->m_sb.sb_blocksize) - 1;
  263. ASSERT(mip->ra_want >= 0);
  264. /*
  265. * If we don't have as many as we want, and we haven't
  266. * run out of data blocks, get some more mappings.
  267. */
  268. if (1 + mip->ra_want > mip->map_blocks &&
  269. mip->map_off < xfs_dir2_byte_to_da(mp, XFS_DIR2_LEAF_OFFSET)) {
  270. /*
  271. * Get more bmaps, fill in after the ones
  272. * we already have in the table.
  273. */
  274. mip->nmap = mip->map_size - mip->map_valid;
  275. error = xfs_bmapi_read(dp, mip->map_off,
  276. xfs_dir2_byte_to_da(mp, XFS_DIR2_LEAF_OFFSET) -
  277. mip->map_off,
  278. &map[mip->map_valid], &mip->nmap, 0);
  279. /*
  280. * Don't know if we should ignore this or try to return an
  281. * error. The trouble with returning errors is that readdir
  282. * will just stop without actually passing the error through.
  283. */
  284. if (error)
  285. goto out; /* XXX */
  286. /*
  287. * If we got all the mappings we asked for, set the final map
  288. * offset based on the last bmap value received. Otherwise,
  289. * we've reached the end.
  290. */
  291. if (mip->nmap == mip->map_size - mip->map_valid) {
  292. i = mip->map_valid + mip->nmap - 1;
  293. mip->map_off = map[i].br_startoff + map[i].br_blockcount;
  294. } else
  295. mip->map_off = xfs_dir2_byte_to_da(mp,
  296. XFS_DIR2_LEAF_OFFSET);
  297. /*
  298. * Look for holes in the mapping, and eliminate them. Count up
  299. * the valid blocks.
  300. */
  301. for (i = mip->map_valid; i < mip->map_valid + mip->nmap; ) {
  302. if (map[i].br_startblock == HOLESTARTBLOCK) {
  303. mip->nmap--;
  304. length = mip->map_valid + mip->nmap - i;
  305. if (length)
  306. memmove(&map[i], &map[i + 1],
  307. sizeof(map[i]) * length);
  308. } else {
  309. mip->map_blocks += map[i].br_blockcount;
  310. i++;
  311. }
  312. }
  313. mip->map_valid += mip->nmap;
  314. }
  315. /*
  316. * No valid mappings, so no more data blocks.
  317. */
  318. if (!mip->map_valid) {
  319. *curoff = xfs_dir2_da_to_byte(mp, mip->map_off);
  320. goto out;
  321. }
  322. /*
  323. * Read the directory block starting at the first mapping.
  324. */
  325. mip->curdb = xfs_dir2_da_to_db(mp, map->br_startoff);
  326. error = xfs_dir3_data_read(NULL, dp, map->br_startoff,
  327. map->br_blockcount >= mp->m_dirblkfsbs ?
  328. XFS_FSB_TO_DADDR(mp, map->br_startblock) : -1, &bp);
  329. /*
  330. * Should just skip over the data block instead of giving up.
  331. */
  332. if (error)
  333. goto out; /* XXX */
  334. /*
  335. * Adjust the current amount of read-ahead: we just read a block that
  336. * was previously ra.
  337. */
  338. if (mip->ra_current)
  339. mip->ra_current -= mp->m_dirblkfsbs;
  340. /*
  341. * Do we need more readahead?
  342. */
  343. blk_start_plug(&plug);
  344. for (mip->ra_index = mip->ra_offset = i = 0;
  345. mip->ra_want > mip->ra_current && i < mip->map_blocks;
  346. i += mp->m_dirblkfsbs) {
  347. ASSERT(mip->ra_index < mip->map_valid);
  348. /*
  349. * Read-ahead a contiguous directory block.
  350. */
  351. if (i > mip->ra_current &&
  352. map[mip->ra_index].br_blockcount >= mp->m_dirblkfsbs) {
  353. xfs_dir3_data_readahead(NULL, dp,
  354. map[mip->ra_index].br_startoff + mip->ra_offset,
  355. XFS_FSB_TO_DADDR(mp,
  356. map[mip->ra_index].br_startblock +
  357. mip->ra_offset));
  358. mip->ra_current = i;
  359. }
  360. /*
  361. * Read-ahead a non-contiguous directory block. This doesn't
  362. * use our mapping, but this is a very rare case.
  363. */
  364. else if (i > mip->ra_current) {
  365. xfs_dir3_data_readahead(NULL, dp,
  366. map[mip->ra_index].br_startoff +
  367. mip->ra_offset, -1);
  368. mip->ra_current = i;
  369. }
  370. /*
  371. * Advance offset through the mapping table.
  372. */
  373. for (j = 0; j < mp->m_dirblkfsbs; j++) {
  374. /*
  375. * The rest of this extent but not more than a dir
  376. * block.
  377. */
  378. length = min_t(int, mp->m_dirblkfsbs,
  379. map[mip->ra_index].br_blockcount -
  380. mip->ra_offset);
  381. j += length;
  382. mip->ra_offset += length;
  383. /*
  384. * Advance to the next mapping if this one is used up.
  385. */
  386. if (mip->ra_offset == map[mip->ra_index].br_blockcount) {
  387. mip->ra_offset = 0;
  388. mip->ra_index++;
  389. }
  390. }
  391. }
  392. blk_finish_plug(&plug);
  393. out:
  394. *bpp = bp;
  395. return error;
  396. }
  397. /*
  398. * Getdents (readdir) for leaf and node directories.
  399. * This reads the data blocks only, so is the same for both forms.
  400. */
  401. STATIC int
  402. xfs_dir2_leaf_getdents(
  403. xfs_inode_t *dp, /* incore directory inode */
  404. struct dir_context *ctx,
  405. size_t bufsize)
  406. {
  407. struct xfs_buf *bp = NULL; /* data block buffer */
  408. xfs_dir2_data_hdr_t *hdr; /* data block header */
  409. xfs_dir2_data_entry_t *dep; /* data entry */
  410. xfs_dir2_data_unused_t *dup; /* unused entry */
  411. int error = 0; /* error return value */
  412. int length; /* temporary length value */
  413. xfs_mount_t *mp; /* filesystem mount point */
  414. int byteoff; /* offset in current block */
  415. xfs_dir2_off_t curoff; /* current overall offset */
  416. xfs_dir2_off_t newoff; /* new curoff after new blk */
  417. char *ptr = NULL; /* pointer to current data */
  418. struct xfs_dir2_leaf_map_info *map_info;
  419. /*
  420. * If the offset is at or past the largest allowed value,
  421. * give up right away.
  422. */
  423. if (ctx->pos >= XFS_DIR2_MAX_DATAPTR)
  424. return 0;
  425. mp = dp->i_mount;
  426. /*
  427. * Set up to bmap a number of blocks based on the caller's
  428. * buffer size, the directory block size, and the filesystem
  429. * block size.
  430. */
  431. length = howmany(bufsize + mp->m_dirblksize,
  432. mp->m_sb.sb_blocksize);
  433. map_info = kmem_zalloc(offsetof(struct xfs_dir2_leaf_map_info, map) +
  434. (length * sizeof(struct xfs_bmbt_irec)),
  435. KM_SLEEP | KM_NOFS);
  436. map_info->map_size = length;
  437. /*
  438. * Inside the loop we keep the main offset value as a byte offset
  439. * in the directory file.
  440. */
  441. curoff = xfs_dir2_dataptr_to_byte(mp, ctx->pos);
  442. /*
  443. * Force this conversion through db so we truncate the offset
  444. * down to get the start of the data block.
  445. */
  446. map_info->map_off = xfs_dir2_db_to_da(mp,
  447. xfs_dir2_byte_to_db(mp, curoff));
  448. /*
  449. * Loop over directory entries until we reach the end offset.
  450. * Get more blocks and readahead as necessary.
  451. */
  452. while (curoff < XFS_DIR2_LEAF_OFFSET) {
  453. /*
  454. * If we have no buffer, or we're off the end of the
  455. * current buffer, need to get another one.
  456. */
  457. if (!bp || ptr >= (char *)bp->b_addr + mp->m_dirblksize) {
  458. error = xfs_dir2_leaf_readbuf(dp, bufsize, map_info,
  459. &curoff, &bp);
  460. if (error || !map_info->map_valid)
  461. break;
  462. /*
  463. * Having done a read, we need to set a new offset.
  464. */
  465. newoff = xfs_dir2_db_off_to_byte(mp, map_info->curdb, 0);
  466. /*
  467. * Start of the current block.
  468. */
  469. if (curoff < newoff)
  470. curoff = newoff;
  471. /*
  472. * Make sure we're in the right block.
  473. */
  474. else if (curoff > newoff)
  475. ASSERT(xfs_dir2_byte_to_db(mp, curoff) ==
  476. map_info->curdb);
  477. hdr = bp->b_addr;
  478. xfs_dir3_data_check(dp, bp);
  479. /*
  480. * Find our position in the block.
  481. */
  482. ptr = (char *)xfs_dir3_data_entry_p(hdr);
  483. byteoff = xfs_dir2_byte_to_off(mp, curoff);
  484. /*
  485. * Skip past the header.
  486. */
  487. if (byteoff == 0)
  488. curoff += xfs_dir3_data_entry_offset(hdr);
  489. /*
  490. * Skip past entries until we reach our offset.
  491. */
  492. else {
  493. while ((char *)ptr - (char *)hdr < byteoff) {
  494. dup = (xfs_dir2_data_unused_t *)ptr;
  495. if (be16_to_cpu(dup->freetag)
  496. == XFS_DIR2_DATA_FREE_TAG) {
  497. length = be16_to_cpu(dup->length);
  498. ptr += length;
  499. continue;
  500. }
  501. dep = (xfs_dir2_data_entry_t *)ptr;
  502. length =
  503. xfs_dir2_data_entsize(dep->namelen);
  504. ptr += length;
  505. }
  506. /*
  507. * Now set our real offset.
  508. */
  509. curoff =
  510. xfs_dir2_db_off_to_byte(mp,
  511. xfs_dir2_byte_to_db(mp, curoff),
  512. (char *)ptr - (char *)hdr);
  513. if (ptr >= (char *)hdr + mp->m_dirblksize) {
  514. continue;
  515. }
  516. }
  517. }
  518. /*
  519. * We have a pointer to an entry.
  520. * Is it a live one?
  521. */
  522. dup = (xfs_dir2_data_unused_t *)ptr;
  523. /*
  524. * No, it's unused, skip over it.
  525. */
  526. if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
  527. length = be16_to_cpu(dup->length);
  528. ptr += length;
  529. curoff += length;
  530. continue;
  531. }
  532. dep = (xfs_dir2_data_entry_t *)ptr;
  533. length = xfs_dir2_data_entsize(dep->namelen);
  534. ctx->pos = xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff;
  535. if (!dir_emit(ctx, (char *)dep->name, dep->namelen,
  536. be64_to_cpu(dep->inumber), DT_UNKNOWN))
  537. break;
  538. /*
  539. * Advance to next entry in the block.
  540. */
  541. ptr += length;
  542. curoff += length;
  543. /* bufsize may have just been a guess; don't go negative */
  544. bufsize = bufsize > length ? bufsize - length : 0;
  545. }
  546. /*
  547. * All done. Set output offset value to current offset.
  548. */
  549. if (curoff > xfs_dir2_dataptr_to_byte(mp, XFS_DIR2_MAX_DATAPTR))
  550. ctx->pos = XFS_DIR2_MAX_DATAPTR & 0x7fffffff;
  551. else
  552. ctx->pos = xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff;
  553. kmem_free(map_info);
  554. if (bp)
  555. xfs_trans_brelse(NULL, bp);
  556. return error;
  557. }
  558. /*
  559. * Read a directory.
  560. */
  561. int
  562. xfs_readdir(
  563. xfs_inode_t *dp,
  564. struct dir_context *ctx,
  565. size_t bufsize)
  566. {
  567. int rval; /* return value */
  568. int v; /* type-checking value */
  569. trace_xfs_readdir(dp);
  570. if (XFS_FORCED_SHUTDOWN(dp->i_mount))
  571. return XFS_ERROR(EIO);
  572. ASSERT(S_ISDIR(dp->i_d.di_mode));
  573. XFS_STATS_INC(xs_dir_getdents);
  574. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  575. rval = xfs_dir2_sf_getdents(dp, ctx);
  576. else if ((rval = xfs_dir2_isblock(NULL, dp, &v)))
  577. ;
  578. else if (v)
  579. rval = xfs_dir2_block_getdents(dp, ctx);
  580. else
  581. rval = xfs_dir2_leaf_getdents(dp, ctx, bufsize);
  582. return rval;
  583. }