dir.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922
  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_SIZE - 1))
  20. >> PAGE_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. 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. static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = {
  47. [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE,
  48. [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR,
  49. [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV,
  50. [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV,
  51. [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO,
  52. [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK,
  53. [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK,
  54. };
  55. void set_de_type(struct f2fs_dir_entry *de, umode_t mode)
  56. {
  57. de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
  58. }
  59. unsigned char get_de_type(struct f2fs_dir_entry *de)
  60. {
  61. if (de->file_type < F2FS_FT_MAX)
  62. return f2fs_filetype_table[de->file_type];
  63. return DT_UNKNOWN;
  64. }
  65. static unsigned long dir_block_index(unsigned int level,
  66. int dir_level, unsigned int idx)
  67. {
  68. unsigned long i;
  69. unsigned long bidx = 0;
  70. for (i = 0; i < level; i++)
  71. bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
  72. bidx += idx * bucket_blocks(level);
  73. return bidx;
  74. }
  75. static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
  76. struct fscrypt_name *fname,
  77. f2fs_hash_t namehash,
  78. int *max_slots,
  79. struct page **res_page)
  80. {
  81. struct f2fs_dentry_block *dentry_blk;
  82. struct f2fs_dir_entry *de;
  83. struct f2fs_dentry_ptr d;
  84. dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page);
  85. make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
  86. de = find_target_dentry(fname, namehash, max_slots, &d);
  87. if (de)
  88. *res_page = dentry_page;
  89. else
  90. kunmap(dentry_page);
  91. return de;
  92. }
  93. struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *fname,
  94. f2fs_hash_t namehash, int *max_slots,
  95. struct f2fs_dentry_ptr *d)
  96. {
  97. struct f2fs_dir_entry *de;
  98. unsigned long bit_pos = 0;
  99. int max_len = 0;
  100. struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
  101. struct fscrypt_str *name = &fname->disk_name;
  102. if (max_slots)
  103. *max_slots = 0;
  104. while (bit_pos < d->max) {
  105. if (!test_bit_le(bit_pos, d->bitmap)) {
  106. bit_pos++;
  107. max_len++;
  108. continue;
  109. }
  110. de = &d->dentry[bit_pos];
  111. if (unlikely(!de->name_len)) {
  112. bit_pos++;
  113. continue;
  114. }
  115. /* encrypted case */
  116. de_name.name = d->filename[bit_pos];
  117. de_name.len = le16_to_cpu(de->name_len);
  118. /* show encrypted name */
  119. if (fname->hash) {
  120. if (de->hash_code == fname->hash)
  121. goto found;
  122. } else if (de_name.len == name->len &&
  123. de->hash_code == namehash &&
  124. !memcmp(de_name.name, name->name, name->len))
  125. goto found;
  126. if (max_slots && max_len > *max_slots)
  127. *max_slots = max_len;
  128. max_len = 0;
  129. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  130. }
  131. de = NULL;
  132. found:
  133. if (max_slots && max_len > *max_slots)
  134. *max_slots = max_len;
  135. return de;
  136. }
  137. static struct f2fs_dir_entry *find_in_level(struct inode *dir,
  138. unsigned int level,
  139. struct fscrypt_name *fname,
  140. struct page **res_page)
  141. {
  142. struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
  143. int s = GET_DENTRY_SLOTS(name.len);
  144. unsigned int nbucket, nblock;
  145. unsigned int bidx, end_block;
  146. struct page *dentry_page;
  147. struct f2fs_dir_entry *de = NULL;
  148. bool room = false;
  149. int max_slots;
  150. f2fs_hash_t namehash;
  151. namehash = f2fs_dentry_hash(&name);
  152. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  153. nblock = bucket_blocks(level);
  154. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  155. le32_to_cpu(namehash) % nbucket);
  156. end_block = bidx + nblock;
  157. for (; bidx < end_block; bidx++) {
  158. /* no need to allocate new dentry pages to all the indices */
  159. dentry_page = find_data_page(dir, bidx);
  160. if (IS_ERR(dentry_page)) {
  161. room = true;
  162. continue;
  163. }
  164. de = find_in_block(dentry_page, fname, namehash, &max_slots,
  165. res_page);
  166. if (de)
  167. break;
  168. if (max_slots >= s)
  169. room = true;
  170. f2fs_put_page(dentry_page, 0);
  171. }
  172. if (!de && room && F2FS_I(dir)->chash != namehash) {
  173. F2FS_I(dir)->chash = namehash;
  174. F2FS_I(dir)->clevel = level;
  175. }
  176. return de;
  177. }
  178. /*
  179. * Find an entry in the specified directory with the wanted name.
  180. * It returns the page where the entry was found (as a parameter - res_page),
  181. * and the entry itself. Page is returned mapped and unlocked.
  182. * Entry is guaranteed to be valid.
  183. */
  184. struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
  185. struct qstr *child, struct page **res_page)
  186. {
  187. unsigned long npages = dir_blocks(dir);
  188. struct f2fs_dir_entry *de = NULL;
  189. unsigned int max_depth;
  190. unsigned int level;
  191. struct fscrypt_name fname;
  192. int err;
  193. *res_page = NULL;
  194. err = fscrypt_setup_filename(dir, child, 1, &fname);
  195. if (err)
  196. return NULL;
  197. if (f2fs_has_inline_dentry(dir)) {
  198. de = find_in_inline_dir(dir, &fname, res_page);
  199. goto out;
  200. }
  201. if (npages == 0)
  202. goto out;
  203. max_depth = F2FS_I(dir)->i_current_depth;
  204. if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
  205. f2fs_msg(F2FS_I_SB(dir)->sb, KERN_WARNING,
  206. "Corrupted max_depth of %lu: %u",
  207. dir->i_ino, max_depth);
  208. max_depth = MAX_DIR_HASH_DEPTH;
  209. F2FS_I(dir)->i_current_depth = max_depth;
  210. mark_inode_dirty(dir);
  211. }
  212. for (level = 0; level < max_depth; level++) {
  213. de = find_in_level(dir, level, &fname, res_page);
  214. if (de)
  215. break;
  216. }
  217. out:
  218. fscrypt_free_filename(&fname);
  219. return de;
  220. }
  221. struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
  222. {
  223. struct page *page;
  224. struct f2fs_dir_entry *de;
  225. struct f2fs_dentry_block *dentry_blk;
  226. if (f2fs_has_inline_dentry(dir))
  227. return f2fs_parent_inline_dir(dir, p);
  228. page = get_lock_data_page(dir, 0, false);
  229. if (IS_ERR(page))
  230. return NULL;
  231. dentry_blk = kmap(page);
  232. de = &dentry_blk->dentry[1];
  233. *p = page;
  234. unlock_page(page);
  235. return de;
  236. }
  237. ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr)
  238. {
  239. ino_t res = 0;
  240. struct f2fs_dir_entry *de;
  241. struct page *page;
  242. de = f2fs_find_entry(dir, qstr, &page);
  243. if (de) {
  244. res = le32_to_cpu(de->ino);
  245. f2fs_dentry_kunmap(dir, page);
  246. f2fs_put_page(page, 0);
  247. }
  248. return res;
  249. }
  250. void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
  251. struct page *page, struct inode *inode)
  252. {
  253. enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
  254. lock_page(page);
  255. f2fs_wait_on_page_writeback(page, type, true);
  256. de->ino = cpu_to_le32(inode->i_ino);
  257. set_de_type(de, inode->i_mode);
  258. f2fs_dentry_kunmap(dir, page);
  259. set_page_dirty(page);
  260. dir->i_mtime = dir->i_ctime = CURRENT_TIME;
  261. mark_inode_dirty(dir);
  262. f2fs_put_page(page, 1);
  263. }
  264. static void init_dent_inode(const struct qstr *name, struct page *ipage)
  265. {
  266. struct f2fs_inode *ri;
  267. f2fs_wait_on_page_writeback(ipage, NODE, true);
  268. /* copy name info. to this inode page */
  269. ri = F2FS_INODE(ipage);
  270. ri->i_namelen = cpu_to_le32(name->len);
  271. memcpy(ri->i_name, name->name, name->len);
  272. set_page_dirty(ipage);
  273. }
  274. int update_dent_inode(struct inode *inode, struct inode *to,
  275. const struct qstr *name)
  276. {
  277. struct page *page;
  278. if (file_enc_name(to))
  279. return 0;
  280. page = get_node_page(F2FS_I_SB(inode), inode->i_ino);
  281. if (IS_ERR(page))
  282. return PTR_ERR(page);
  283. init_dent_inode(name, page);
  284. f2fs_put_page(page, 1);
  285. return 0;
  286. }
  287. void do_make_empty_dir(struct inode *inode, struct inode *parent,
  288. struct f2fs_dentry_ptr *d)
  289. {
  290. struct qstr dot = QSTR_INIT(".", 1);
  291. struct qstr dotdot = QSTR_INIT("..", 2);
  292. /* update dirent of "." */
  293. f2fs_update_dentry(inode->i_ino, inode->i_mode, d, &dot, 0, 0);
  294. /* update dirent of ".." */
  295. f2fs_update_dentry(parent->i_ino, parent->i_mode, d, &dotdot, 0, 1);
  296. }
  297. static int make_empty_dir(struct inode *inode,
  298. struct inode *parent, struct page *page)
  299. {
  300. struct page *dentry_page;
  301. struct f2fs_dentry_block *dentry_blk;
  302. struct f2fs_dentry_ptr d;
  303. if (f2fs_has_inline_dentry(inode))
  304. return make_empty_inline_dir(inode, parent, page);
  305. dentry_page = get_new_data_page(inode, page, 0, true);
  306. if (IS_ERR(dentry_page))
  307. return PTR_ERR(dentry_page);
  308. dentry_blk = kmap_atomic(dentry_page);
  309. make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
  310. do_make_empty_dir(inode, parent, &d);
  311. kunmap_atomic(dentry_blk);
  312. set_page_dirty(dentry_page);
  313. f2fs_put_page(dentry_page, 1);
  314. return 0;
  315. }
  316. struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
  317. const struct qstr *name, struct page *dpage)
  318. {
  319. struct page *page;
  320. int err;
  321. if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
  322. page = new_inode_page(inode);
  323. if (IS_ERR(page))
  324. return page;
  325. if (S_ISDIR(inode->i_mode)) {
  326. /* in order to handle error case */
  327. get_page(page);
  328. err = make_empty_dir(inode, dir, page);
  329. if (err) {
  330. lock_page(page);
  331. goto put_error;
  332. }
  333. put_page(page);
  334. }
  335. err = f2fs_init_acl(inode, dir, page, dpage);
  336. if (err)
  337. goto put_error;
  338. err = f2fs_init_security(inode, dir, name, page);
  339. if (err)
  340. goto put_error;
  341. if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) {
  342. err = fscrypt_inherit_context(dir, inode, page, false);
  343. if (err)
  344. goto put_error;
  345. }
  346. } else {
  347. page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
  348. if (IS_ERR(page))
  349. return page;
  350. set_cold_node(inode, page);
  351. }
  352. if (name)
  353. init_dent_inode(name, page);
  354. /*
  355. * This file should be checkpointed during fsync.
  356. * We lost i_pino from now on.
  357. */
  358. if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
  359. file_lost_pino(inode);
  360. /*
  361. * If link the tmpfile to alias through linkat path,
  362. * we should remove this inode from orphan list.
  363. */
  364. if (inode->i_nlink == 0)
  365. remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
  366. inc_nlink(inode);
  367. }
  368. return page;
  369. put_error:
  370. /* truncate empty dir pages */
  371. truncate_inode_pages(&inode->i_data, 0);
  372. clear_nlink(inode);
  373. update_inode(inode, page);
  374. f2fs_put_page(page, 1);
  375. return ERR_PTR(err);
  376. }
  377. void update_parent_metadata(struct inode *dir, struct inode *inode,
  378. unsigned int current_depth)
  379. {
  380. if (inode && is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
  381. if (S_ISDIR(inode->i_mode)) {
  382. inc_nlink(dir);
  383. set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  384. }
  385. clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
  386. }
  387. dir->i_mtime = dir->i_ctime = CURRENT_TIME;
  388. mark_inode_dirty(dir);
  389. if (F2FS_I(dir)->i_current_depth != current_depth) {
  390. F2FS_I(dir)->i_current_depth = current_depth;
  391. set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  392. }
  393. if (inode && is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
  394. clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
  395. }
  396. int room_for_filename(const void *bitmap, int slots, int max_slots)
  397. {
  398. int bit_start = 0;
  399. int zero_start, zero_end;
  400. next:
  401. zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
  402. if (zero_start >= max_slots)
  403. return max_slots;
  404. zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
  405. if (zero_end - zero_start >= slots)
  406. return zero_start;
  407. bit_start = zero_end + 1;
  408. if (zero_end + 1 >= max_slots)
  409. return max_slots;
  410. goto next;
  411. }
  412. void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
  413. const struct qstr *name, f2fs_hash_t name_hash,
  414. unsigned int bit_pos)
  415. {
  416. struct f2fs_dir_entry *de;
  417. int slots = GET_DENTRY_SLOTS(name->len);
  418. int i;
  419. de = &d->dentry[bit_pos];
  420. de->hash_code = name_hash;
  421. de->name_len = cpu_to_le16(name->len);
  422. memcpy(d->filename[bit_pos], name->name, name->len);
  423. de->ino = cpu_to_le32(ino);
  424. set_de_type(de, mode);
  425. for (i = 0; i < slots; i++) {
  426. test_and_set_bit_le(bit_pos + i, (void *)d->bitmap);
  427. /* avoid wrong garbage data for readdir */
  428. if (i)
  429. (de + i)->name_len = 0;
  430. }
  431. }
  432. int f2fs_add_regular_entry(struct inode *dir, const struct qstr *new_name,
  433. struct inode *inode, nid_t ino, umode_t mode)
  434. {
  435. unsigned int bit_pos;
  436. unsigned int level;
  437. unsigned int current_depth;
  438. unsigned long bidx, block;
  439. f2fs_hash_t dentry_hash;
  440. unsigned int nbucket, nblock;
  441. struct page *dentry_page = NULL;
  442. struct f2fs_dentry_block *dentry_blk = NULL;
  443. struct f2fs_dentry_ptr d;
  444. struct page *page = NULL;
  445. int slots, err = 0;
  446. level = 0;
  447. slots = GET_DENTRY_SLOTS(new_name->len);
  448. dentry_hash = f2fs_dentry_hash(new_name);
  449. current_depth = F2FS_I(dir)->i_current_depth;
  450. if (F2FS_I(dir)->chash == dentry_hash) {
  451. level = F2FS_I(dir)->clevel;
  452. F2FS_I(dir)->chash = 0;
  453. }
  454. start:
  455. #ifdef CONFIG_F2FS_FAULT_INJECTION
  456. if (time_to_inject(FAULT_DIR_DEPTH))
  457. return -ENOSPC;
  458. #endif
  459. if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
  460. return -ENOSPC;
  461. /* Increase the depth, if required */
  462. if (level == current_depth)
  463. ++current_depth;
  464. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  465. nblock = bucket_blocks(level);
  466. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  467. (le32_to_cpu(dentry_hash) % nbucket));
  468. for (block = bidx; block <= (bidx + nblock - 1); block++) {
  469. dentry_page = get_new_data_page(dir, NULL, block, true);
  470. if (IS_ERR(dentry_page))
  471. return PTR_ERR(dentry_page);
  472. dentry_blk = kmap(dentry_page);
  473. bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
  474. slots, NR_DENTRY_IN_BLOCK);
  475. if (bit_pos < NR_DENTRY_IN_BLOCK)
  476. goto add_dentry;
  477. kunmap(dentry_page);
  478. f2fs_put_page(dentry_page, 1);
  479. }
  480. /* Move to next level to find the empty slot for new dentry */
  481. ++level;
  482. goto start;
  483. add_dentry:
  484. f2fs_wait_on_page_writeback(dentry_page, DATA, true);
  485. if (inode) {
  486. down_write(&F2FS_I(inode)->i_sem);
  487. page = init_inode_metadata(inode, dir, new_name, NULL);
  488. if (IS_ERR(page)) {
  489. err = PTR_ERR(page);
  490. goto fail;
  491. }
  492. if (f2fs_encrypted_inode(dir))
  493. file_set_enc_name(inode);
  494. }
  495. make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
  496. f2fs_update_dentry(ino, mode, &d, new_name, dentry_hash, bit_pos);
  497. set_page_dirty(dentry_page);
  498. if (inode) {
  499. /* we don't need to mark_inode_dirty now */
  500. F2FS_I(inode)->i_pino = dir->i_ino;
  501. update_inode(inode, page);
  502. f2fs_put_page(page, 1);
  503. }
  504. update_parent_metadata(dir, inode, current_depth);
  505. fail:
  506. if (inode)
  507. up_write(&F2FS_I(inode)->i_sem);
  508. if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
  509. update_inode_page(dir);
  510. clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
  511. }
  512. kunmap(dentry_page);
  513. f2fs_put_page(dentry_page, 1);
  514. return err;
  515. }
  516. /*
  517. * Caller should grab and release a rwsem by calling f2fs_lock_op() and
  518. * f2fs_unlock_op().
  519. */
  520. int __f2fs_add_link(struct inode *dir, const struct qstr *name,
  521. struct inode *inode, nid_t ino, umode_t mode)
  522. {
  523. struct fscrypt_name fname;
  524. struct qstr new_name;
  525. int err;
  526. err = fscrypt_setup_filename(dir, name, 0, &fname);
  527. if (err)
  528. return err;
  529. new_name.name = fname_name(&fname);
  530. new_name.len = fname_len(&fname);
  531. err = -EAGAIN;
  532. if (f2fs_has_inline_dentry(dir))
  533. err = f2fs_add_inline_entry(dir, &new_name, inode, ino, mode);
  534. if (err == -EAGAIN)
  535. err = f2fs_add_regular_entry(dir, &new_name, inode, ino, mode);
  536. fscrypt_free_filename(&fname);
  537. f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
  538. return err;
  539. }
  540. int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
  541. {
  542. struct page *page;
  543. int err = 0;
  544. down_write(&F2FS_I(inode)->i_sem);
  545. page = init_inode_metadata(inode, dir, NULL, NULL);
  546. if (IS_ERR(page)) {
  547. err = PTR_ERR(page);
  548. goto fail;
  549. }
  550. /* we don't need to mark_inode_dirty now */
  551. update_inode(inode, page);
  552. f2fs_put_page(page, 1);
  553. clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
  554. fail:
  555. up_write(&F2FS_I(inode)->i_sem);
  556. f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
  557. return err;
  558. }
  559. void f2fs_drop_nlink(struct inode *dir, struct inode *inode, struct page *page)
  560. {
  561. struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
  562. down_write(&F2FS_I(inode)->i_sem);
  563. if (S_ISDIR(inode->i_mode)) {
  564. drop_nlink(dir);
  565. if (page)
  566. update_inode(dir, page);
  567. else
  568. update_inode_page(dir);
  569. }
  570. inode->i_ctime = CURRENT_TIME;
  571. drop_nlink(inode);
  572. if (S_ISDIR(inode->i_mode)) {
  573. drop_nlink(inode);
  574. i_size_write(inode, 0);
  575. }
  576. up_write(&F2FS_I(inode)->i_sem);
  577. update_inode_page(inode);
  578. if (inode->i_nlink == 0)
  579. add_orphan_inode(sbi, inode->i_ino);
  580. else
  581. release_orphan_inode(sbi);
  582. }
  583. /*
  584. * It only removes the dentry from the dentry page, corresponding name
  585. * entry in name page does not need to be touched during deletion.
  586. */
  587. void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
  588. struct inode *dir, struct inode *inode)
  589. {
  590. struct f2fs_dentry_block *dentry_blk;
  591. unsigned int bit_pos;
  592. int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
  593. int i;
  594. f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
  595. if (f2fs_has_inline_dentry(dir))
  596. return f2fs_delete_inline_entry(dentry, page, dir, inode);
  597. lock_page(page);
  598. f2fs_wait_on_page_writeback(page, DATA, true);
  599. dentry_blk = page_address(page);
  600. bit_pos = dentry - dentry_blk->dentry;
  601. for (i = 0; i < slots; i++)
  602. clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
  603. /* Let's check and deallocate this dentry page */
  604. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  605. NR_DENTRY_IN_BLOCK,
  606. 0);
  607. kunmap(page); /* kunmap - pair of f2fs_find_entry */
  608. set_page_dirty(page);
  609. dir->i_ctime = dir->i_mtime = CURRENT_TIME;
  610. if (inode)
  611. f2fs_drop_nlink(dir, inode, NULL);
  612. if (bit_pos == NR_DENTRY_IN_BLOCK &&
  613. !truncate_hole(dir, page->index, page->index + 1)) {
  614. clear_page_dirty_for_io(page);
  615. ClearPagePrivate(page);
  616. ClearPageUptodate(page);
  617. inode_dec_dirty_pages(dir);
  618. }
  619. f2fs_put_page(page, 1);
  620. }
  621. bool f2fs_empty_dir(struct inode *dir)
  622. {
  623. unsigned long bidx;
  624. struct page *dentry_page;
  625. unsigned int bit_pos;
  626. struct f2fs_dentry_block *dentry_blk;
  627. unsigned long nblock = dir_blocks(dir);
  628. if (f2fs_has_inline_dentry(dir))
  629. return f2fs_empty_inline_dir(dir);
  630. for (bidx = 0; bidx < nblock; bidx++) {
  631. dentry_page = get_lock_data_page(dir, bidx, false);
  632. if (IS_ERR(dentry_page)) {
  633. if (PTR_ERR(dentry_page) == -ENOENT)
  634. continue;
  635. else
  636. return false;
  637. }
  638. dentry_blk = kmap_atomic(dentry_page);
  639. if (bidx == 0)
  640. bit_pos = 2;
  641. else
  642. bit_pos = 0;
  643. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  644. NR_DENTRY_IN_BLOCK,
  645. bit_pos);
  646. kunmap_atomic(dentry_blk);
  647. f2fs_put_page(dentry_page, 1);
  648. if (bit_pos < NR_DENTRY_IN_BLOCK)
  649. return false;
  650. }
  651. return true;
  652. }
  653. bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
  654. unsigned int start_pos, struct fscrypt_str *fstr)
  655. {
  656. unsigned char d_type = DT_UNKNOWN;
  657. unsigned int bit_pos;
  658. struct f2fs_dir_entry *de = NULL;
  659. struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
  660. bit_pos = ((unsigned long)ctx->pos % d->max);
  661. while (bit_pos < d->max) {
  662. bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
  663. if (bit_pos >= d->max)
  664. break;
  665. de = &d->dentry[bit_pos];
  666. if (de->name_len == 0) {
  667. bit_pos++;
  668. ctx->pos = start_pos + bit_pos;
  669. continue;
  670. }
  671. d_type = get_de_type(de);
  672. de_name.name = d->filename[bit_pos];
  673. de_name.len = le16_to_cpu(de->name_len);
  674. if (f2fs_encrypted_inode(d->inode)) {
  675. int save_len = fstr->len;
  676. int ret;
  677. de_name.name = f2fs_kmalloc(de_name.len, GFP_NOFS);
  678. if (!de_name.name)
  679. return false;
  680. memcpy(de_name.name, d->filename[bit_pos], de_name.len);
  681. ret = fscrypt_fname_disk_to_usr(d->inode,
  682. (u32)de->hash_code, 0,
  683. &de_name, fstr);
  684. kfree(de_name.name);
  685. if (ret < 0)
  686. return true;
  687. de_name = *fstr;
  688. fstr->len = save_len;
  689. }
  690. if (!dir_emit(ctx, de_name.name, de_name.len,
  691. le32_to_cpu(de->ino), d_type))
  692. return true;
  693. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  694. ctx->pos = start_pos + bit_pos;
  695. }
  696. return false;
  697. }
  698. static int f2fs_readdir(struct file *file, struct dir_context *ctx)
  699. {
  700. struct inode *inode = file_inode(file);
  701. unsigned long npages = dir_blocks(inode);
  702. struct f2fs_dentry_block *dentry_blk = NULL;
  703. struct page *dentry_page = NULL;
  704. struct file_ra_state *ra = &file->f_ra;
  705. unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
  706. struct f2fs_dentry_ptr d;
  707. struct fscrypt_str fstr = FSTR_INIT(NULL, 0);
  708. int err = 0;
  709. if (f2fs_encrypted_inode(inode)) {
  710. err = fscrypt_get_encryption_info(inode);
  711. if (err && err != -ENOKEY)
  712. return err;
  713. err = fscrypt_fname_alloc_buffer(inode, F2FS_NAME_LEN, &fstr);
  714. if (err < 0)
  715. return err;
  716. }
  717. if (f2fs_has_inline_dentry(inode)) {
  718. err = f2fs_read_inline_dir(file, ctx, &fstr);
  719. goto out;
  720. }
  721. /* readahead for multi pages of dir */
  722. if (npages - n > 1 && !ra_has_index(ra, n))
  723. page_cache_sync_readahead(inode->i_mapping, ra, file, n,
  724. min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
  725. for (; n < npages; n++) {
  726. dentry_page = get_lock_data_page(inode, n, false);
  727. if (IS_ERR(dentry_page)) {
  728. err = PTR_ERR(dentry_page);
  729. if (err == -ENOENT)
  730. continue;
  731. else
  732. goto out;
  733. }
  734. dentry_blk = kmap(dentry_page);
  735. make_dentry_ptr(inode, &d, (void *)dentry_blk, 1);
  736. if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK, &fstr)) {
  737. kunmap(dentry_page);
  738. f2fs_put_page(dentry_page, 1);
  739. break;
  740. }
  741. ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
  742. kunmap(dentry_page);
  743. f2fs_put_page(dentry_page, 1);
  744. }
  745. err = 0;
  746. out:
  747. fscrypt_fname_free_buffer(&fstr);
  748. return err;
  749. }
  750. static int f2fs_dir_open(struct inode *inode, struct file *filp)
  751. {
  752. if (f2fs_encrypted_inode(inode))
  753. return fscrypt_get_encryption_info(inode) ? -EACCES : 0;
  754. return 0;
  755. }
  756. const struct file_operations f2fs_dir_operations = {
  757. .llseek = generic_file_llseek,
  758. .read = generic_read_dir,
  759. .iterate_shared = f2fs_readdir,
  760. .fsync = f2fs_sync_file,
  761. .open = f2fs_dir_open,
  762. .unlocked_ioctl = f2fs_ioctl,
  763. #ifdef CONFIG_COMPAT
  764. .compat_ioctl = f2fs_compat_ioctl,
  765. #endif
  766. };