dir.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701
  1. /*
  2. * fs/f2fs/dir.c
  3. *
  4. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  5. * http://www.samsung.com/
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2 as
  9. * published by the Free Software Foundation.
  10. */
  11. #include <linux/fs.h>
  12. #include <linux/f2fs_fs.h>
  13. #include "f2fs.h"
  14. #include "node.h"
  15. #include "acl.h"
  16. #include "xattr.h"
  17. static unsigned long dir_blocks(struct inode *inode)
  18. {
  19. return ((unsigned long long) (i_size_read(inode) + PAGE_CACHE_SIZE - 1))
  20. >> PAGE_CACHE_SHIFT;
  21. }
  22. static unsigned int dir_buckets(unsigned int level, int dir_level)
  23. {
  24. if (level + dir_level < MAX_DIR_HASH_DEPTH / 2)
  25. return 1 << (level + dir_level);
  26. else
  27. return MAX_DIR_BUCKETS;
  28. }
  29. static unsigned int bucket_blocks(unsigned int level)
  30. {
  31. if (level < MAX_DIR_HASH_DEPTH / 2)
  32. return 2;
  33. else
  34. return 4;
  35. }
  36. static unsigned char f2fs_filetype_table[F2FS_FT_MAX] = {
  37. [F2FS_FT_UNKNOWN] = DT_UNKNOWN,
  38. [F2FS_FT_REG_FILE] = DT_REG,
  39. [F2FS_FT_DIR] = DT_DIR,
  40. [F2FS_FT_CHRDEV] = DT_CHR,
  41. [F2FS_FT_BLKDEV] = DT_BLK,
  42. [F2FS_FT_FIFO] = DT_FIFO,
  43. [F2FS_FT_SOCK] = DT_SOCK,
  44. [F2FS_FT_SYMLINK] = DT_LNK,
  45. };
  46. #define S_SHIFT 12
  47. static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = {
  48. [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE,
  49. [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR,
  50. [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV,
  51. [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV,
  52. [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO,
  53. [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK,
  54. [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK,
  55. };
  56. static void set_de_type(struct f2fs_dir_entry *de, struct inode *inode)
  57. {
  58. umode_t mode = inode->i_mode;
  59. de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
  60. }
  61. static unsigned long dir_block_index(unsigned int level,
  62. int dir_level, unsigned int idx)
  63. {
  64. unsigned long i;
  65. unsigned long bidx = 0;
  66. for (i = 0; i < level; i++)
  67. bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
  68. bidx += idx * bucket_blocks(level);
  69. return bidx;
  70. }
  71. static bool early_match_name(const char *name, size_t namelen,
  72. f2fs_hash_t namehash, struct f2fs_dir_entry *de)
  73. {
  74. if (le16_to_cpu(de->name_len) != namelen)
  75. return false;
  76. if (de->hash_code != namehash)
  77. return false;
  78. return true;
  79. }
  80. static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
  81. const char *name, size_t namelen, int *max_slots,
  82. f2fs_hash_t namehash, struct page **res_page)
  83. {
  84. struct f2fs_dir_entry *de;
  85. unsigned long bit_pos = 0;
  86. struct f2fs_dentry_block *dentry_blk = kmap(dentry_page);
  87. const void *dentry_bits = &dentry_blk->dentry_bitmap;
  88. int max_len = 0;
  89. while (bit_pos < NR_DENTRY_IN_BLOCK) {
  90. if (!test_bit_le(bit_pos, dentry_bits)) {
  91. if (bit_pos == 0)
  92. max_len = 1;
  93. else if (!test_bit_le(bit_pos - 1, dentry_bits))
  94. max_len++;
  95. bit_pos++;
  96. continue;
  97. }
  98. de = &dentry_blk->dentry[bit_pos];
  99. if (early_match_name(name, namelen, namehash, de)) {
  100. if (!memcmp(dentry_blk->filename[bit_pos],
  101. name, namelen)) {
  102. *res_page = dentry_page;
  103. goto found;
  104. }
  105. }
  106. if (max_len > *max_slots) {
  107. *max_slots = max_len;
  108. max_len = 0;
  109. }
  110. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  111. }
  112. de = NULL;
  113. kunmap(dentry_page);
  114. found:
  115. if (max_len > *max_slots)
  116. *max_slots = max_len;
  117. return de;
  118. }
  119. static struct f2fs_dir_entry *find_in_level(struct inode *dir,
  120. unsigned int level, const char *name, size_t namelen,
  121. f2fs_hash_t namehash, struct page **res_page)
  122. {
  123. int s = GET_DENTRY_SLOTS(namelen);
  124. unsigned int nbucket, nblock;
  125. unsigned int bidx, end_block;
  126. struct page *dentry_page;
  127. struct f2fs_dir_entry *de = NULL;
  128. bool room = false;
  129. int max_slots = 0;
  130. f2fs_bug_on(level > MAX_DIR_HASH_DEPTH);
  131. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  132. nblock = bucket_blocks(level);
  133. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  134. le32_to_cpu(namehash) % nbucket);
  135. end_block = bidx + nblock;
  136. for (; bidx < end_block; bidx++) {
  137. /* no need to allocate new dentry pages to all the indices */
  138. dentry_page = find_data_page(dir, bidx, true);
  139. if (IS_ERR(dentry_page)) {
  140. room = true;
  141. continue;
  142. }
  143. de = find_in_block(dentry_page, name, namelen,
  144. &max_slots, namehash, res_page);
  145. if (de)
  146. break;
  147. if (max_slots >= s)
  148. room = true;
  149. f2fs_put_page(dentry_page, 0);
  150. }
  151. if (!de && room && F2FS_I(dir)->chash != namehash) {
  152. F2FS_I(dir)->chash = namehash;
  153. F2FS_I(dir)->clevel = level;
  154. }
  155. return de;
  156. }
  157. /*
  158. * Find an entry in the specified directory with the wanted name.
  159. * It returns the page where the entry was found (as a parameter - res_page),
  160. * and the entry itself. Page is returned mapped and unlocked.
  161. * Entry is guaranteed to be valid.
  162. */
  163. struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
  164. struct qstr *child, struct page **res_page)
  165. {
  166. const char *name = child->name;
  167. size_t namelen = child->len;
  168. unsigned long npages = dir_blocks(dir);
  169. struct f2fs_dir_entry *de = NULL;
  170. f2fs_hash_t name_hash;
  171. unsigned int max_depth;
  172. unsigned int level;
  173. if (npages == 0)
  174. return NULL;
  175. *res_page = NULL;
  176. name_hash = f2fs_dentry_hash(name, namelen);
  177. max_depth = F2FS_I(dir)->i_current_depth;
  178. for (level = 0; level < max_depth; level++) {
  179. de = find_in_level(dir, level, name,
  180. namelen, name_hash, res_page);
  181. if (de)
  182. break;
  183. }
  184. if (!de && F2FS_I(dir)->chash != name_hash) {
  185. F2FS_I(dir)->chash = name_hash;
  186. F2FS_I(dir)->clevel = level - 1;
  187. }
  188. return de;
  189. }
  190. struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
  191. {
  192. struct page *page;
  193. struct f2fs_dir_entry *de;
  194. struct f2fs_dentry_block *dentry_blk;
  195. page = get_lock_data_page(dir, 0);
  196. if (IS_ERR(page))
  197. return NULL;
  198. dentry_blk = kmap(page);
  199. de = &dentry_blk->dentry[1];
  200. *p = page;
  201. unlock_page(page);
  202. return de;
  203. }
  204. ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr)
  205. {
  206. ino_t res = 0;
  207. struct f2fs_dir_entry *de;
  208. struct page *page;
  209. de = f2fs_find_entry(dir, qstr, &page);
  210. if (de) {
  211. res = le32_to_cpu(de->ino);
  212. kunmap(page);
  213. f2fs_put_page(page, 0);
  214. }
  215. return res;
  216. }
  217. void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
  218. struct page *page, struct inode *inode)
  219. {
  220. lock_page(page);
  221. f2fs_wait_on_page_writeback(page, DATA);
  222. de->ino = cpu_to_le32(inode->i_ino);
  223. set_de_type(de, inode);
  224. kunmap(page);
  225. set_page_dirty(page);
  226. dir->i_mtime = dir->i_ctime = CURRENT_TIME;
  227. mark_inode_dirty(dir);
  228. f2fs_put_page(page, 1);
  229. }
  230. static void init_dent_inode(const struct qstr *name, struct page *ipage)
  231. {
  232. struct f2fs_inode *ri;
  233. f2fs_wait_on_page_writeback(ipage, NODE);
  234. /* copy name info. to this inode page */
  235. ri = F2FS_INODE(ipage);
  236. ri->i_namelen = cpu_to_le32(name->len);
  237. memcpy(ri->i_name, name->name, name->len);
  238. set_page_dirty(ipage);
  239. }
  240. int update_dent_inode(struct inode *inode, const struct qstr *name)
  241. {
  242. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  243. struct page *page;
  244. page = get_node_page(sbi, inode->i_ino);
  245. if (IS_ERR(page))
  246. return PTR_ERR(page);
  247. init_dent_inode(name, page);
  248. f2fs_put_page(page, 1);
  249. return 0;
  250. }
  251. static int make_empty_dir(struct inode *inode,
  252. struct inode *parent, struct page *page)
  253. {
  254. struct page *dentry_page;
  255. struct f2fs_dentry_block *dentry_blk;
  256. struct f2fs_dir_entry *de;
  257. void *kaddr;
  258. dentry_page = get_new_data_page(inode, page, 0, true);
  259. if (IS_ERR(dentry_page))
  260. return PTR_ERR(dentry_page);
  261. kaddr = kmap_atomic(dentry_page);
  262. dentry_blk = (struct f2fs_dentry_block *)kaddr;
  263. de = &dentry_blk->dentry[0];
  264. de->name_len = cpu_to_le16(1);
  265. de->hash_code = 0;
  266. de->ino = cpu_to_le32(inode->i_ino);
  267. memcpy(dentry_blk->filename[0], ".", 1);
  268. set_de_type(de, inode);
  269. de = &dentry_blk->dentry[1];
  270. de->hash_code = 0;
  271. de->name_len = cpu_to_le16(2);
  272. de->ino = cpu_to_le32(parent->i_ino);
  273. memcpy(dentry_blk->filename[1], "..", 2);
  274. set_de_type(de, inode);
  275. test_and_set_bit_le(0, &dentry_blk->dentry_bitmap);
  276. test_and_set_bit_le(1, &dentry_blk->dentry_bitmap);
  277. kunmap_atomic(kaddr);
  278. set_page_dirty(dentry_page);
  279. f2fs_put_page(dentry_page, 1);
  280. return 0;
  281. }
  282. static struct page *init_inode_metadata(struct inode *inode,
  283. struct inode *dir, const struct qstr *name)
  284. {
  285. struct page *page;
  286. int err;
  287. if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
  288. page = new_inode_page(inode, name);
  289. if (IS_ERR(page))
  290. return page;
  291. if (S_ISDIR(inode->i_mode)) {
  292. err = make_empty_dir(inode, dir, page);
  293. if (err)
  294. goto error;
  295. }
  296. err = f2fs_init_acl(inode, dir, page);
  297. if (err)
  298. goto put_error;
  299. err = f2fs_init_security(inode, dir, name, page);
  300. if (err)
  301. goto put_error;
  302. } else {
  303. page = get_node_page(F2FS_SB(dir->i_sb), inode->i_ino);
  304. if (IS_ERR(page))
  305. return page;
  306. set_cold_node(inode, page);
  307. }
  308. init_dent_inode(name, page);
  309. /*
  310. * This file should be checkpointed during fsync.
  311. * We lost i_pino from now on.
  312. */
  313. if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
  314. file_lost_pino(inode);
  315. inc_nlink(inode);
  316. }
  317. return page;
  318. put_error:
  319. f2fs_put_page(page, 1);
  320. error:
  321. /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
  322. truncate_inode_pages(&inode->i_data, 0);
  323. truncate_blocks(inode, 0);
  324. remove_dirty_dir_inode(inode);
  325. remove_inode_page(inode);
  326. return ERR_PTR(err);
  327. }
  328. static void update_parent_metadata(struct inode *dir, struct inode *inode,
  329. unsigned int current_depth)
  330. {
  331. if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
  332. if (S_ISDIR(inode->i_mode)) {
  333. inc_nlink(dir);
  334. set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  335. }
  336. clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
  337. }
  338. dir->i_mtime = dir->i_ctime = CURRENT_TIME;
  339. mark_inode_dirty(dir);
  340. if (F2FS_I(dir)->i_current_depth != current_depth) {
  341. F2FS_I(dir)->i_current_depth = current_depth;
  342. set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  343. }
  344. if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
  345. clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
  346. }
  347. static int room_for_filename(struct f2fs_dentry_block *dentry_blk, int slots)
  348. {
  349. int bit_start = 0;
  350. int zero_start, zero_end;
  351. next:
  352. zero_start = find_next_zero_bit_le(&dentry_blk->dentry_bitmap,
  353. NR_DENTRY_IN_BLOCK,
  354. bit_start);
  355. if (zero_start >= NR_DENTRY_IN_BLOCK)
  356. return NR_DENTRY_IN_BLOCK;
  357. zero_end = find_next_bit_le(&dentry_blk->dentry_bitmap,
  358. NR_DENTRY_IN_BLOCK,
  359. zero_start);
  360. if (zero_end - zero_start >= slots)
  361. return zero_start;
  362. bit_start = zero_end + 1;
  363. if (zero_end + 1 >= NR_DENTRY_IN_BLOCK)
  364. return NR_DENTRY_IN_BLOCK;
  365. goto next;
  366. }
  367. /*
  368. * Caller should grab and release a rwsem by calling f2fs_lock_op() and
  369. * f2fs_unlock_op().
  370. */
  371. int __f2fs_add_link(struct inode *dir, const struct qstr *name,
  372. struct inode *inode)
  373. {
  374. unsigned int bit_pos;
  375. unsigned int level;
  376. unsigned int current_depth;
  377. unsigned long bidx, block;
  378. f2fs_hash_t dentry_hash;
  379. struct f2fs_dir_entry *de;
  380. unsigned int nbucket, nblock;
  381. size_t namelen = name->len;
  382. struct page *dentry_page = NULL;
  383. struct f2fs_dentry_block *dentry_blk = NULL;
  384. int slots = GET_DENTRY_SLOTS(namelen);
  385. struct page *page;
  386. int err = 0;
  387. int i;
  388. dentry_hash = f2fs_dentry_hash(name->name, name->len);
  389. level = 0;
  390. current_depth = F2FS_I(dir)->i_current_depth;
  391. if (F2FS_I(dir)->chash == dentry_hash) {
  392. level = F2FS_I(dir)->clevel;
  393. F2FS_I(dir)->chash = 0;
  394. }
  395. start:
  396. if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
  397. return -ENOSPC;
  398. /* Increase the depth, if required */
  399. if (level == current_depth)
  400. ++current_depth;
  401. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  402. nblock = bucket_blocks(level);
  403. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  404. (le32_to_cpu(dentry_hash) % nbucket));
  405. for (block = bidx; block <= (bidx + nblock - 1); block++) {
  406. dentry_page = get_new_data_page(dir, NULL, block, true);
  407. if (IS_ERR(dentry_page))
  408. return PTR_ERR(dentry_page);
  409. dentry_blk = kmap(dentry_page);
  410. bit_pos = room_for_filename(dentry_blk, slots);
  411. if (bit_pos < NR_DENTRY_IN_BLOCK)
  412. goto add_dentry;
  413. kunmap(dentry_page);
  414. f2fs_put_page(dentry_page, 1);
  415. }
  416. /* Move to next level to find the empty slot for new dentry */
  417. ++level;
  418. goto start;
  419. add_dentry:
  420. f2fs_wait_on_page_writeback(dentry_page, DATA);
  421. down_write(&F2FS_I(inode)->i_sem);
  422. page = init_inode_metadata(inode, dir, name);
  423. if (IS_ERR(page)) {
  424. err = PTR_ERR(page);
  425. goto fail;
  426. }
  427. de = &dentry_blk->dentry[bit_pos];
  428. de->hash_code = dentry_hash;
  429. de->name_len = cpu_to_le16(namelen);
  430. memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
  431. de->ino = cpu_to_le32(inode->i_ino);
  432. set_de_type(de, inode);
  433. for (i = 0; i < slots; i++)
  434. test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
  435. set_page_dirty(dentry_page);
  436. /* we don't need to mark_inode_dirty now */
  437. F2FS_I(inode)->i_pino = dir->i_ino;
  438. update_inode(inode, page);
  439. f2fs_put_page(page, 1);
  440. update_parent_metadata(dir, inode, current_depth);
  441. fail:
  442. up_write(&F2FS_I(inode)->i_sem);
  443. if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
  444. update_inode_page(dir);
  445. clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  446. }
  447. kunmap(dentry_page);
  448. f2fs_put_page(dentry_page, 1);
  449. return err;
  450. }
  451. /*
  452. * It only removes the dentry from the dentry page,corresponding name
  453. * entry in name page does not need to be touched during deletion.
  454. */
  455. void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
  456. struct inode *inode)
  457. {
  458. struct f2fs_dentry_block *dentry_blk;
  459. unsigned int bit_pos;
  460. struct address_space *mapping = page->mapping;
  461. struct inode *dir = mapping->host;
  462. int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
  463. void *kaddr = page_address(page);
  464. int i;
  465. lock_page(page);
  466. f2fs_wait_on_page_writeback(page, DATA);
  467. dentry_blk = (struct f2fs_dentry_block *)kaddr;
  468. bit_pos = dentry - (struct f2fs_dir_entry *)dentry_blk->dentry;
  469. for (i = 0; i < slots; i++)
  470. test_and_clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
  471. /* Let's check and deallocate this dentry page */
  472. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  473. NR_DENTRY_IN_BLOCK,
  474. 0);
  475. kunmap(page); /* kunmap - pair of f2fs_find_entry */
  476. set_page_dirty(page);
  477. dir->i_ctime = dir->i_mtime = CURRENT_TIME;
  478. if (inode) {
  479. struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
  480. down_write(&F2FS_I(inode)->i_sem);
  481. if (S_ISDIR(inode->i_mode)) {
  482. drop_nlink(dir);
  483. update_inode_page(dir);
  484. }
  485. inode->i_ctime = CURRENT_TIME;
  486. drop_nlink(inode);
  487. if (S_ISDIR(inode->i_mode)) {
  488. drop_nlink(inode);
  489. i_size_write(inode, 0);
  490. }
  491. up_write(&F2FS_I(inode)->i_sem);
  492. update_inode_page(inode);
  493. if (inode->i_nlink == 0)
  494. add_orphan_inode(sbi, inode->i_ino);
  495. else
  496. release_orphan_inode(sbi);
  497. }
  498. if (bit_pos == NR_DENTRY_IN_BLOCK) {
  499. truncate_hole(dir, page->index, page->index + 1);
  500. clear_page_dirty_for_io(page);
  501. ClearPageUptodate(page);
  502. inode_dec_dirty_dents(dir);
  503. }
  504. f2fs_put_page(page, 1);
  505. }
  506. bool f2fs_empty_dir(struct inode *dir)
  507. {
  508. unsigned long bidx;
  509. struct page *dentry_page;
  510. unsigned int bit_pos;
  511. struct f2fs_dentry_block *dentry_blk;
  512. unsigned long nblock = dir_blocks(dir);
  513. for (bidx = 0; bidx < nblock; bidx++) {
  514. void *kaddr;
  515. dentry_page = get_lock_data_page(dir, bidx);
  516. if (IS_ERR(dentry_page)) {
  517. if (PTR_ERR(dentry_page) == -ENOENT)
  518. continue;
  519. else
  520. return false;
  521. }
  522. kaddr = kmap_atomic(dentry_page);
  523. dentry_blk = (struct f2fs_dentry_block *)kaddr;
  524. if (bidx == 0)
  525. bit_pos = 2;
  526. else
  527. bit_pos = 0;
  528. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  529. NR_DENTRY_IN_BLOCK,
  530. bit_pos);
  531. kunmap_atomic(kaddr);
  532. f2fs_put_page(dentry_page, 1);
  533. if (bit_pos < NR_DENTRY_IN_BLOCK)
  534. return false;
  535. }
  536. return true;
  537. }
  538. static int f2fs_readdir(struct file *file, struct dir_context *ctx)
  539. {
  540. struct inode *inode = file_inode(file);
  541. unsigned long npages = dir_blocks(inode);
  542. unsigned int bit_pos = 0;
  543. struct f2fs_dentry_block *dentry_blk = NULL;
  544. struct f2fs_dir_entry *de = NULL;
  545. struct page *dentry_page = NULL;
  546. struct file_ra_state *ra = &file->f_ra;
  547. unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
  548. unsigned char d_type = DT_UNKNOWN;
  549. bit_pos = ((unsigned long)ctx->pos % NR_DENTRY_IN_BLOCK);
  550. /* readahead for multi pages of dir */
  551. if (npages - n > 1 && !ra_has_index(ra, n))
  552. page_cache_sync_readahead(inode->i_mapping, ra, file, n,
  553. min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
  554. for (; n < npages; n++) {
  555. dentry_page = get_lock_data_page(inode, n);
  556. if (IS_ERR(dentry_page))
  557. continue;
  558. dentry_blk = kmap(dentry_page);
  559. while (bit_pos < NR_DENTRY_IN_BLOCK) {
  560. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  561. NR_DENTRY_IN_BLOCK,
  562. bit_pos);
  563. if (bit_pos >= NR_DENTRY_IN_BLOCK)
  564. break;
  565. de = &dentry_blk->dentry[bit_pos];
  566. if (de->file_type < F2FS_FT_MAX)
  567. d_type = f2fs_filetype_table[de->file_type];
  568. else
  569. d_type = DT_UNKNOWN;
  570. if (!dir_emit(ctx,
  571. dentry_blk->filename[bit_pos],
  572. le16_to_cpu(de->name_len),
  573. le32_to_cpu(de->ino), d_type))
  574. goto stop;
  575. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  576. ctx->pos = n * NR_DENTRY_IN_BLOCK + bit_pos;
  577. }
  578. bit_pos = 0;
  579. ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
  580. kunmap(dentry_page);
  581. f2fs_put_page(dentry_page, 1);
  582. dentry_page = NULL;
  583. }
  584. stop:
  585. if (dentry_page && !IS_ERR(dentry_page)) {
  586. kunmap(dentry_page);
  587. f2fs_put_page(dentry_page, 1);
  588. }
  589. return 0;
  590. }
  591. const struct file_operations f2fs_dir_operations = {
  592. .llseek = generic_file_llseek,
  593. .read = generic_read_dir,
  594. .iterate = f2fs_readdir,
  595. .fsync = f2fs_sync_file,
  596. .unlocked_ioctl = f2fs_ioctl,
  597. };