dir.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * fs/f2fs/dir.c
  4. *
  5. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  6. * http://www.samsung.com/
  7. */
  8. #include <linux/unaligned.h>
  9. #include <linux/fs.h>
  10. #include <linux/f2fs_fs.h>
  11. #include <linux/sched/signal.h>
  12. #include <linux/unicode.h>
  13. #include "f2fs.h"
  14. #include "node.h"
  15. #include "acl.h"
  16. #include "xattr.h"
  17. #include <trace/events/f2fs.h>
  18. #if IS_ENABLED(CONFIG_UNICODE)
  19. extern struct kmem_cache *f2fs_cf_name_slab;
  20. #endif
  21. static unsigned long dir_blocks(struct inode *inode)
  22. {
  23. return ((unsigned long long) (i_size_read(inode) + PAGE_SIZE - 1))
  24. >> PAGE_SHIFT;
  25. }
  26. static unsigned int dir_buckets(unsigned int level, int dir_level)
  27. {
  28. if (level + dir_level < MAX_DIR_HASH_DEPTH / 2)
  29. return BIT(level + dir_level);
  30. else
  31. return MAX_DIR_BUCKETS;
  32. }
  33. static unsigned int bucket_blocks(unsigned int level)
  34. {
  35. if (level < MAX_DIR_HASH_DEPTH / 2)
  36. return 2;
  37. else
  38. return 4;
  39. }
  40. #if IS_ENABLED(CONFIG_UNICODE)
  41. /* If @dir is casefolded, initialize @fname->cf_name from @fname->usr_fname. */
  42. int f2fs_init_casefolded_name(const struct inode *dir,
  43. struct f2fs_filename *fname)
  44. {
  45. struct super_block *sb = dir->i_sb;
  46. unsigned char *buf;
  47. int len;
  48. if (IS_CASEFOLDED(dir) &&
  49. !is_dot_dotdot(fname->usr_fname->name, fname->usr_fname->len)) {
  50. buf = f2fs_kmem_cache_alloc(f2fs_cf_name_slab,
  51. GFP_NOFS, false, F2FS_SB(sb));
  52. if (!buf)
  53. return -ENOMEM;
  54. len = utf8_casefold(sb->s_encoding, fname->usr_fname,
  55. buf, F2FS_NAME_LEN);
  56. if (len <= 0) {
  57. kmem_cache_free(f2fs_cf_name_slab, buf);
  58. if (sb_has_strict_encoding(sb))
  59. return -EINVAL;
  60. /* fall back to treating name as opaque byte sequence */
  61. return 0;
  62. }
  63. fname->cf_name.name = buf;
  64. fname->cf_name.len = len;
  65. }
  66. return 0;
  67. }
  68. void f2fs_free_casefolded_name(struct f2fs_filename *fname)
  69. {
  70. unsigned char *buf = (unsigned char *)fname->cf_name.name;
  71. if (buf) {
  72. kmem_cache_free(f2fs_cf_name_slab, buf);
  73. fname->cf_name.name = NULL;
  74. }
  75. }
  76. #endif /* CONFIG_UNICODE */
  77. static int __f2fs_setup_filename(const struct inode *dir,
  78. const struct fscrypt_name *crypt_name,
  79. struct f2fs_filename *fname)
  80. {
  81. int err;
  82. memset(fname, 0, sizeof(*fname));
  83. fname->usr_fname = crypt_name->usr_fname;
  84. fname->disk_name = crypt_name->disk_name;
  85. #ifdef CONFIG_FS_ENCRYPTION
  86. fname->crypto_buf = crypt_name->crypto_buf;
  87. #endif
  88. if (crypt_name->is_nokey_name) {
  89. /* hash was decoded from the no-key name */
  90. fname->hash = cpu_to_le32(crypt_name->hash);
  91. } else {
  92. err = f2fs_init_casefolded_name(dir, fname);
  93. if (err) {
  94. f2fs_free_filename(fname);
  95. return err;
  96. }
  97. f2fs_hash_filename(dir, fname);
  98. }
  99. return 0;
  100. }
  101. /*
  102. * Prepare to search for @iname in @dir. This is similar to
  103. * fscrypt_setup_filename(), but this also handles computing the casefolded name
  104. * and the f2fs dirhash if needed, then packing all the information about this
  105. * filename up into a 'struct f2fs_filename'.
  106. */
  107. int f2fs_setup_filename(struct inode *dir, const struct qstr *iname,
  108. int lookup, struct f2fs_filename *fname)
  109. {
  110. struct fscrypt_name crypt_name;
  111. int err;
  112. err = fscrypt_setup_filename(dir, iname, lookup, &crypt_name);
  113. if (err)
  114. return err;
  115. return __f2fs_setup_filename(dir, &crypt_name, fname);
  116. }
  117. /*
  118. * Prepare to look up @dentry in @dir. This is similar to
  119. * fscrypt_prepare_lookup(), but this also handles computing the casefolded name
  120. * and the f2fs dirhash if needed, then packing all the information about this
  121. * filename up into a 'struct f2fs_filename'.
  122. */
  123. int f2fs_prepare_lookup(struct inode *dir, struct dentry *dentry,
  124. struct f2fs_filename *fname)
  125. {
  126. struct fscrypt_name crypt_name;
  127. int err;
  128. err = fscrypt_prepare_lookup(dir, dentry, &crypt_name);
  129. if (err)
  130. return err;
  131. return __f2fs_setup_filename(dir, &crypt_name, fname);
  132. }
  133. void f2fs_free_filename(struct f2fs_filename *fname)
  134. {
  135. #ifdef CONFIG_FS_ENCRYPTION
  136. kfree(fname->crypto_buf.name);
  137. fname->crypto_buf.name = NULL;
  138. #endif
  139. f2fs_free_casefolded_name(fname);
  140. }
  141. static unsigned long dir_block_index(unsigned int level,
  142. int dir_level, unsigned int idx)
  143. {
  144. unsigned long i;
  145. unsigned long bidx = 0;
  146. for (i = 0; i < level; i++)
  147. bidx += mul_u32_u32(dir_buckets(i, dir_level),
  148. bucket_blocks(i));
  149. bidx += idx * bucket_blocks(level);
  150. return bidx;
  151. }
  152. static struct f2fs_dir_entry *find_in_block(struct inode *dir,
  153. struct page *dentry_page,
  154. const struct f2fs_filename *fname,
  155. int *max_slots,
  156. bool use_hash)
  157. {
  158. struct f2fs_dentry_block *dentry_blk;
  159. struct f2fs_dentry_ptr d;
  160. dentry_blk = (struct f2fs_dentry_block *)page_address(dentry_page);
  161. make_dentry_ptr_block(dir, &d, dentry_blk);
  162. return f2fs_find_target_dentry(&d, fname, max_slots, use_hash);
  163. }
  164. static inline int f2fs_match_name(const struct inode *dir,
  165. const struct f2fs_filename *fname,
  166. const u8 *de_name, u32 de_name_len)
  167. {
  168. struct fscrypt_name f;
  169. #if IS_ENABLED(CONFIG_UNICODE)
  170. if (fname->cf_name.name)
  171. return generic_ci_match(dir, fname->usr_fname,
  172. &fname->cf_name,
  173. de_name, de_name_len);
  174. #endif
  175. f.usr_fname = fname->usr_fname;
  176. f.disk_name = fname->disk_name;
  177. #ifdef CONFIG_FS_ENCRYPTION
  178. f.crypto_buf = fname->crypto_buf;
  179. #endif
  180. return fscrypt_match_name(&f, de_name, de_name_len);
  181. }
  182. struct f2fs_dir_entry *f2fs_find_target_dentry(const struct f2fs_dentry_ptr *d,
  183. const struct f2fs_filename *fname, int *max_slots,
  184. bool use_hash)
  185. {
  186. struct f2fs_dir_entry *de;
  187. unsigned long bit_pos = 0;
  188. int max_len = 0;
  189. int res = 0;
  190. if (max_slots)
  191. *max_slots = 0;
  192. while (bit_pos < d->max) {
  193. if (!test_bit_le(bit_pos, d->bitmap)) {
  194. bit_pos++;
  195. max_len++;
  196. continue;
  197. }
  198. de = &d->dentry[bit_pos];
  199. if (unlikely(!de->name_len)) {
  200. bit_pos++;
  201. continue;
  202. }
  203. if (!use_hash || de->hash_code == fname->hash) {
  204. res = f2fs_match_name(d->inode, fname,
  205. d->filename[bit_pos],
  206. le16_to_cpu(de->name_len));
  207. if (res < 0)
  208. return ERR_PTR(res);
  209. if (res)
  210. goto found;
  211. }
  212. if (max_slots && max_len > *max_slots)
  213. *max_slots = max_len;
  214. max_len = 0;
  215. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  216. }
  217. de = NULL;
  218. found:
  219. if (max_slots && max_len > *max_slots)
  220. *max_slots = max_len;
  221. return de;
  222. }
  223. static struct f2fs_dir_entry *find_in_level(struct inode *dir,
  224. unsigned int level,
  225. const struct f2fs_filename *fname,
  226. struct page **res_page,
  227. bool use_hash)
  228. {
  229. int s = GET_DENTRY_SLOTS(fname->disk_name.len);
  230. unsigned int nbucket, nblock;
  231. unsigned int bidx, end_block, bucket_no;
  232. struct page *dentry_page;
  233. struct f2fs_dir_entry *de = NULL;
  234. pgoff_t next_pgofs;
  235. bool room = false;
  236. int max_slots;
  237. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  238. nblock = bucket_blocks(level);
  239. bucket_no = use_hash ? le32_to_cpu(fname->hash) % nbucket : 0;
  240. start_find_bucket:
  241. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  242. bucket_no);
  243. end_block = bidx + nblock;
  244. while (bidx < end_block) {
  245. /* no need to allocate new dentry pages to all the indices */
  246. dentry_page = f2fs_find_data_page(dir, bidx, &next_pgofs);
  247. if (IS_ERR(dentry_page)) {
  248. if (PTR_ERR(dentry_page) == -ENOENT) {
  249. room = true;
  250. bidx = next_pgofs;
  251. continue;
  252. } else {
  253. *res_page = dentry_page;
  254. break;
  255. }
  256. }
  257. de = find_in_block(dir, dentry_page, fname, &max_slots, use_hash);
  258. if (IS_ERR(de)) {
  259. *res_page = ERR_CAST(de);
  260. de = NULL;
  261. break;
  262. } else if (de) {
  263. *res_page = dentry_page;
  264. break;
  265. }
  266. if (max_slots >= s)
  267. room = true;
  268. f2fs_put_page(dentry_page, 0);
  269. bidx++;
  270. }
  271. if (de)
  272. return de;
  273. if (likely(use_hash)) {
  274. if (room && F2FS_I(dir)->chash != fname->hash) {
  275. F2FS_I(dir)->chash = fname->hash;
  276. F2FS_I(dir)->clevel = level;
  277. }
  278. } else if (++bucket_no < nbucket) {
  279. goto start_find_bucket;
  280. }
  281. return NULL;
  282. }
  283. struct f2fs_dir_entry *__f2fs_find_entry(struct inode *dir,
  284. const struct f2fs_filename *fname,
  285. struct page **res_page)
  286. {
  287. unsigned long npages = dir_blocks(dir);
  288. struct f2fs_dir_entry *de = NULL;
  289. unsigned int max_depth;
  290. unsigned int level;
  291. bool use_hash = true;
  292. *res_page = NULL;
  293. #if IS_ENABLED(CONFIG_UNICODE)
  294. start_find_entry:
  295. #endif
  296. if (f2fs_has_inline_dentry(dir)) {
  297. de = f2fs_find_in_inline_dir(dir, fname, res_page, use_hash);
  298. goto out;
  299. }
  300. if (npages == 0)
  301. goto out;
  302. max_depth = F2FS_I(dir)->i_current_depth;
  303. if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
  304. f2fs_warn(F2FS_I_SB(dir), "Corrupted max_depth of %lu: %u",
  305. dir->i_ino, max_depth);
  306. max_depth = MAX_DIR_HASH_DEPTH;
  307. f2fs_i_depth_write(dir, max_depth);
  308. }
  309. for (level = 0; level < max_depth; level++) {
  310. de = find_in_level(dir, level, fname, res_page, use_hash);
  311. if (de || IS_ERR(*res_page))
  312. break;
  313. }
  314. out:
  315. #if IS_ENABLED(CONFIG_UNICODE)
  316. if (IS_CASEFOLDED(dir) && !de && use_hash) {
  317. use_hash = false;
  318. goto start_find_entry;
  319. }
  320. #endif
  321. /* This is to increase the speed of f2fs_create */
  322. if (!de)
  323. F2FS_I(dir)->task = current;
  324. return de;
  325. }
  326. /*
  327. * Find an entry in the specified directory with the wanted name.
  328. * It returns the page where the entry was found (as a parameter - res_page),
  329. * and the entry itself. Page is returned mapped and unlocked.
  330. * Entry is guaranteed to be valid.
  331. */
  332. struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
  333. const struct qstr *child, struct page **res_page)
  334. {
  335. struct f2fs_dir_entry *de = NULL;
  336. struct f2fs_filename fname;
  337. int err;
  338. err = f2fs_setup_filename(dir, child, 1, &fname);
  339. if (err) {
  340. if (err == -ENOENT)
  341. *res_page = NULL;
  342. else
  343. *res_page = ERR_PTR(err);
  344. return NULL;
  345. }
  346. de = __f2fs_find_entry(dir, &fname, res_page);
  347. f2fs_free_filename(&fname);
  348. return de;
  349. }
  350. struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
  351. {
  352. return f2fs_find_entry(dir, &dotdot_name, p);
  353. }
  354. ino_t f2fs_inode_by_name(struct inode *dir, const struct qstr *qstr,
  355. struct page **page)
  356. {
  357. ino_t res = 0;
  358. struct f2fs_dir_entry *de;
  359. de = f2fs_find_entry(dir, qstr, page);
  360. if (de) {
  361. res = le32_to_cpu(de->ino);
  362. f2fs_put_page(*page, 0);
  363. }
  364. return res;
  365. }
  366. void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
  367. struct page *page, struct inode *inode)
  368. {
  369. enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
  370. lock_page(page);
  371. f2fs_wait_on_page_writeback(page, type, true, true);
  372. de->ino = cpu_to_le32(inode->i_ino);
  373. de->file_type = fs_umode_to_ftype(inode->i_mode);
  374. set_page_dirty(page);
  375. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  376. f2fs_mark_inode_dirty_sync(dir, false);
  377. f2fs_put_page(page, 1);
  378. }
  379. static void init_dent_inode(struct inode *dir, struct inode *inode,
  380. const struct f2fs_filename *fname,
  381. struct page *ipage)
  382. {
  383. struct f2fs_inode *ri;
  384. if (!fname) /* tmpfile case? */
  385. return;
  386. f2fs_wait_on_page_writeback(ipage, NODE, true, true);
  387. /* copy name info. to this inode page */
  388. ri = F2FS_INODE(ipage);
  389. ri->i_namelen = cpu_to_le32(fname->disk_name.len);
  390. memcpy(ri->i_name, fname->disk_name.name, fname->disk_name.len);
  391. if (IS_ENCRYPTED(dir)) {
  392. file_set_enc_name(inode);
  393. /*
  394. * Roll-forward recovery doesn't have encryption keys available,
  395. * so it can't compute the dirhash for encrypted+casefolded
  396. * filenames. Append it to i_name if possible. Else, disable
  397. * roll-forward recovery of the dentry (i.e., make fsync'ing the
  398. * file force a checkpoint) by setting LOST_PINO.
  399. */
  400. if (IS_CASEFOLDED(dir)) {
  401. if (fname->disk_name.len + sizeof(f2fs_hash_t) <=
  402. F2FS_NAME_LEN)
  403. put_unaligned(fname->hash, (f2fs_hash_t *)
  404. &ri->i_name[fname->disk_name.len]);
  405. else
  406. file_lost_pino(inode);
  407. }
  408. }
  409. set_page_dirty(ipage);
  410. }
  411. void f2fs_do_make_empty_dir(struct inode *inode, struct inode *parent,
  412. struct f2fs_dentry_ptr *d)
  413. {
  414. struct fscrypt_str dot = FSTR_INIT(".", 1);
  415. struct fscrypt_str dotdot = FSTR_INIT("..", 2);
  416. /* update dirent of "." */
  417. f2fs_update_dentry(inode->i_ino, inode->i_mode, d, &dot, 0, 0);
  418. /* update dirent of ".." */
  419. f2fs_update_dentry(parent->i_ino, parent->i_mode, d, &dotdot, 0, 1);
  420. }
  421. static int make_empty_dir(struct inode *inode,
  422. struct inode *parent, struct page *page)
  423. {
  424. struct page *dentry_page;
  425. struct f2fs_dentry_block *dentry_blk;
  426. struct f2fs_dentry_ptr d;
  427. if (f2fs_has_inline_dentry(inode))
  428. return f2fs_make_empty_inline_dir(inode, parent, page);
  429. dentry_page = f2fs_get_new_data_page(inode, page, 0, true);
  430. if (IS_ERR(dentry_page))
  431. return PTR_ERR(dentry_page);
  432. dentry_blk = page_address(dentry_page);
  433. make_dentry_ptr_block(NULL, &d, dentry_blk);
  434. f2fs_do_make_empty_dir(inode, parent, &d);
  435. set_page_dirty(dentry_page);
  436. f2fs_put_page(dentry_page, 1);
  437. return 0;
  438. }
  439. struct page *f2fs_init_inode_metadata(struct inode *inode, struct inode *dir,
  440. const struct f2fs_filename *fname, struct page *dpage)
  441. {
  442. struct page *page;
  443. int err;
  444. if (is_inode_flag_set(inode, FI_NEW_INODE)) {
  445. page = f2fs_new_inode_page(inode);
  446. if (IS_ERR(page))
  447. return page;
  448. if (S_ISDIR(inode->i_mode)) {
  449. /* in order to handle error case */
  450. get_page(page);
  451. err = make_empty_dir(inode, dir, page);
  452. if (err) {
  453. lock_page(page);
  454. goto put_error;
  455. }
  456. put_page(page);
  457. }
  458. err = f2fs_init_acl(inode, dir, page, dpage);
  459. if (err)
  460. goto put_error;
  461. err = f2fs_init_security(inode, dir,
  462. fname ? fname->usr_fname : NULL, page);
  463. if (err)
  464. goto put_error;
  465. if (IS_ENCRYPTED(inode)) {
  466. err = fscrypt_set_context(inode, page);
  467. if (err)
  468. goto put_error;
  469. }
  470. } else {
  471. page = f2fs_get_node_page(F2FS_I_SB(dir), inode->i_ino);
  472. if (IS_ERR(page))
  473. return page;
  474. }
  475. init_dent_inode(dir, inode, fname, page);
  476. /*
  477. * This file should be checkpointed during fsync.
  478. * We lost i_pino from now on.
  479. */
  480. if (is_inode_flag_set(inode, FI_INC_LINK)) {
  481. if (!S_ISDIR(inode->i_mode))
  482. file_lost_pino(inode);
  483. /*
  484. * If link the tmpfile to alias through linkat path,
  485. * we should remove this inode from orphan list.
  486. */
  487. if (inode->i_nlink == 0)
  488. f2fs_remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
  489. f2fs_i_links_write(inode, true);
  490. }
  491. return page;
  492. put_error:
  493. clear_nlink(inode);
  494. f2fs_update_inode(inode, page);
  495. f2fs_put_page(page, 1);
  496. return ERR_PTR(err);
  497. }
  498. void f2fs_update_parent_metadata(struct inode *dir, struct inode *inode,
  499. unsigned int current_depth)
  500. {
  501. if (inode && is_inode_flag_set(inode, FI_NEW_INODE)) {
  502. if (S_ISDIR(inode->i_mode))
  503. f2fs_i_links_write(dir, true);
  504. clear_inode_flag(inode, FI_NEW_INODE);
  505. }
  506. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  507. f2fs_mark_inode_dirty_sync(dir, false);
  508. if (F2FS_I(dir)->i_current_depth != current_depth)
  509. f2fs_i_depth_write(dir, current_depth);
  510. if (inode && is_inode_flag_set(inode, FI_INC_LINK))
  511. clear_inode_flag(inode, FI_INC_LINK);
  512. }
  513. int f2fs_room_for_filename(const void *bitmap, int slots, int max_slots)
  514. {
  515. int bit_start = 0;
  516. int zero_start, zero_end;
  517. next:
  518. zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
  519. if (zero_start >= max_slots)
  520. return max_slots;
  521. zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
  522. if (zero_end - zero_start >= slots)
  523. return zero_start;
  524. bit_start = zero_end + 1;
  525. if (zero_end + 1 >= max_slots)
  526. return max_slots;
  527. goto next;
  528. }
  529. bool f2fs_has_enough_room(struct inode *dir, struct page *ipage,
  530. const struct f2fs_filename *fname)
  531. {
  532. struct f2fs_dentry_ptr d;
  533. unsigned int bit_pos;
  534. int slots = GET_DENTRY_SLOTS(fname->disk_name.len);
  535. make_dentry_ptr_inline(dir, &d, inline_data_addr(dir, ipage));
  536. bit_pos = f2fs_room_for_filename(d.bitmap, slots, d.max);
  537. return bit_pos < d.max;
  538. }
  539. void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
  540. const struct fscrypt_str *name, f2fs_hash_t name_hash,
  541. unsigned int bit_pos)
  542. {
  543. struct f2fs_dir_entry *de;
  544. int slots = GET_DENTRY_SLOTS(name->len);
  545. int i;
  546. de = &d->dentry[bit_pos];
  547. de->hash_code = name_hash;
  548. de->name_len = cpu_to_le16(name->len);
  549. memcpy(d->filename[bit_pos], name->name, name->len);
  550. de->ino = cpu_to_le32(ino);
  551. de->file_type = fs_umode_to_ftype(mode);
  552. for (i = 0; i < slots; i++) {
  553. __set_bit_le(bit_pos + i, (void *)d->bitmap);
  554. /* avoid wrong garbage data for readdir */
  555. if (i)
  556. (de + i)->name_len = 0;
  557. }
  558. }
  559. int f2fs_add_regular_entry(struct inode *dir, const struct f2fs_filename *fname,
  560. struct inode *inode, nid_t ino, umode_t mode)
  561. {
  562. unsigned int bit_pos;
  563. unsigned int level;
  564. unsigned int current_depth;
  565. unsigned long bidx, block;
  566. unsigned int nbucket, nblock;
  567. struct page *dentry_page = NULL;
  568. struct f2fs_dentry_block *dentry_blk = NULL;
  569. struct f2fs_dentry_ptr d;
  570. struct page *page = NULL;
  571. int slots, err = 0;
  572. level = 0;
  573. slots = GET_DENTRY_SLOTS(fname->disk_name.len);
  574. current_depth = F2FS_I(dir)->i_current_depth;
  575. if (F2FS_I(dir)->chash == fname->hash) {
  576. level = F2FS_I(dir)->clevel;
  577. F2FS_I(dir)->chash = 0;
  578. }
  579. start:
  580. if (time_to_inject(F2FS_I_SB(dir), FAULT_DIR_DEPTH))
  581. return -ENOSPC;
  582. if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
  583. return -ENOSPC;
  584. /* Increase the depth, if required */
  585. if (level == current_depth)
  586. ++current_depth;
  587. nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
  588. nblock = bucket_blocks(level);
  589. bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
  590. (le32_to_cpu(fname->hash) % nbucket));
  591. for (block = bidx; block <= (bidx + nblock - 1); block++) {
  592. dentry_page = f2fs_get_new_data_page(dir, NULL, block, true);
  593. if (IS_ERR(dentry_page))
  594. return PTR_ERR(dentry_page);
  595. dentry_blk = page_address(dentry_page);
  596. bit_pos = f2fs_room_for_filename(&dentry_blk->dentry_bitmap,
  597. slots, NR_DENTRY_IN_BLOCK);
  598. if (bit_pos < NR_DENTRY_IN_BLOCK)
  599. goto add_dentry;
  600. f2fs_put_page(dentry_page, 1);
  601. }
  602. /* Move to next level to find the empty slot for new dentry */
  603. ++level;
  604. goto start;
  605. add_dentry:
  606. f2fs_wait_on_page_writeback(dentry_page, DATA, true, true);
  607. if (inode) {
  608. f2fs_down_write(&F2FS_I(inode)->i_sem);
  609. page = f2fs_init_inode_metadata(inode, dir, fname, NULL);
  610. if (IS_ERR(page)) {
  611. err = PTR_ERR(page);
  612. goto fail;
  613. }
  614. }
  615. make_dentry_ptr_block(NULL, &d, dentry_blk);
  616. f2fs_update_dentry(ino, mode, &d, &fname->disk_name, fname->hash,
  617. bit_pos);
  618. set_page_dirty(dentry_page);
  619. if (inode) {
  620. f2fs_i_pino_write(inode, dir->i_ino);
  621. /* synchronize inode page's data from inode cache */
  622. if (is_inode_flag_set(inode, FI_NEW_INODE))
  623. f2fs_update_inode(inode, page);
  624. f2fs_put_page(page, 1);
  625. }
  626. f2fs_update_parent_metadata(dir, inode, current_depth);
  627. fail:
  628. if (inode)
  629. f2fs_up_write(&F2FS_I(inode)->i_sem);
  630. f2fs_put_page(dentry_page, 1);
  631. return err;
  632. }
  633. int f2fs_add_dentry(struct inode *dir, const struct f2fs_filename *fname,
  634. struct inode *inode, nid_t ino, umode_t mode)
  635. {
  636. int err = -EAGAIN;
  637. if (f2fs_has_inline_dentry(dir)) {
  638. /*
  639. * Should get i_xattr_sem to keep the lock order:
  640. * i_xattr_sem -> inode_page lock used by f2fs_setxattr.
  641. */
  642. f2fs_down_read(&F2FS_I(dir)->i_xattr_sem);
  643. err = f2fs_add_inline_entry(dir, fname, inode, ino, mode);
  644. f2fs_up_read(&F2FS_I(dir)->i_xattr_sem);
  645. }
  646. if (err == -EAGAIN)
  647. err = f2fs_add_regular_entry(dir, fname, inode, ino, mode);
  648. f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
  649. return err;
  650. }
  651. /*
  652. * Caller should grab and release a rwsem by calling f2fs_lock_op() and
  653. * f2fs_unlock_op().
  654. */
  655. int f2fs_do_add_link(struct inode *dir, const struct qstr *name,
  656. struct inode *inode, nid_t ino, umode_t mode)
  657. {
  658. struct f2fs_filename fname;
  659. struct page *page = NULL;
  660. struct f2fs_dir_entry *de = NULL;
  661. int err;
  662. err = f2fs_setup_filename(dir, name, 0, &fname);
  663. if (err)
  664. return err;
  665. /*
  666. * An immature stackable filesystem shows a race condition between lookup
  667. * and create. If we have same task when doing lookup and create, it's
  668. * definitely fine as expected by VFS normally. Otherwise, let's just
  669. * verify on-disk dentry one more time, which guarantees filesystem
  670. * consistency more.
  671. */
  672. if (current != F2FS_I(dir)->task) {
  673. de = __f2fs_find_entry(dir, &fname, &page);
  674. F2FS_I(dir)->task = NULL;
  675. }
  676. if (de) {
  677. f2fs_put_page(page, 0);
  678. err = -EEXIST;
  679. } else if (IS_ERR(page)) {
  680. err = PTR_ERR(page);
  681. } else {
  682. err = f2fs_add_dentry(dir, &fname, inode, ino, mode);
  683. }
  684. f2fs_free_filename(&fname);
  685. return err;
  686. }
  687. int f2fs_do_tmpfile(struct inode *inode, struct inode *dir,
  688. struct f2fs_filename *fname)
  689. {
  690. struct page *page;
  691. int err = 0;
  692. f2fs_down_write(&F2FS_I(inode)->i_sem);
  693. page = f2fs_init_inode_metadata(inode, dir, fname, NULL);
  694. if (IS_ERR(page)) {
  695. err = PTR_ERR(page);
  696. goto fail;
  697. }
  698. f2fs_put_page(page, 1);
  699. clear_inode_flag(inode, FI_NEW_INODE);
  700. f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
  701. fail:
  702. f2fs_up_write(&F2FS_I(inode)->i_sem);
  703. return err;
  704. }
  705. void f2fs_drop_nlink(struct inode *dir, struct inode *inode)
  706. {
  707. struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
  708. f2fs_down_write(&F2FS_I(inode)->i_sem);
  709. if (S_ISDIR(inode->i_mode))
  710. f2fs_i_links_write(dir, false);
  711. inode_set_ctime_current(inode);
  712. f2fs_i_links_write(inode, false);
  713. if (S_ISDIR(inode->i_mode)) {
  714. f2fs_i_links_write(inode, false);
  715. f2fs_i_size_write(inode, 0);
  716. }
  717. f2fs_up_write(&F2FS_I(inode)->i_sem);
  718. if (inode->i_nlink == 0)
  719. f2fs_add_orphan_inode(inode);
  720. else
  721. f2fs_release_orphan_inode(sbi);
  722. }
  723. /*
  724. * It only removes the dentry from the dentry page, corresponding name
  725. * entry in name page does not need to be touched during deletion.
  726. */
  727. void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
  728. struct inode *dir, struct inode *inode)
  729. {
  730. struct f2fs_dentry_block *dentry_blk;
  731. unsigned int bit_pos;
  732. int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
  733. pgoff_t index = page_folio(page)->index;
  734. int i;
  735. f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
  736. if (F2FS_OPTION(F2FS_I_SB(dir)).fsync_mode == FSYNC_MODE_STRICT)
  737. f2fs_add_ino_entry(F2FS_I_SB(dir), dir->i_ino, TRANS_DIR_INO);
  738. if (f2fs_has_inline_dentry(dir))
  739. return f2fs_delete_inline_entry(dentry, page, dir, inode);
  740. lock_page(page);
  741. f2fs_wait_on_page_writeback(page, DATA, true, true);
  742. dentry_blk = page_address(page);
  743. bit_pos = dentry - dentry_blk->dentry;
  744. for (i = 0; i < slots; i++)
  745. __clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
  746. /* Let's check and deallocate this dentry page */
  747. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  748. NR_DENTRY_IN_BLOCK,
  749. 0);
  750. set_page_dirty(page);
  751. if (bit_pos == NR_DENTRY_IN_BLOCK &&
  752. !f2fs_truncate_hole(dir, index, index + 1)) {
  753. f2fs_clear_page_cache_dirty_tag(page_folio(page));
  754. clear_page_dirty_for_io(page);
  755. ClearPageUptodate(page);
  756. clear_page_private_all(page);
  757. inode_dec_dirty_pages(dir);
  758. f2fs_remove_dirty_inode(dir);
  759. }
  760. f2fs_put_page(page, 1);
  761. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  762. f2fs_mark_inode_dirty_sync(dir, false);
  763. if (inode)
  764. f2fs_drop_nlink(dir, inode);
  765. }
  766. bool f2fs_empty_dir(struct inode *dir)
  767. {
  768. unsigned long bidx = 0;
  769. struct page *dentry_page;
  770. unsigned int bit_pos;
  771. struct f2fs_dentry_block *dentry_blk;
  772. unsigned long nblock = dir_blocks(dir);
  773. if (f2fs_has_inline_dentry(dir))
  774. return f2fs_empty_inline_dir(dir);
  775. while (bidx < nblock) {
  776. pgoff_t next_pgofs;
  777. dentry_page = f2fs_find_data_page(dir, bidx, &next_pgofs);
  778. if (IS_ERR(dentry_page)) {
  779. if (PTR_ERR(dentry_page) == -ENOENT) {
  780. bidx = next_pgofs;
  781. continue;
  782. } else {
  783. return false;
  784. }
  785. }
  786. dentry_blk = page_address(dentry_page);
  787. if (bidx == 0)
  788. bit_pos = 2;
  789. else
  790. bit_pos = 0;
  791. bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
  792. NR_DENTRY_IN_BLOCK,
  793. bit_pos);
  794. f2fs_put_page(dentry_page, 0);
  795. if (bit_pos < NR_DENTRY_IN_BLOCK)
  796. return false;
  797. bidx++;
  798. }
  799. return true;
  800. }
  801. int f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
  802. unsigned int start_pos, struct fscrypt_str *fstr)
  803. {
  804. unsigned char d_type = DT_UNKNOWN;
  805. unsigned int bit_pos;
  806. struct f2fs_dir_entry *de = NULL;
  807. struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
  808. struct f2fs_sb_info *sbi = F2FS_I_SB(d->inode);
  809. struct blk_plug plug;
  810. bool readdir_ra = sbi->readdir_ra;
  811. bool found_valid_dirent = false;
  812. int err = 0;
  813. bit_pos = ((unsigned long)ctx->pos % d->max);
  814. if (readdir_ra)
  815. blk_start_plug(&plug);
  816. while (bit_pos < d->max) {
  817. bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
  818. if (bit_pos >= d->max)
  819. break;
  820. de = &d->dentry[bit_pos];
  821. if (de->name_len == 0) {
  822. if (found_valid_dirent || !bit_pos) {
  823. f2fs_warn_ratelimited(sbi,
  824. "invalid namelen(0), ino:%u, run fsck to fix.",
  825. le32_to_cpu(de->ino));
  826. set_sbi_flag(sbi, SBI_NEED_FSCK);
  827. }
  828. bit_pos++;
  829. ctx->pos = start_pos + bit_pos;
  830. continue;
  831. }
  832. d_type = fs_ftype_to_dtype(de->file_type);
  833. de_name.name = d->filename[bit_pos];
  834. de_name.len = le16_to_cpu(de->name_len);
  835. /* check memory boundary before moving forward */
  836. bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
  837. if (unlikely(bit_pos > d->max ||
  838. le16_to_cpu(de->name_len) > F2FS_NAME_LEN)) {
  839. f2fs_warn(sbi, "%s: corrupted namelen=%d, run fsck to fix.",
  840. __func__, le16_to_cpu(de->name_len));
  841. set_sbi_flag(sbi, SBI_NEED_FSCK);
  842. err = -EFSCORRUPTED;
  843. f2fs_handle_error(sbi, ERROR_CORRUPTED_DIRENT);
  844. goto out;
  845. }
  846. if (IS_ENCRYPTED(d->inode)) {
  847. int save_len = fstr->len;
  848. err = fscrypt_fname_disk_to_usr(d->inode,
  849. (u32)le32_to_cpu(de->hash_code),
  850. 0, &de_name, fstr);
  851. if (err)
  852. goto out;
  853. de_name = *fstr;
  854. fstr->len = save_len;
  855. }
  856. if (!dir_emit(ctx, de_name.name, de_name.len,
  857. le32_to_cpu(de->ino), d_type)) {
  858. err = 1;
  859. goto out;
  860. }
  861. if (readdir_ra)
  862. f2fs_ra_node_page(sbi, le32_to_cpu(de->ino));
  863. ctx->pos = start_pos + bit_pos;
  864. found_valid_dirent = true;
  865. }
  866. out:
  867. if (readdir_ra)
  868. blk_finish_plug(&plug);
  869. return err;
  870. }
  871. static int f2fs_readdir(struct file *file, struct dir_context *ctx)
  872. {
  873. struct inode *inode = file_inode(file);
  874. unsigned long npages = dir_blocks(inode);
  875. struct f2fs_dentry_block *dentry_blk = NULL;
  876. struct page *dentry_page = NULL;
  877. struct file_ra_state *ra = &file->f_ra;
  878. loff_t start_pos = ctx->pos;
  879. unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
  880. struct f2fs_dentry_ptr d;
  881. struct fscrypt_str fstr = FSTR_INIT(NULL, 0);
  882. int err = 0;
  883. if (IS_ENCRYPTED(inode)) {
  884. err = fscrypt_prepare_readdir(inode);
  885. if (err)
  886. goto out;
  887. err = fscrypt_fname_alloc_buffer(F2FS_NAME_LEN, &fstr);
  888. if (err < 0)
  889. goto out;
  890. }
  891. if (f2fs_has_inline_dentry(inode)) {
  892. err = f2fs_read_inline_dir(file, ctx, &fstr);
  893. goto out_free;
  894. }
  895. for (; n < npages; ctx->pos = n * NR_DENTRY_IN_BLOCK) {
  896. pgoff_t next_pgofs;
  897. /* allow readdir() to be interrupted */
  898. if (fatal_signal_pending(current)) {
  899. err = -ERESTARTSYS;
  900. goto out_free;
  901. }
  902. cond_resched();
  903. /* readahead for multi pages of dir */
  904. if (npages - n > 1 && !ra_has_index(ra, n))
  905. page_cache_sync_readahead(inode->i_mapping, ra, file, n,
  906. min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
  907. dentry_page = f2fs_find_data_page(inode, n, &next_pgofs);
  908. if (IS_ERR(dentry_page)) {
  909. err = PTR_ERR(dentry_page);
  910. if (err == -ENOENT) {
  911. err = 0;
  912. n = next_pgofs;
  913. continue;
  914. } else {
  915. goto out_free;
  916. }
  917. }
  918. dentry_blk = page_address(dentry_page);
  919. make_dentry_ptr_block(inode, &d, dentry_blk);
  920. err = f2fs_fill_dentries(ctx, &d,
  921. n * NR_DENTRY_IN_BLOCK, &fstr);
  922. if (err) {
  923. f2fs_put_page(dentry_page, 0);
  924. break;
  925. }
  926. f2fs_put_page(dentry_page, 0);
  927. n++;
  928. }
  929. out_free:
  930. fscrypt_fname_free_buffer(&fstr);
  931. out:
  932. trace_f2fs_readdir(inode, start_pos, ctx->pos, err);
  933. return err < 0 ? err : 0;
  934. }
  935. const struct file_operations f2fs_dir_operations = {
  936. .llseek = generic_file_llseek,
  937. .read = generic_read_dir,
  938. .iterate_shared = f2fs_readdir,
  939. .fsync = f2fs_sync_file,
  940. .unlocked_ioctl = f2fs_ioctl,
  941. #ifdef CONFIG_COMPAT
  942. .compat_ioctl = f2fs_compat_ioctl,
  943. #endif
  944. };