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_block(NULL, &d, dentry_blk);
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;
114 struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
115 struct fscrypt_str *name = &fname->disk_name;
119 while (bit_pos < d->max) {
120 if (!test_bit_le(bit_pos, d->bitmap)) {
126 de = &d->dentry[bit_pos];
128 if (unlikely(!de->name_len)) {
134 de_name.name = d->filename[bit_pos];
135 de_name.len = le16_to_cpu(de->name_len);
137 /* show encrypted name */
139 if (de->hash_code == cpu_to_le32(fname->hash))
141 } else if (de_name.len == name->len &&
142 de->hash_code == namehash &&
143 !memcmp(de_name.name, name->name, name->len))
146 if (max_slots && max_len > *max_slots)
147 *max_slots = max_len;
150 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
155 if (max_slots && max_len > *max_slots)
156 *max_slots = max_len;
160 static struct f2fs_dir_entry *find_in_level(struct inode *dir,
162 struct fscrypt_name *fname,
163 struct page **res_page)
165 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
166 int s = GET_DENTRY_SLOTS(name.len);
167 unsigned int nbucket, nblock;
168 unsigned int bidx, end_block;
169 struct page *dentry_page;
170 struct f2fs_dir_entry *de = NULL;
173 f2fs_hash_t namehash;
176 namehash = cpu_to_le32(fname->hash);
178 namehash = f2fs_dentry_hash(&name);
180 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
181 nblock = bucket_blocks(level);
183 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
184 le32_to_cpu(namehash) % nbucket);
185 end_block = bidx + nblock;
187 for (; bidx < end_block; bidx++) {
188 /* no need to allocate new dentry pages to all the indices */
189 dentry_page = find_data_page(dir, bidx);
190 if (IS_ERR(dentry_page)) {
191 if (PTR_ERR(dentry_page) == -ENOENT) {
195 *res_page = dentry_page;
200 de = find_in_block(dentry_page, fname, namehash, &max_slots,
207 f2fs_put_page(dentry_page, 0);
210 if (!de && room && F2FS_I(dir)->chash != namehash) {
211 F2FS_I(dir)->chash = namehash;
212 F2FS_I(dir)->clevel = level;
218 struct f2fs_dir_entry *__f2fs_find_entry(struct inode *dir,
219 struct fscrypt_name *fname, struct page **res_page)
221 unsigned long npages = dir_blocks(dir);
222 struct f2fs_dir_entry *de = NULL;
223 unsigned int max_depth;
226 if (f2fs_has_inline_dentry(dir)) {
228 de = find_in_inline_dir(dir, fname, res_page);
237 max_depth = F2FS_I(dir)->i_current_depth;
238 if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
239 f2fs_msg(F2FS_I_SB(dir)->sb, KERN_WARNING,
240 "Corrupted max_depth of %lu: %u",
241 dir->i_ino, max_depth);
242 max_depth = MAX_DIR_HASH_DEPTH;
243 f2fs_i_depth_write(dir, max_depth);
246 for (level = 0; level < max_depth; level++) {
248 de = find_in_level(dir, level, fname, res_page);
249 if (de || IS_ERR(*res_page))
253 /* This is to increase the speed of f2fs_create */
255 F2FS_I(dir)->task = current;
260 * Find an entry in the specified directory with the wanted name.
261 * It returns the page where the entry was found (as a parameter - res_page),
262 * and the entry itself. Page is returned mapped and unlocked.
263 * Entry is guaranteed to be valid.
265 struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
266 const struct qstr *child, struct page **res_page)
268 struct f2fs_dir_entry *de = NULL;
269 struct fscrypt_name fname;
272 err = fscrypt_setup_filename(dir, child, 1, &fname);
277 *res_page = ERR_PTR(err);
281 de = __f2fs_find_entry(dir, &fname, res_page);
283 fscrypt_free_filename(&fname);
287 struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
289 struct qstr dotdot = QSTR_INIT("..", 2);
291 return f2fs_find_entry(dir, &dotdot, p);
294 ino_t f2fs_inode_by_name(struct inode *dir, const struct qstr *qstr,
298 struct f2fs_dir_entry *de;
300 de = f2fs_find_entry(dir, qstr, page);
302 res = le32_to_cpu(de->ino);
303 f2fs_dentry_kunmap(dir, *page);
304 f2fs_put_page(*page, 0);
310 void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
311 struct page *page, struct inode *inode)
313 enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
315 f2fs_wait_on_page_writeback(page, type, true);
316 de->ino = cpu_to_le32(inode->i_ino);
317 set_de_type(de, inode->i_mode);
318 f2fs_dentry_kunmap(dir, page);
319 set_page_dirty(page);
321 dir->i_mtime = dir->i_ctime = current_time(dir);
322 f2fs_mark_inode_dirty_sync(dir, false);
323 f2fs_put_page(page, 1);
326 static void init_dent_inode(const struct qstr *name, struct page *ipage)
328 struct f2fs_inode *ri;
330 f2fs_wait_on_page_writeback(ipage, NODE, true);
332 /* copy name info. to this inode page */
333 ri = F2FS_INODE(ipage);
334 ri->i_namelen = cpu_to_le32(name->len);
335 memcpy(ri->i_name, name->name, name->len);
336 set_page_dirty(ipage);
339 void do_make_empty_dir(struct inode *inode, struct inode *parent,
340 struct f2fs_dentry_ptr *d)
342 struct qstr dot = QSTR_INIT(".", 1);
343 struct qstr dotdot = QSTR_INIT("..", 2);
345 /* update dirent of "." */
346 f2fs_update_dentry(inode->i_ino, inode->i_mode, d, &dot, 0, 0);
348 /* update dirent of ".." */
349 f2fs_update_dentry(parent->i_ino, parent->i_mode, d, &dotdot, 0, 1);
352 static int make_empty_dir(struct inode *inode,
353 struct inode *parent, struct page *page)
355 struct page *dentry_page;
356 struct f2fs_dentry_block *dentry_blk;
357 struct f2fs_dentry_ptr d;
359 if (f2fs_has_inline_dentry(inode))
360 return make_empty_inline_dir(inode, parent, page);
362 dentry_page = get_new_data_page(inode, page, 0, true);
363 if (IS_ERR(dentry_page))
364 return PTR_ERR(dentry_page);
366 dentry_blk = kmap_atomic(dentry_page);
368 make_dentry_ptr_block(NULL, &d, dentry_blk);
369 do_make_empty_dir(inode, parent, &d);
371 kunmap_atomic(dentry_blk);
373 set_page_dirty(dentry_page);
374 f2fs_put_page(dentry_page, 1);
378 struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
379 const struct qstr *new_name, const struct qstr *orig_name,
385 if (is_inode_flag_set(inode, FI_NEW_INODE)) {
386 page = new_inode_page(inode);
390 if (S_ISDIR(inode->i_mode)) {
391 /* in order to handle error case */
393 err = make_empty_dir(inode, dir, page);
401 err = f2fs_init_acl(inode, dir, page, dpage);
405 err = f2fs_init_security(inode, dir, orig_name, page);
409 if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) {
410 err = fscrypt_inherit_context(dir, inode, page, false);
415 page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
419 set_cold_node(inode, page);
423 init_dent_inode(new_name, page);
424 if (f2fs_encrypted_inode(dir))
425 file_set_enc_name(inode);
429 * This file should be checkpointed during fsync.
430 * We lost i_pino from now on.
432 if (is_inode_flag_set(inode, FI_INC_LINK)) {
433 file_lost_pino(inode);
435 * If link the tmpfile to alias through linkat path,
436 * we should remove this inode from orphan list.
438 if (inode->i_nlink == 0)
439 remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
440 f2fs_i_links_write(inode, true);
446 update_inode(inode, page);
447 f2fs_put_page(page, 1);
451 void update_parent_metadata(struct inode *dir, struct inode *inode,
452 unsigned int current_depth)
454 if (inode && is_inode_flag_set(inode, FI_NEW_INODE)) {
455 if (S_ISDIR(inode->i_mode))
456 f2fs_i_links_write(dir, true);
457 clear_inode_flag(inode, FI_NEW_INODE);
459 dir->i_mtime = dir->i_ctime = current_time(dir);
460 f2fs_mark_inode_dirty_sync(dir, false);
462 if (F2FS_I(dir)->i_current_depth != current_depth)
463 f2fs_i_depth_write(dir, current_depth);
465 if (inode && is_inode_flag_set(inode, FI_INC_LINK))
466 clear_inode_flag(inode, FI_INC_LINK);
469 int room_for_filename(const void *bitmap, int slots, int max_slots)
472 int zero_start, zero_end;
474 zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
475 if (zero_start >= max_slots)
478 zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
479 if (zero_end - zero_start >= slots)
482 bit_start = zero_end + 1;
484 if (zero_end + 1 >= max_slots)
489 void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
490 const struct qstr *name, f2fs_hash_t name_hash,
491 unsigned int bit_pos)
493 struct f2fs_dir_entry *de;
494 int slots = GET_DENTRY_SLOTS(name->len);
497 de = &d->dentry[bit_pos];
498 de->hash_code = name_hash;
499 de->name_len = cpu_to_le16(name->len);
500 memcpy(d->filename[bit_pos], name->name, name->len);
501 de->ino = cpu_to_le32(ino);
502 set_de_type(de, mode);
503 for (i = 0; i < slots; i++) {
504 __set_bit_le(bit_pos + i, (void *)d->bitmap);
505 /* avoid wrong garbage data for readdir */
507 (de + i)->name_len = 0;
511 int f2fs_add_regular_entry(struct inode *dir, const struct qstr *new_name,
512 const struct qstr *orig_name,
513 struct inode *inode, nid_t ino, umode_t mode)
515 unsigned int bit_pos;
517 unsigned int current_depth;
518 unsigned long bidx, block;
519 f2fs_hash_t dentry_hash;
520 unsigned int nbucket, nblock;
521 struct page *dentry_page = NULL;
522 struct f2fs_dentry_block *dentry_blk = NULL;
523 struct f2fs_dentry_ptr d;
524 struct page *page = NULL;
528 slots = GET_DENTRY_SLOTS(new_name->len);
529 dentry_hash = f2fs_dentry_hash(new_name);
531 current_depth = F2FS_I(dir)->i_current_depth;
532 if (F2FS_I(dir)->chash == dentry_hash) {
533 level = F2FS_I(dir)->clevel;
534 F2FS_I(dir)->chash = 0;
538 #ifdef CONFIG_F2FS_FAULT_INJECTION
539 if (time_to_inject(F2FS_I_SB(dir), FAULT_DIR_DEPTH)) {
540 f2fs_show_injection_info(FAULT_DIR_DEPTH);
544 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
547 /* Increase the depth, if required */
548 if (level == current_depth)
551 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
552 nblock = bucket_blocks(level);
554 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
555 (le32_to_cpu(dentry_hash) % nbucket));
557 for (block = bidx; block <= (bidx + nblock - 1); block++) {
558 dentry_page = get_new_data_page(dir, NULL, block, true);
559 if (IS_ERR(dentry_page))
560 return PTR_ERR(dentry_page);
562 dentry_blk = kmap(dentry_page);
563 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
564 slots, NR_DENTRY_IN_BLOCK);
565 if (bit_pos < NR_DENTRY_IN_BLOCK)
569 f2fs_put_page(dentry_page, 1);
572 /* Move to next level to find the empty slot for new dentry */
576 f2fs_wait_on_page_writeback(dentry_page, DATA, true);
579 down_write(&F2FS_I(inode)->i_sem);
580 page = init_inode_metadata(inode, dir, new_name,
588 make_dentry_ptr_block(NULL, &d, dentry_blk);
589 f2fs_update_dentry(ino, mode, &d, new_name, dentry_hash, bit_pos);
591 set_page_dirty(dentry_page);
594 f2fs_i_pino_write(inode, dir->i_ino);
595 f2fs_put_page(page, 1);
598 update_parent_metadata(dir, inode, current_depth);
601 up_write(&F2FS_I(inode)->i_sem);
604 f2fs_put_page(dentry_page, 1);
609 int __f2fs_do_add_link(struct inode *dir, struct fscrypt_name *fname,
610 struct inode *inode, nid_t ino, umode_t mode)
612 struct qstr new_name;
615 new_name.name = fname_name(fname);
616 new_name.len = fname_len(fname);
618 if (f2fs_has_inline_dentry(dir))
619 err = f2fs_add_inline_entry(dir, &new_name, fname->usr_fname,
622 err = f2fs_add_regular_entry(dir, &new_name, fname->usr_fname,
625 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
630 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
633 int __f2fs_add_link(struct inode *dir, const struct qstr *name,
634 struct inode *inode, nid_t ino, umode_t mode)
636 struct fscrypt_name fname;
637 struct page *page = NULL;
638 struct f2fs_dir_entry *de = NULL;
641 err = fscrypt_setup_filename(dir, name, 0, &fname);
646 * An immature stakable filesystem shows a race condition between lookup
647 * and create. If we have same task when doing lookup and create, it's
648 * definitely fine as expected by VFS normally. Otherwise, let's just
649 * verify on-disk dentry one more time, which guarantees filesystem
652 if (current != F2FS_I(dir)->task) {
653 de = __f2fs_find_entry(dir, &fname, &page);
654 F2FS_I(dir)->task = NULL;
657 f2fs_dentry_kunmap(dir, page);
658 f2fs_put_page(page, 0);
660 } else if (IS_ERR(page)) {
663 err = __f2fs_do_add_link(dir, &fname, inode, ino, mode);
665 fscrypt_free_filename(&fname);
669 int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
674 down_write(&F2FS_I(inode)->i_sem);
675 page = init_inode_metadata(inode, dir, NULL, NULL, NULL);
680 f2fs_put_page(page, 1);
682 clear_inode_flag(inode, FI_NEW_INODE);
684 up_write(&F2FS_I(inode)->i_sem);
685 f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
689 void f2fs_drop_nlink(struct inode *dir, struct inode *inode)
691 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
693 down_write(&F2FS_I(inode)->i_sem);
695 if (S_ISDIR(inode->i_mode))
696 f2fs_i_links_write(dir, false);
697 inode->i_ctime = current_time(inode);
699 f2fs_i_links_write(inode, false);
700 if (S_ISDIR(inode->i_mode)) {
701 f2fs_i_links_write(inode, false);
702 f2fs_i_size_write(inode, 0);
704 up_write(&F2FS_I(inode)->i_sem);
706 if (inode->i_nlink == 0)
707 add_orphan_inode(inode);
709 release_orphan_inode(sbi);
713 * It only removes the dentry from the dentry page, corresponding name
714 * entry in name page does not need to be touched during deletion.
716 void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
717 struct inode *dir, struct inode *inode)
719 struct f2fs_dentry_block *dentry_blk;
720 unsigned int bit_pos;
721 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
724 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
726 if (f2fs_has_inline_dentry(dir))
727 return f2fs_delete_inline_entry(dentry, page, dir, inode);
730 f2fs_wait_on_page_writeback(page, DATA, true);
732 dentry_blk = page_address(page);
733 bit_pos = dentry - dentry_blk->dentry;
734 for (i = 0; i < slots; i++)
735 __clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
737 /* Let's check and deallocate this dentry page */
738 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
741 kunmap(page); /* kunmap - pair of f2fs_find_entry */
742 set_page_dirty(page);
744 dir->i_ctime = dir->i_mtime = current_time(dir);
745 f2fs_mark_inode_dirty_sync(dir, false);
748 f2fs_drop_nlink(dir, inode);
750 if (bit_pos == NR_DENTRY_IN_BLOCK &&
751 !truncate_hole(dir, page->index, page->index + 1)) {
752 clear_page_dirty_for_io(page);
753 ClearPagePrivate(page);
754 ClearPageUptodate(page);
755 inode_dec_dirty_pages(dir);
756 remove_dirty_inode(dir);
758 f2fs_put_page(page, 1);
761 bool f2fs_empty_dir(struct inode *dir)
764 struct page *dentry_page;
765 unsigned int bit_pos;
766 struct f2fs_dentry_block *dentry_blk;
767 unsigned long nblock = dir_blocks(dir);
769 if (f2fs_has_inline_dentry(dir))
770 return f2fs_empty_inline_dir(dir);
772 for (bidx = 0; bidx < nblock; bidx++) {
773 dentry_page = get_lock_data_page(dir, bidx, false);
774 if (IS_ERR(dentry_page)) {
775 if (PTR_ERR(dentry_page) == -ENOENT)
781 dentry_blk = kmap_atomic(dentry_page);
786 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
789 kunmap_atomic(dentry_blk);
791 f2fs_put_page(dentry_page, 1);
793 if (bit_pos < NR_DENTRY_IN_BLOCK)
799 int f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
800 unsigned int start_pos, struct fscrypt_str *fstr)
802 unsigned char d_type = DT_UNKNOWN;
803 unsigned int bit_pos;
804 struct f2fs_dir_entry *de = NULL;
805 struct fscrypt_str de_name = FSTR_INIT(NULL, 0);
807 bit_pos = ((unsigned long)ctx->pos % d->max);
809 while (bit_pos < d->max) {
810 bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
811 if (bit_pos >= d->max)
814 de = &d->dentry[bit_pos];
815 if (de->name_len == 0) {
817 ctx->pos = start_pos + bit_pos;
821 d_type = get_de_type(de);
823 de_name.name = d->filename[bit_pos];
824 de_name.len = le16_to_cpu(de->name_len);
826 if (f2fs_encrypted_inode(d->inode)) {
827 int save_len = fstr->len;
830 err = fscrypt_fname_disk_to_usr(d->inode,
831 (u32)de->hash_code, 0,
837 fstr->len = save_len;
840 if (!dir_emit(ctx, de_name.name, de_name.len,
841 le32_to_cpu(de->ino), d_type))
844 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
845 ctx->pos = start_pos + bit_pos;
850 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
852 struct inode *inode = file_inode(file);
853 unsigned long npages = dir_blocks(inode);
854 struct f2fs_dentry_block *dentry_blk = NULL;
855 struct page *dentry_page = NULL;
856 struct file_ra_state *ra = &file->f_ra;
857 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
858 struct f2fs_dentry_ptr d;
859 struct fscrypt_str fstr = FSTR_INIT(NULL, 0);
862 if (f2fs_encrypted_inode(inode)) {
863 err = fscrypt_get_encryption_info(inode);
864 if (err && err != -ENOKEY)
867 err = fscrypt_fname_alloc_buffer(inode, F2FS_NAME_LEN, &fstr);
872 if (f2fs_has_inline_dentry(inode)) {
873 err = f2fs_read_inline_dir(file, ctx, &fstr);
877 /* readahead for multi pages of dir */
878 if (npages - n > 1 && !ra_has_index(ra, n))
879 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
880 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
882 for (; n < npages; n++) {
883 dentry_page = get_lock_data_page(inode, n, false);
884 if (IS_ERR(dentry_page)) {
885 err = PTR_ERR(dentry_page);
886 if (err == -ENOENT) {
894 dentry_blk = kmap(dentry_page);
896 make_dentry_ptr_block(inode, &d, dentry_blk);
898 err = f2fs_fill_dentries(ctx, &d,
899 n * NR_DENTRY_IN_BLOCK, &fstr);
902 f2fs_put_page(dentry_page, 1);
906 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
908 f2fs_put_page(dentry_page, 1);
911 fscrypt_fname_free_buffer(&fstr);
912 return err < 0 ? err : 0;
915 static int f2fs_dir_open(struct inode *inode, struct file *filp)
917 if (f2fs_encrypted_inode(inode))
918 return fscrypt_get_encryption_info(inode) ? -EACCES : 0;
922 const struct file_operations f2fs_dir_operations = {
923 .llseek = generic_file_llseek,
924 .read = generic_read_dir,
925 .iterate_shared = f2fs_readdir,
926 .fsync = f2fs_sync_file,
927 .open = f2fs_dir_open,
928 .unlocked_ioctl = f2fs_ioctl,
930 .compat_ioctl = f2fs_compat_ioctl,