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>
18 static unsigned long dir_blocks(struct inode *inode)
20 return ((unsigned long long) (i_size_read(inode) + PAGE_SIZE - 1))
24 static unsigned int dir_buckets(unsigned int level, int dir_level)
26 if (level + dir_level < MAX_DIR_HASH_DEPTH / 2)
27 return 1 << (level + dir_level);
29 return MAX_DIR_BUCKETS;
32 static unsigned int bucket_blocks(unsigned int level)
34 if (level < MAX_DIR_HASH_DEPTH / 2)
40 static unsigned char f2fs_filetype_table[F2FS_FT_MAX] = {
41 [F2FS_FT_UNKNOWN] = DT_UNKNOWN,
42 [F2FS_FT_REG_FILE] = DT_REG,
43 [F2FS_FT_DIR] = DT_DIR,
44 [F2FS_FT_CHRDEV] = DT_CHR,
45 [F2FS_FT_BLKDEV] = DT_BLK,
46 [F2FS_FT_FIFO] = DT_FIFO,
47 [F2FS_FT_SOCK] = DT_SOCK,
48 [F2FS_FT_SYMLINK] = DT_LNK,
51 static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = {
52 [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE,
53 [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR,
54 [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV,
55 [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV,
56 [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO,
57 [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK,
58 [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK,
61 void set_de_type(struct f2fs_dir_entry *de, umode_t mode)
63 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
66 unsigned char get_de_type(struct f2fs_dir_entry *de)
68 if (de->file_type < F2FS_FT_MAX)
69 return f2fs_filetype_table[de->file_type];
73 static unsigned long dir_block_index(unsigned int level,
74 int dir_level, unsigned int idx)
77 unsigned long bidx = 0;
79 for (i = 0; i < level; i++)
80 bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
81 bidx += idx * bucket_blocks(level);
85 static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
86 struct fscrypt_name *fname,
89 struct page **res_page)
91 struct f2fs_dentry_block *dentry_blk;
92 struct f2fs_dir_entry *de;
93 struct f2fs_dentry_ptr d;
95 dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page);
97 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
98 de = find_target_dentry(fname, namehash, max_slots, &d);
100 *res_page = dentry_page;
107 struct f2fs_dir_entry *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 = 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 /* This is to increase the speed of f2fs_create */
197 F2FS_I(dir)->task = current;
198 if (F2FS_I(dir)->chash != namehash) {
199 F2FS_I(dir)->chash = namehash;
200 F2FS_I(dir)->clevel = level;
207 struct f2fs_dir_entry *__f2fs_find_entry(struct inode *dir,
208 struct fscrypt_name *fname, struct page **res_page)
210 unsigned long npages = dir_blocks(dir);
211 struct f2fs_dir_entry *de = NULL;
212 unsigned int max_depth;
215 if (f2fs_has_inline_dentry(dir)) {
217 de = find_in_inline_dir(dir, fname, res_page);
226 max_depth = F2FS_I(dir)->i_current_depth;
227 if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
228 f2fs_msg(F2FS_I_SB(dir)->sb, KERN_WARNING,
229 "Corrupted max_depth of %lu: %u",
230 dir->i_ino, max_depth);
231 max_depth = MAX_DIR_HASH_DEPTH;
232 f2fs_i_depth_write(dir, max_depth);
235 for (level = 0; level < max_depth; level++) {
237 de = find_in_level(dir, level, fname, res_page);
238 if (de || IS_ERR(*res_page))
246 * Find an entry in the specified directory with the wanted name.
247 * It returns the page where the entry was found (as a parameter - res_page),
248 * and the entry itself. Page is returned mapped and unlocked.
249 * Entry is guaranteed to be valid.
251 struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
252 const struct qstr *child, struct page **res_page)
254 struct f2fs_dir_entry *de = NULL;
255 struct fscrypt_name fname;
258 err = fscrypt_setup_filename(dir, child, 1, &fname);
263 *res_page = ERR_PTR(err);
267 de = __f2fs_find_entry(dir, &fname, res_page);
269 fscrypt_free_filename(&fname);
273 struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
275 struct qstr dotdot = QSTR_INIT("..", 2);
277 return f2fs_find_entry(dir, &dotdot, p);
280 ino_t f2fs_inode_by_name(struct inode *dir, const struct qstr *qstr,
284 struct f2fs_dir_entry *de;
286 de = f2fs_find_entry(dir, qstr, page);
288 res = le32_to_cpu(de->ino);
289 f2fs_dentry_kunmap(dir, *page);
290 f2fs_put_page(*page, 0);
296 void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
297 struct page *page, struct inode *inode)
299 enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
301 f2fs_wait_on_page_writeback(page, type, true);
302 de->ino = cpu_to_le32(inode->i_ino);
303 set_de_type(de, inode->i_mode);
304 f2fs_dentry_kunmap(dir, page);
305 set_page_dirty(page);
307 dir->i_mtime = dir->i_ctime = current_time(dir);
308 f2fs_mark_inode_dirty_sync(dir, false);
309 f2fs_put_page(page, 1);
312 static void init_dent_inode(const struct qstr *name, struct page *ipage)
314 struct f2fs_inode *ri;
316 f2fs_wait_on_page_writeback(ipage, NODE, true);
318 /* copy name info. to this inode page */
319 ri = F2FS_INODE(ipage);
320 ri->i_namelen = cpu_to_le32(name->len);
321 memcpy(ri->i_name, name->name, name->len);
322 set_page_dirty(ipage);
325 int update_dent_inode(struct inode *inode, struct inode *to,
326 const struct qstr *name)
330 if (file_enc_name(to))
333 page = get_node_page(F2FS_I_SB(inode), inode->i_ino);
335 return PTR_ERR(page);
337 init_dent_inode(name, page);
338 f2fs_put_page(page, 1);
343 void do_make_empty_dir(struct inode *inode, struct inode *parent,
344 struct f2fs_dentry_ptr *d)
346 struct qstr dot = QSTR_INIT(".", 1);
347 struct qstr dotdot = QSTR_INIT("..", 2);
349 /* update dirent of "." */
350 f2fs_update_dentry(inode->i_ino, inode->i_mode, d, &dot, 0, 0);
352 /* update dirent of ".." */
353 f2fs_update_dentry(parent->i_ino, parent->i_mode, d, &dotdot, 0, 1);
356 static int make_empty_dir(struct inode *inode,
357 struct inode *parent, struct page *page)
359 struct page *dentry_page;
360 struct f2fs_dentry_block *dentry_blk;
361 struct f2fs_dentry_ptr d;
363 if (f2fs_has_inline_dentry(inode))
364 return make_empty_inline_dir(inode, parent, page);
366 dentry_page = get_new_data_page(inode, page, 0, true);
367 if (IS_ERR(dentry_page))
368 return PTR_ERR(dentry_page);
370 dentry_blk = kmap_atomic(dentry_page);
372 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
373 do_make_empty_dir(inode, parent, &d);
375 kunmap_atomic(dentry_blk);
377 set_page_dirty(dentry_page);
378 f2fs_put_page(dentry_page, 1);
382 struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
383 const struct qstr *new_name, const struct qstr *orig_name,
389 if (is_inode_flag_set(inode, FI_NEW_INODE)) {
390 page = new_inode_page(inode);
394 if (S_ISDIR(inode->i_mode)) {
395 /* in order to handle error case */
397 err = make_empty_dir(inode, dir, page);
405 err = f2fs_init_acl(inode, dir, page, dpage);
409 err = f2fs_init_security(inode, dir, orig_name, page);
413 if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) {
414 err = fscrypt_inherit_context(dir, inode, page, false);
419 page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
423 set_cold_node(inode, page);
427 init_dent_inode(new_name, page);
430 * This file should be checkpointed during fsync.
431 * We lost i_pino from now on.
433 if (is_inode_flag_set(inode, FI_INC_LINK)) {
434 file_lost_pino(inode);
436 * If link the tmpfile to alias through linkat path,
437 * we should remove this inode from orphan list.
439 if (inode->i_nlink == 0)
440 remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
441 f2fs_i_links_write(inode, true);
447 update_inode(inode, page);
448 f2fs_put_page(page, 1);
452 void update_parent_metadata(struct inode *dir, struct inode *inode,
453 unsigned int current_depth)
455 if (inode && is_inode_flag_set(inode, FI_NEW_INODE)) {
456 if (S_ISDIR(inode->i_mode))
457 f2fs_i_links_write(dir, true);
458 clear_inode_flag(inode, FI_NEW_INODE);
460 dir->i_mtime = dir->i_ctime = current_time(dir);
461 f2fs_mark_inode_dirty_sync(dir, false);
463 if (F2FS_I(dir)->i_current_depth != current_depth)
464 f2fs_i_depth_write(dir, current_depth);
466 if (inode && is_inode_flag_set(inode, FI_INC_LINK))
467 clear_inode_flag(inode, FI_INC_LINK);
470 int room_for_filename(const void *bitmap, int slots, int max_slots)
473 int zero_start, zero_end;
475 zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
476 if (zero_start >= max_slots)
479 zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
480 if (zero_end - zero_start >= slots)
483 bit_start = zero_end + 1;
485 if (zero_end + 1 >= max_slots)
490 void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
491 const struct qstr *name, f2fs_hash_t name_hash,
492 unsigned int bit_pos)
494 struct f2fs_dir_entry *de;
495 int slots = GET_DENTRY_SLOTS(name->len);
498 de = &d->dentry[bit_pos];
499 de->hash_code = name_hash;
500 de->name_len = cpu_to_le16(name->len);
501 memcpy(d->filename[bit_pos], name->name, name->len);
502 de->ino = cpu_to_le32(ino);
503 set_de_type(de, mode);
504 for (i = 0; i < slots; i++) {
505 __set_bit_le(bit_pos + i, (void *)d->bitmap);
506 /* avoid wrong garbage data for readdir */
508 (de + i)->name_len = 0;
512 int f2fs_add_regular_entry(struct inode *dir, const struct qstr *new_name,
513 const struct qstr *orig_name,
514 struct inode *inode, nid_t ino, umode_t mode)
516 unsigned int bit_pos;
518 unsigned int current_depth;
519 unsigned long bidx, block;
520 f2fs_hash_t dentry_hash;
521 unsigned int nbucket, nblock;
522 struct page *dentry_page = NULL;
523 struct f2fs_dentry_block *dentry_blk = NULL;
524 struct f2fs_dentry_ptr d;
525 struct page *page = NULL;
529 slots = GET_DENTRY_SLOTS(new_name->len);
530 dentry_hash = f2fs_dentry_hash(new_name, NULL);
532 current_depth = F2FS_I(dir)->i_current_depth;
533 if (F2FS_I(dir)->chash == dentry_hash) {
534 level = F2FS_I(dir)->clevel;
535 F2FS_I(dir)->chash = 0;
539 #ifdef CONFIG_F2FS_FAULT_INJECTION
540 if (time_to_inject(F2FS_I_SB(dir), FAULT_DIR_DEPTH)) {
541 f2fs_show_injection_info(FAULT_DIR_DEPTH);
545 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
548 /* Increase the depth, if required */
549 if (level == current_depth)
552 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
553 nblock = bucket_blocks(level);
555 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
556 (le32_to_cpu(dentry_hash) % nbucket));
558 for (block = bidx; block <= (bidx + nblock - 1); block++) {
559 dentry_page = get_new_data_page(dir, NULL, block, true);
560 if (IS_ERR(dentry_page))
561 return PTR_ERR(dentry_page);
563 dentry_blk = kmap(dentry_page);
564 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
565 slots, NR_DENTRY_IN_BLOCK);
566 if (bit_pos < NR_DENTRY_IN_BLOCK)
570 f2fs_put_page(dentry_page, 1);
573 /* Move to next level to find the empty slot for new dentry */
577 f2fs_wait_on_page_writeback(dentry_page, DATA, true);
580 down_write(&F2FS_I(inode)->i_sem);
581 page = init_inode_metadata(inode, dir, new_name,
587 if (f2fs_encrypted_inode(dir))
588 file_set_enc_name(inode);
591 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
592 f2fs_update_dentry(ino, mode, &d, new_name, dentry_hash, bit_pos);
594 set_page_dirty(dentry_page);
597 f2fs_i_pino_write(inode, dir->i_ino);
598 f2fs_put_page(page, 1);
601 update_parent_metadata(dir, inode, current_depth);
604 up_write(&F2FS_I(inode)->i_sem);
607 f2fs_put_page(dentry_page, 1);
612 int __f2fs_do_add_link(struct inode *dir, struct fscrypt_name *fname,
613 struct inode *inode, nid_t ino, umode_t mode)
615 struct qstr new_name;
618 new_name.name = fname_name(fname);
619 new_name.len = fname_len(fname);
621 if (f2fs_has_inline_dentry(dir))
622 err = f2fs_add_inline_entry(dir, &new_name, fname->usr_fname,
625 err = f2fs_add_regular_entry(dir, &new_name, fname->usr_fname,
628 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
633 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
636 int __f2fs_add_link(struct inode *dir, const struct qstr *name,
637 struct inode *inode, nid_t ino, umode_t mode)
639 struct fscrypt_name fname;
640 struct page *page = NULL;
641 struct f2fs_dir_entry *de = NULL;
644 err = fscrypt_setup_filename(dir, name, 0, &fname);
649 * An immature stakable filesystem shows a race condition between lookup
650 * and create. If we have same task when doing lookup and create, it's
651 * definitely fine as expected by VFS normally. Otherwise, let's just
652 * verify on-disk dentry one more time, which guarantees filesystem
655 if (current != F2FS_I(dir)->task) {
656 de = __f2fs_find_entry(dir, &fname, &page);
657 F2FS_I(dir)->task = NULL;
660 f2fs_dentry_kunmap(dir, page);
661 f2fs_put_page(page, 0);
663 } else if (IS_ERR(page)) {
666 err = __f2fs_do_add_link(dir, &fname, inode, ino, mode);
668 fscrypt_free_filename(&fname);
672 int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
677 down_write(&F2FS_I(inode)->i_sem);
678 page = init_inode_metadata(inode, dir, NULL, NULL, NULL);
683 f2fs_put_page(page, 1);
685 clear_inode_flag(inode, FI_NEW_INODE);
687 up_write(&F2FS_I(inode)->i_sem);
688 f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
692 void f2fs_drop_nlink(struct inode *dir, struct inode *inode)
694 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
696 down_write(&F2FS_I(inode)->i_sem);
698 if (S_ISDIR(inode->i_mode))
699 f2fs_i_links_write(dir, false);
700 inode->i_ctime = current_time(inode);
702 f2fs_i_links_write(inode, false);
703 if (S_ISDIR(inode->i_mode)) {
704 f2fs_i_links_write(inode, false);
705 f2fs_i_size_write(inode, 0);
707 up_write(&F2FS_I(inode)->i_sem);
709 if (inode->i_nlink == 0)
710 add_orphan_inode(inode);
712 release_orphan_inode(sbi);
716 * It only removes the dentry from the dentry page, corresponding name
717 * entry in name page does not need to be touched during deletion.
719 void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
720 struct inode *dir, struct inode *inode)
722 struct f2fs_dentry_block *dentry_blk;
723 unsigned int bit_pos;
724 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
727 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
729 if (f2fs_has_inline_dentry(dir))
730 return f2fs_delete_inline_entry(dentry, page, dir, inode);
733 f2fs_wait_on_page_writeback(page, DATA, true);
735 dentry_blk = page_address(page);
736 bit_pos = dentry - dentry_blk->dentry;
737 for (i = 0; i < slots; i++)
738 __clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
740 /* Let's check and deallocate this dentry page */
741 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
744 kunmap(page); /* kunmap - pair of f2fs_find_entry */
745 set_page_dirty(page);
747 dir->i_ctime = dir->i_mtime = current_time(dir);
748 f2fs_mark_inode_dirty_sync(dir, false);
751 f2fs_drop_nlink(dir, inode);
753 if (bit_pos == NR_DENTRY_IN_BLOCK &&
754 !truncate_hole(dir, page->index, page->index + 1)) {
755 clear_page_dirty_for_io(page);
756 ClearPagePrivate(page);
757 ClearPageUptodate(page);
758 inode_dec_dirty_pages(dir);
759 remove_dirty_inode(dir);
761 f2fs_put_page(page, 1);
764 bool f2fs_empty_dir(struct inode *dir)
767 struct page *dentry_page;
768 unsigned int bit_pos;
769 struct f2fs_dentry_block *dentry_blk;
770 unsigned long nblock = dir_blocks(dir);
772 if (f2fs_has_inline_dentry(dir))
773 return f2fs_empty_inline_dir(dir);
775 for (bidx = 0; bidx < nblock; bidx++) {
776 dentry_page = get_lock_data_page(dir, bidx, false);
777 if (IS_ERR(dentry_page)) {
778 if (PTR_ERR(dentry_page) == -ENOENT)
784 dentry_blk = kmap_atomic(dentry_page);
789 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
792 kunmap_atomic(dentry_blk);
794 f2fs_put_page(dentry_page, 1);
796 if (bit_pos < NR_DENTRY_IN_BLOCK)
802 int f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
803 unsigned int start_pos, struct fscrypt_str *fstr)
805 unsigned char d_type = DT_UNKNOWN;
806 unsigned int bit_pos;
807 struct f2fs_dir_entry *de = NULL;
808 struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
810 bit_pos = ((unsigned long)ctx->pos % d->max);
812 while (bit_pos < d->max) {
813 bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
814 if (bit_pos >= d->max)
817 de = &d->dentry[bit_pos];
818 if (de->name_len == 0) {
820 ctx->pos = start_pos + bit_pos;
824 d_type = get_de_type(de);
826 de_name.name = d->filename[bit_pos];
827 de_name.len = le16_to_cpu(de->name_len);
829 if (f2fs_encrypted_inode(d->inode)) {
830 int save_len = fstr->len;
833 err = fscrypt_fname_disk_to_usr(d->inode,
834 (u32)de->hash_code, 0,
840 fstr->len = save_len;
843 if (!dir_emit(ctx, de_name.name, de_name.len,
844 le32_to_cpu(de->ino), d_type))
847 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
848 ctx->pos = start_pos + bit_pos;
853 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
855 struct inode *inode = file_inode(file);
856 unsigned long npages = dir_blocks(inode);
857 struct f2fs_dentry_block *dentry_blk = NULL;
858 struct page *dentry_page = NULL;
859 struct file_ra_state *ra = &file->f_ra;
860 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
861 struct f2fs_dentry_ptr d;
862 struct fscrypt_str fstr = FSTR_INIT(NULL, 0);
865 if (f2fs_encrypted_inode(inode)) {
866 err = fscrypt_get_encryption_info(inode);
867 if (err && err != -ENOKEY)
870 err = fscrypt_fname_alloc_buffer(inode, F2FS_NAME_LEN, &fstr);
875 if (f2fs_has_inline_dentry(inode)) {
876 err = f2fs_read_inline_dir(file, ctx, &fstr);
880 /* readahead for multi pages of dir */
881 if (npages - n > 1 && !ra_has_index(ra, n))
882 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
883 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
885 for (; n < npages; n++) {
886 dentry_page = get_lock_data_page(inode, n, false);
887 if (IS_ERR(dentry_page)) {
888 err = PTR_ERR(dentry_page);
889 if (err == -ENOENT) {
897 dentry_blk = kmap(dentry_page);
899 make_dentry_ptr(inode, &d, (void *)dentry_blk, 1);
901 err = f2fs_fill_dentries(ctx, &d,
902 n * NR_DENTRY_IN_BLOCK, &fstr);
905 f2fs_put_page(dentry_page, 1);
909 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
911 f2fs_put_page(dentry_page, 1);
914 fscrypt_fname_free_buffer(&fstr);
915 return err < 0 ? err : 0;
918 static int f2fs_dir_open(struct inode *inode, struct file *filp)
920 if (f2fs_encrypted_inode(inode))
921 return fscrypt_get_encryption_info(inode) ? -EACCES : 0;
925 const struct file_operations f2fs_dir_operations = {
926 .llseek = generic_file_llseek,
927 .read = generic_read_dir,
928 .iterate_shared = f2fs_readdir,
929 .fsync = f2fs_sync_file,
930 .open = f2fs_dir_open,
931 .unlocked_ioctl = f2fs_ioctl,
933 .compat_ioctl = f2fs_compat_ioctl,