4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
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.
12 #include <linux/f2fs_fs.h>
13 #include <linux/sched/signal.h>
18 #include <trace/events/f2fs.h>
20 static unsigned long dir_blocks(struct inode *inode)
22 return ((unsigned long long) (i_size_read(inode) + PAGE_SIZE - 1))
26 static unsigned int dir_buckets(unsigned int level, int dir_level)
28 if (level + dir_level < MAX_DIR_HASH_DEPTH / 2)
29 return 1 << (level + dir_level);
31 return MAX_DIR_BUCKETS;
34 static unsigned int bucket_blocks(unsigned int level)
36 if (level < MAX_DIR_HASH_DEPTH / 2)
42 static unsigned char f2fs_filetype_table[F2FS_FT_MAX] = {
43 [F2FS_FT_UNKNOWN] = DT_UNKNOWN,
44 [F2FS_FT_REG_FILE] = DT_REG,
45 [F2FS_FT_DIR] = DT_DIR,
46 [F2FS_FT_CHRDEV] = DT_CHR,
47 [F2FS_FT_BLKDEV] = DT_BLK,
48 [F2FS_FT_FIFO] = DT_FIFO,
49 [F2FS_FT_SOCK] = DT_SOCK,
50 [F2FS_FT_SYMLINK] = DT_LNK,
53 static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = {
54 [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE,
55 [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR,
56 [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV,
57 [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV,
58 [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO,
59 [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK,
60 [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK,
63 static void set_de_type(struct f2fs_dir_entry *de, umode_t mode)
65 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
68 unsigned char f2fs_get_de_type(struct f2fs_dir_entry *de)
70 if (de->file_type < F2FS_FT_MAX)
71 return f2fs_filetype_table[de->file_type];
75 static unsigned long dir_block_index(unsigned int level,
76 int dir_level, unsigned int idx)
79 unsigned long bidx = 0;
81 for (i = 0; i < level; i++)
82 bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
83 bidx += idx * bucket_blocks(level);
87 static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
88 struct fscrypt_name *fname,
91 struct page **res_page)
93 struct f2fs_dentry_block *dentry_blk;
94 struct f2fs_dir_entry *de;
95 struct f2fs_dentry_ptr d;
97 dentry_blk = (struct f2fs_dentry_block *)page_address(dentry_page);
99 make_dentry_ptr_block(NULL, &d, dentry_blk);
100 de = f2fs_find_target_dentry(fname, namehash, max_slots, &d);
102 *res_page = dentry_page;
107 struct f2fs_dir_entry *f2fs_find_target_dentry(struct fscrypt_name *fname,
108 f2fs_hash_t namehash, int *max_slots,
109 struct f2fs_dentry_ptr *d)
111 struct f2fs_dir_entry *de;
112 unsigned long bit_pos = 0;
117 while (bit_pos < d->max) {
118 if (!test_bit_le(bit_pos, d->bitmap)) {
124 de = &d->dentry[bit_pos];
126 if (unlikely(!de->name_len)) {
131 if (de->hash_code == namehash &&
132 fscrypt_match_name(fname, d->filename[bit_pos],
133 le16_to_cpu(de->name_len)))
136 if (max_slots && max_len > *max_slots)
137 *max_slots = max_len;
140 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
145 if (max_slots && max_len > *max_slots)
146 *max_slots = max_len;
150 static struct f2fs_dir_entry *find_in_level(struct inode *dir,
152 struct fscrypt_name *fname,
153 struct page **res_page)
155 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
156 int s = GET_DENTRY_SLOTS(name.len);
157 unsigned int nbucket, nblock;
158 unsigned int bidx, end_block;
159 struct page *dentry_page;
160 struct f2fs_dir_entry *de = NULL;
163 f2fs_hash_t namehash = f2fs_dentry_hash(&name, fname);
165 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
166 nblock = bucket_blocks(level);
168 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
169 le32_to_cpu(namehash) % nbucket);
170 end_block = bidx + nblock;
172 for (; bidx < end_block; bidx++) {
173 /* no need to allocate new dentry pages to all the indices */
174 dentry_page = f2fs_find_data_page(dir, bidx);
175 if (IS_ERR(dentry_page)) {
176 if (PTR_ERR(dentry_page) == -ENOENT) {
180 *res_page = dentry_page;
185 de = find_in_block(dentry_page, fname, namehash, &max_slots,
192 f2fs_put_page(dentry_page, 0);
195 if (!de && room && F2FS_I(dir)->chash != namehash) {
196 F2FS_I(dir)->chash = namehash;
197 F2FS_I(dir)->clevel = level;
203 struct f2fs_dir_entry *__f2fs_find_entry(struct inode *dir,
204 struct fscrypt_name *fname, struct page **res_page)
206 unsigned long npages = dir_blocks(dir);
207 struct f2fs_dir_entry *de = NULL;
208 unsigned int max_depth;
211 if (f2fs_has_inline_dentry(dir)) {
213 de = f2fs_find_in_inline_dir(dir, fname, res_page);
222 max_depth = F2FS_I(dir)->i_current_depth;
223 if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
224 f2fs_msg(F2FS_I_SB(dir)->sb, KERN_WARNING,
225 "Corrupted max_depth of %lu: %u",
226 dir->i_ino, max_depth);
227 max_depth = MAX_DIR_HASH_DEPTH;
228 f2fs_i_depth_write(dir, max_depth);
231 for (level = 0; level < max_depth; level++) {
233 de = find_in_level(dir, level, fname, res_page);
234 if (de || IS_ERR(*res_page))
238 /* This is to increase the speed of f2fs_create */
240 F2FS_I(dir)->task = current;
245 * Find an entry in the specified directory with the wanted name.
246 * It returns the page where the entry was found (as a parameter - res_page),
247 * and the entry itself. Page is returned mapped and unlocked.
248 * Entry is guaranteed to be valid.
250 struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
251 const struct qstr *child, struct page **res_page)
253 struct f2fs_dir_entry *de = NULL;
254 struct fscrypt_name fname;
257 err = fscrypt_setup_filename(dir, child, 1, &fname);
262 *res_page = ERR_PTR(err);
266 de = __f2fs_find_entry(dir, &fname, res_page);
268 fscrypt_free_filename(&fname);
272 struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
274 struct qstr dotdot = QSTR_INIT("..", 2);
276 return f2fs_find_entry(dir, &dotdot, p);
279 ino_t f2fs_inode_by_name(struct inode *dir, const struct qstr *qstr,
283 struct f2fs_dir_entry *de;
285 de = f2fs_find_entry(dir, qstr, page);
287 res = le32_to_cpu(de->ino);
288 f2fs_put_page(*page, 0);
294 void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
295 struct page *page, struct inode *inode)
297 enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
299 f2fs_wait_on_page_writeback(page, type, true);
300 de->ino = cpu_to_le32(inode->i_ino);
301 set_de_type(de, inode->i_mode);
302 set_page_dirty(page);
304 dir->i_mtime = dir->i_ctime = current_time(dir);
305 f2fs_mark_inode_dirty_sync(dir, false);
306 f2fs_put_page(page, 1);
309 static void init_dent_inode(const struct qstr *name, struct page *ipage)
311 struct f2fs_inode *ri;
313 f2fs_wait_on_page_writeback(ipage, NODE, true);
315 /* copy name info. to this inode page */
316 ri = F2FS_INODE(ipage);
317 ri->i_namelen = cpu_to_le32(name->len);
318 memcpy(ri->i_name, name->name, name->len);
319 set_page_dirty(ipage);
322 void f2fs_do_make_empty_dir(struct inode *inode, struct inode *parent,
323 struct f2fs_dentry_ptr *d)
325 struct qstr dot = QSTR_INIT(".", 1);
326 struct qstr dotdot = QSTR_INIT("..", 2);
328 /* update dirent of "." */
329 f2fs_update_dentry(inode->i_ino, inode->i_mode, d, &dot, 0, 0);
331 /* update dirent of ".." */
332 f2fs_update_dentry(parent->i_ino, parent->i_mode, d, &dotdot, 0, 1);
335 static int make_empty_dir(struct inode *inode,
336 struct inode *parent, struct page *page)
338 struct page *dentry_page;
339 struct f2fs_dentry_block *dentry_blk;
340 struct f2fs_dentry_ptr d;
342 if (f2fs_has_inline_dentry(inode))
343 return f2fs_make_empty_inline_dir(inode, parent, page);
345 dentry_page = f2fs_get_new_data_page(inode, page, 0, true);
346 if (IS_ERR(dentry_page))
347 return PTR_ERR(dentry_page);
349 dentry_blk = page_address(dentry_page);
351 make_dentry_ptr_block(NULL, &d, dentry_blk);
352 f2fs_do_make_empty_dir(inode, parent, &d);
354 set_page_dirty(dentry_page);
355 f2fs_put_page(dentry_page, 1);
359 struct page *f2fs_init_inode_metadata(struct inode *inode, struct inode *dir,
360 const struct qstr *new_name, const struct qstr *orig_name,
364 int dummy_encrypt = DUMMY_ENCRYPTION_ENABLED(F2FS_I_SB(dir));
367 if (is_inode_flag_set(inode, FI_NEW_INODE)) {
368 page = f2fs_new_inode_page(inode);
372 if (S_ISDIR(inode->i_mode)) {
373 /* in order to handle error case */
375 err = make_empty_dir(inode, dir, page);
383 err = f2fs_init_acl(inode, dir, page, dpage);
387 err = f2fs_init_security(inode, dir, orig_name, page);
391 if ((f2fs_encrypted_inode(dir) || dummy_encrypt) &&
392 f2fs_may_encrypt(inode)) {
393 err = fscrypt_inherit_context(dir, inode, page, false);
398 page = f2fs_get_node_page(F2FS_I_SB(dir), inode->i_ino);
404 init_dent_inode(new_name, page);
405 if (f2fs_encrypted_inode(dir))
406 file_set_enc_name(inode);
410 * This file should be checkpointed during fsync.
411 * We lost i_pino from now on.
413 if (is_inode_flag_set(inode, FI_INC_LINK)) {
414 if (!S_ISDIR(inode->i_mode))
415 file_lost_pino(inode);
417 * If link the tmpfile to alias through linkat path,
418 * we should remove this inode from orphan list.
420 if (inode->i_nlink == 0)
421 f2fs_remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
422 f2fs_i_links_write(inode, true);
428 f2fs_update_inode(inode, page);
429 f2fs_put_page(page, 1);
433 void f2fs_update_parent_metadata(struct inode *dir, struct inode *inode,
434 unsigned int current_depth)
436 if (inode && is_inode_flag_set(inode, FI_NEW_INODE)) {
437 if (S_ISDIR(inode->i_mode))
438 f2fs_i_links_write(dir, true);
439 clear_inode_flag(inode, FI_NEW_INODE);
441 dir->i_mtime = dir->i_ctime = current_time(dir);
442 f2fs_mark_inode_dirty_sync(dir, false);
444 if (F2FS_I(dir)->i_current_depth != current_depth)
445 f2fs_i_depth_write(dir, current_depth);
447 if (inode && is_inode_flag_set(inode, FI_INC_LINK))
448 clear_inode_flag(inode, FI_INC_LINK);
451 int f2fs_room_for_filename(const void *bitmap, int slots, int max_slots)
454 int zero_start, zero_end;
456 zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
457 if (zero_start >= max_slots)
460 zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
461 if (zero_end - zero_start >= slots)
464 bit_start = zero_end + 1;
466 if (zero_end + 1 >= max_slots)
471 void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
472 const struct qstr *name, f2fs_hash_t name_hash,
473 unsigned int bit_pos)
475 struct f2fs_dir_entry *de;
476 int slots = GET_DENTRY_SLOTS(name->len);
479 de = &d->dentry[bit_pos];
480 de->hash_code = name_hash;
481 de->name_len = cpu_to_le16(name->len);
482 memcpy(d->filename[bit_pos], name->name, name->len);
483 de->ino = cpu_to_le32(ino);
484 set_de_type(de, mode);
485 for (i = 0; i < slots; i++) {
486 __set_bit_le(bit_pos + i, (void *)d->bitmap);
487 /* avoid wrong garbage data for readdir */
489 (de + i)->name_len = 0;
493 int f2fs_add_regular_entry(struct inode *dir, const struct qstr *new_name,
494 const struct qstr *orig_name,
495 struct inode *inode, nid_t ino, umode_t mode)
497 unsigned int bit_pos;
499 unsigned int current_depth;
500 unsigned long bidx, block;
501 f2fs_hash_t dentry_hash;
502 unsigned int nbucket, nblock;
503 struct page *dentry_page = NULL;
504 struct f2fs_dentry_block *dentry_blk = NULL;
505 struct f2fs_dentry_ptr d;
506 struct page *page = NULL;
510 slots = GET_DENTRY_SLOTS(new_name->len);
511 dentry_hash = f2fs_dentry_hash(new_name, NULL);
513 current_depth = F2FS_I(dir)->i_current_depth;
514 if (F2FS_I(dir)->chash == dentry_hash) {
515 level = F2FS_I(dir)->clevel;
516 F2FS_I(dir)->chash = 0;
520 if (time_to_inject(F2FS_I_SB(dir), FAULT_DIR_DEPTH)) {
521 f2fs_show_injection_info(FAULT_DIR_DEPTH);
525 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
528 /* Increase the depth, if required */
529 if (level == current_depth)
532 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
533 nblock = bucket_blocks(level);
535 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
536 (le32_to_cpu(dentry_hash) % nbucket));
538 for (block = bidx; block <= (bidx + nblock - 1); block++) {
539 dentry_page = f2fs_get_new_data_page(dir, NULL, block, true);
540 if (IS_ERR(dentry_page))
541 return PTR_ERR(dentry_page);
543 dentry_blk = page_address(dentry_page);
544 bit_pos = f2fs_room_for_filename(&dentry_blk->dentry_bitmap,
545 slots, NR_DENTRY_IN_BLOCK);
546 if (bit_pos < NR_DENTRY_IN_BLOCK)
549 f2fs_put_page(dentry_page, 1);
552 /* Move to next level to find the empty slot for new dentry */
556 f2fs_wait_on_page_writeback(dentry_page, DATA, true);
559 down_write(&F2FS_I(inode)->i_sem);
560 page = f2fs_init_inode_metadata(inode, dir, new_name,
568 make_dentry_ptr_block(NULL, &d, dentry_blk);
569 f2fs_update_dentry(ino, mode, &d, new_name, dentry_hash, bit_pos);
571 set_page_dirty(dentry_page);
574 f2fs_i_pino_write(inode, dir->i_ino);
575 f2fs_put_page(page, 1);
578 f2fs_update_parent_metadata(dir, inode, current_depth);
581 up_write(&F2FS_I(inode)->i_sem);
583 f2fs_put_page(dentry_page, 1);
588 int f2fs_add_dentry(struct inode *dir, struct fscrypt_name *fname,
589 struct inode *inode, nid_t ino, umode_t mode)
591 struct qstr new_name;
594 new_name.name = fname_name(fname);
595 new_name.len = fname_len(fname);
597 if (f2fs_has_inline_dentry(dir))
598 err = f2fs_add_inline_entry(dir, &new_name, fname->usr_fname,
601 err = f2fs_add_regular_entry(dir, &new_name, fname->usr_fname,
604 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
609 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
612 int f2fs_do_add_link(struct inode *dir, const struct qstr *name,
613 struct inode *inode, nid_t ino, umode_t mode)
615 struct fscrypt_name fname;
616 struct page *page = NULL;
617 struct f2fs_dir_entry *de = NULL;
620 err = fscrypt_setup_filename(dir, name, 0, &fname);
625 * An immature stakable filesystem shows a race condition between lookup
626 * and create. If we have same task when doing lookup and create, it's
627 * definitely fine as expected by VFS normally. Otherwise, let's just
628 * verify on-disk dentry one more time, which guarantees filesystem
631 if (current != F2FS_I(dir)->task) {
632 de = __f2fs_find_entry(dir, &fname, &page);
633 F2FS_I(dir)->task = NULL;
636 f2fs_put_page(page, 0);
638 } else if (IS_ERR(page)) {
641 err = f2fs_add_dentry(dir, &fname, inode, ino, mode);
643 fscrypt_free_filename(&fname);
647 int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
652 down_write(&F2FS_I(inode)->i_sem);
653 page = f2fs_init_inode_metadata(inode, dir, NULL, NULL, NULL);
658 f2fs_put_page(page, 1);
660 clear_inode_flag(inode, FI_NEW_INODE);
662 up_write(&F2FS_I(inode)->i_sem);
663 f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
667 void f2fs_drop_nlink(struct inode *dir, struct inode *inode)
669 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
671 down_write(&F2FS_I(inode)->i_sem);
673 if (S_ISDIR(inode->i_mode))
674 f2fs_i_links_write(dir, false);
675 inode->i_ctime = current_time(inode);
677 f2fs_i_links_write(inode, false);
678 if (S_ISDIR(inode->i_mode)) {
679 f2fs_i_links_write(inode, false);
680 f2fs_i_size_write(inode, 0);
682 up_write(&F2FS_I(inode)->i_sem);
684 if (inode->i_nlink == 0)
685 f2fs_add_orphan_inode(inode);
687 f2fs_release_orphan_inode(sbi);
691 * It only removes the dentry from the dentry page, corresponding name
692 * entry in name page does not need to be touched during deletion.
694 void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
695 struct inode *dir, struct inode *inode)
697 struct f2fs_dentry_block *dentry_blk;
698 unsigned int bit_pos;
699 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
702 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
704 if (F2FS_OPTION(F2FS_I_SB(dir)).fsync_mode == FSYNC_MODE_STRICT)
705 f2fs_add_ino_entry(F2FS_I_SB(dir), dir->i_ino, TRANS_DIR_INO);
707 if (f2fs_has_inline_dentry(dir))
708 return f2fs_delete_inline_entry(dentry, page, dir, inode);
711 f2fs_wait_on_page_writeback(page, DATA, true);
713 dentry_blk = page_address(page);
714 bit_pos = dentry - dentry_blk->dentry;
715 for (i = 0; i < slots; i++)
716 __clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
718 /* Let's check and deallocate this dentry page */
719 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
722 set_page_dirty(page);
724 dir->i_ctime = dir->i_mtime = current_time(dir);
725 f2fs_mark_inode_dirty_sync(dir, false);
728 f2fs_drop_nlink(dir, inode);
730 if (bit_pos == NR_DENTRY_IN_BLOCK &&
731 !f2fs_truncate_hole(dir, page->index, page->index + 1)) {
732 f2fs_clear_radix_tree_dirty_tag(page);
733 clear_page_dirty_for_io(page);
734 ClearPagePrivate(page);
735 ClearPageUptodate(page);
736 inode_dec_dirty_pages(dir);
737 f2fs_remove_dirty_inode(dir);
739 f2fs_put_page(page, 1);
742 bool f2fs_empty_dir(struct inode *dir)
745 struct page *dentry_page;
746 unsigned int bit_pos;
747 struct f2fs_dentry_block *dentry_blk;
748 unsigned long nblock = dir_blocks(dir);
750 if (f2fs_has_inline_dentry(dir))
751 return f2fs_empty_inline_dir(dir);
753 for (bidx = 0; bidx < nblock; bidx++) {
754 dentry_page = f2fs_get_lock_data_page(dir, bidx, false);
755 if (IS_ERR(dentry_page)) {
756 if (PTR_ERR(dentry_page) == -ENOENT)
762 dentry_blk = page_address(dentry_page);
767 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
771 f2fs_put_page(dentry_page, 1);
773 if (bit_pos < NR_DENTRY_IN_BLOCK)
779 int f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
780 unsigned int start_pos, struct fscrypt_str *fstr)
782 unsigned char d_type = DT_UNKNOWN;
783 unsigned int bit_pos;
784 struct f2fs_dir_entry *de = NULL;
785 struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
786 struct f2fs_sb_info *sbi = F2FS_I_SB(d->inode);
788 bit_pos = ((unsigned long)ctx->pos % d->max);
790 while (bit_pos < d->max) {
791 bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
792 if (bit_pos >= d->max)
795 de = &d->dentry[bit_pos];
796 if (de->name_len == 0) {
798 ctx->pos = start_pos + bit_pos;
802 d_type = f2fs_get_de_type(de);
804 de_name.name = d->filename[bit_pos];
805 de_name.len = le16_to_cpu(de->name_len);
807 if (f2fs_encrypted_inode(d->inode)) {
808 int save_len = fstr->len;
811 err = fscrypt_fname_disk_to_usr(d->inode,
812 (u32)de->hash_code, 0,
818 fstr->len = save_len;
821 if (!dir_emit(ctx, de_name.name, de_name.len,
822 le32_to_cpu(de->ino), d_type))
825 if (sbi->readdir_ra == 1)
826 f2fs_ra_node_page(sbi, le32_to_cpu(de->ino));
828 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
829 ctx->pos = start_pos + bit_pos;
834 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
836 struct inode *inode = file_inode(file);
837 unsigned long npages = dir_blocks(inode);
838 struct f2fs_dentry_block *dentry_blk = NULL;
839 struct page *dentry_page = NULL;
840 struct file_ra_state *ra = &file->f_ra;
841 loff_t start_pos = ctx->pos;
842 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
843 struct f2fs_dentry_ptr d;
844 struct fscrypt_str fstr = FSTR_INIT(NULL, 0);
847 if (f2fs_encrypted_inode(inode)) {
848 err = fscrypt_get_encryption_info(inode);
849 if (err && err != -ENOKEY)
852 err = fscrypt_fname_alloc_buffer(inode, F2FS_NAME_LEN, &fstr);
857 if (f2fs_has_inline_dentry(inode)) {
858 err = f2fs_read_inline_dir(file, ctx, &fstr);
862 for (; n < npages; n++, ctx->pos = n * NR_DENTRY_IN_BLOCK) {
864 /* allow readdir() to be interrupted */
865 if (fatal_signal_pending(current)) {
871 /* readahead for multi pages of dir */
872 if (npages - n > 1 && !ra_has_index(ra, n))
873 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
874 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
876 dentry_page = f2fs_get_lock_data_page(inode, n, false);
877 if (IS_ERR(dentry_page)) {
878 err = PTR_ERR(dentry_page);
879 if (err == -ENOENT) {
887 dentry_blk = page_address(dentry_page);
889 make_dentry_ptr_block(inode, &d, dentry_blk);
891 err = f2fs_fill_dentries(ctx, &d,
892 n * NR_DENTRY_IN_BLOCK, &fstr);
894 f2fs_put_page(dentry_page, 1);
898 f2fs_put_page(dentry_page, 1);
901 fscrypt_fname_free_buffer(&fstr);
903 trace_f2fs_readdir(inode, start_pos, ctx->pos, err);
904 return err < 0 ? err : 0;
907 static int f2fs_dir_open(struct inode *inode, struct file *filp)
909 if (f2fs_encrypted_inode(inode))
910 return fscrypt_get_encryption_info(inode) ? -EACCES : 0;
914 const struct file_operations f2fs_dir_operations = {
915 .llseek = generic_file_llseek,
916 .read = generic_read_dir,
917 .iterate_shared = f2fs_readdir,
918 .fsync = f2fs_sync_file,
919 .open = f2fs_dir_open,
920 .unlocked_ioctl = f2fs_ioctl,
922 .compat_ioctl = f2fs_compat_ioctl,