xfs_dir2_readdir.c 17 KB

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