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_CACHE_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 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,
52 static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = {
53 [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE,
54 [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR,
55 [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV,
56 [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV,
57 [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO,
58 [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK,
59 [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK,
62 void set_de_type(struct f2fs_dir_entry *de, umode_t mode)
64 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
67 static unsigned long dir_block_index(unsigned int level,
68 int dir_level, unsigned int idx)
71 unsigned long bidx = 0;
73 for (i = 0; i < level; i++)
74 bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
75 bidx += idx * bucket_blocks(level);
79 static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
80 struct f2fs_filename *fname,
83 struct page **res_page)
85 struct f2fs_dentry_block *dentry_blk;
86 struct f2fs_dir_entry *de;
87 struct f2fs_dentry_ptr d;
89 dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page);
91 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
92 de = find_target_dentry(fname, namehash, max_slots, &d);
94 *res_page = dentry_page;
99 * For the most part, it should be a bug when name_len is zero.
100 * We stop here for figuring out where the bugs has occurred.
102 f2fs_bug_on(F2FS_P_SB(dentry_page), d.max < 0);
106 struct f2fs_dir_entry *find_target_dentry(struct f2fs_filename *fname,
107 f2fs_hash_t namehash, int *max_slots,
108 struct f2fs_dentry_ptr *d)
110 struct f2fs_dir_entry *de;
111 unsigned long bit_pos = 0;
113 struct f2fs_str de_name = FSTR_INIT(NULL, 0);
114 struct f2fs_str *name = &fname->disk_name;
118 while (bit_pos < d->max) {
119 if (!test_bit_le(bit_pos, d->bitmap)) {
125 de = &d->dentry[bit_pos];
128 de_name.name = d->filename[bit_pos];
129 de_name.len = le16_to_cpu(de->name_len);
131 /* show encrypted name */
133 if (de->hash_code == fname->hash)
135 } else if (de_name.len == name->len &&
136 de->hash_code == namehash &&
137 !memcmp(de_name.name, name->name, name->len))
140 if (max_slots && max_len > *max_slots)
141 *max_slots = max_len;
144 /* remain bug on condition */
145 if (unlikely(!de->name_len))
148 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
153 if (max_slots && max_len > *max_slots)
154 *max_slots = max_len;
158 static struct f2fs_dir_entry *find_in_level(struct inode *dir,
160 struct f2fs_filename *fname,
161 struct page **res_page)
163 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
164 int s = GET_DENTRY_SLOTS(name.len);
165 unsigned int nbucket, nblock;
166 unsigned int bidx, end_block;
167 struct page *dentry_page;
168 struct f2fs_dir_entry *de = NULL;
171 f2fs_hash_t namehash;
173 namehash = f2fs_dentry_hash(&name);
175 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
176 nblock = bucket_blocks(level);
178 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
179 le32_to_cpu(namehash) % nbucket);
180 end_block = bidx + nblock;
182 for (; bidx < end_block; bidx++) {
183 /* no need to allocate new dentry pages to all the indices */
184 dentry_page = find_data_page(dir, bidx);
185 if (IS_ERR(dentry_page)) {
190 de = find_in_block(dentry_page, fname, namehash, &max_slots,
197 f2fs_put_page(dentry_page, 0);
200 if (!de && room && F2FS_I(dir)->chash != namehash) {
201 F2FS_I(dir)->chash = namehash;
202 F2FS_I(dir)->clevel = level;
209 * Find an entry in the specified directory with the wanted name.
210 * It returns the page where the entry was found (as a parameter - res_page),
211 * and the entry itself. Page is returned mapped and unlocked.
212 * Entry is guaranteed to be valid.
214 struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
215 struct qstr *child, struct page **res_page)
217 unsigned long npages = dir_blocks(dir);
218 struct f2fs_dir_entry *de = NULL;
219 unsigned int max_depth;
221 struct f2fs_filename fname;
226 err = f2fs_fname_setup_filename(dir, child, 1, &fname);
230 if (f2fs_has_inline_dentry(dir)) {
231 de = find_in_inline_dir(dir, &fname, res_page);
238 max_depth = F2FS_I(dir)->i_current_depth;
239 if (unlikely(max_depth > MAX_DIR_HASH_DEPTH)) {
240 f2fs_msg(F2FS_I_SB(dir)->sb, KERN_WARNING,
241 "Corrupted max_depth of %lu: %u",
242 dir->i_ino, max_depth);
243 max_depth = MAX_DIR_HASH_DEPTH;
244 F2FS_I(dir)->i_current_depth = max_depth;
245 mark_inode_dirty(dir);
248 for (level = 0; level < max_depth; level++) {
249 de = find_in_level(dir, level, &fname, res_page);
254 f2fs_fname_free_filename(&fname);
258 struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
261 struct f2fs_dir_entry *de;
262 struct f2fs_dentry_block *dentry_blk;
264 if (f2fs_has_inline_dentry(dir))
265 return f2fs_parent_inline_dir(dir, p);
267 page = get_lock_data_page(dir, 0, false);
271 dentry_blk = kmap(page);
272 de = &dentry_blk->dentry[1];
278 ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr)
281 struct f2fs_dir_entry *de;
284 de = f2fs_find_entry(dir, qstr, &page);
286 res = le32_to_cpu(de->ino);
287 f2fs_dentry_kunmap(dir, page);
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);
300 de->ino = cpu_to_le32(inode->i_ino);
301 set_de_type(de, inode->i_mode);
302 f2fs_dentry_kunmap(dir, page);
303 set_page_dirty(page);
304 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
305 mark_inode_dirty(dir);
307 f2fs_put_page(page, 1);
310 static void init_dent_inode(const struct qstr *name, struct page *ipage)
312 struct f2fs_inode *ri;
314 f2fs_wait_on_page_writeback(ipage, NODE);
316 /* copy name info. to this inode page */
317 ri = F2FS_INODE(ipage);
318 ri->i_namelen = cpu_to_le32(name->len);
319 memcpy(ri->i_name, name->name, name->len);
320 set_page_dirty(ipage);
323 int update_dent_inode(struct inode *inode, struct inode *to,
324 const struct qstr *name)
328 if (file_enc_name(to))
331 page = get_node_page(F2FS_I_SB(inode), inode->i_ino);
333 return PTR_ERR(page);
335 init_dent_inode(name, page);
336 f2fs_put_page(page, 1);
341 void do_make_empty_dir(struct inode *inode, struct inode *parent,
342 struct f2fs_dentry_ptr *d)
344 struct f2fs_dir_entry *de;
347 de->name_len = cpu_to_le16(1);
349 de->ino = cpu_to_le32(inode->i_ino);
350 memcpy(d->filename[0], ".", 1);
351 set_de_type(de, inode->i_mode);
355 de->name_len = cpu_to_le16(2);
356 de->ino = cpu_to_le32(parent->i_ino);
357 memcpy(d->filename[1], "..", 2);
358 set_de_type(de, parent->i_mode);
360 test_and_set_bit_le(0, (void *)d->bitmap);
361 test_and_set_bit_le(1, (void *)d->bitmap);
364 static int make_empty_dir(struct inode *inode,
365 struct inode *parent, struct page *page)
367 struct page *dentry_page;
368 struct f2fs_dentry_block *dentry_blk;
369 struct f2fs_dentry_ptr d;
371 if (f2fs_has_inline_dentry(inode))
372 return make_empty_inline_dir(inode, parent, page);
374 dentry_page = get_new_data_page(inode, page, 0, true);
375 if (IS_ERR(dentry_page))
376 return PTR_ERR(dentry_page);
378 dentry_blk = kmap_atomic(dentry_page);
380 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
381 do_make_empty_dir(inode, parent, &d);
383 kunmap_atomic(dentry_blk);
385 set_page_dirty(dentry_page);
386 f2fs_put_page(dentry_page, 1);
390 struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
391 const struct qstr *name, struct page *dpage)
396 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
397 page = new_inode_page(inode);
401 if (S_ISDIR(inode->i_mode)) {
402 err = make_empty_dir(inode, dir, page);
407 err = f2fs_init_acl(inode, dir, page, dpage);
411 err = f2fs_init_security(inode, dir, name, page);
415 if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) {
416 err = f2fs_inherit_context(dir, inode, page);
421 page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
425 set_cold_node(inode, page);
429 init_dent_inode(name, page);
432 * This file should be checkpointed during fsync.
433 * We lost i_pino from now on.
435 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
436 file_lost_pino(inode);
438 * If link the tmpfile to alias through linkat path,
439 * we should remove this inode from orphan list.
441 if (inode->i_nlink == 0)
442 remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
448 f2fs_put_page(page, 1);
450 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
451 truncate_inode_pages(&inode->i_data, 0);
452 truncate_blocks(inode, 0, false);
453 remove_dirty_inode(inode);
454 remove_inode_page(inode);
458 void update_parent_metadata(struct inode *dir, struct inode *inode,
459 unsigned int current_depth)
461 if (inode && is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
462 if (S_ISDIR(inode->i_mode)) {
464 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
466 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
468 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
469 mark_inode_dirty(dir);
471 if (F2FS_I(dir)->i_current_depth != current_depth) {
472 F2FS_I(dir)->i_current_depth = current_depth;
473 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
476 if (inode && is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
477 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
480 int room_for_filename(const void *bitmap, int slots, int max_slots)
483 int zero_start, zero_end;
485 zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
486 if (zero_start >= max_slots)
489 zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
490 if (zero_end - zero_start >= slots)
493 bit_start = zero_end + 1;
495 if (zero_end + 1 >= max_slots)
500 void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
501 const struct qstr *name, f2fs_hash_t name_hash,
502 unsigned int bit_pos)
504 struct f2fs_dir_entry *de;
505 int slots = GET_DENTRY_SLOTS(name->len);
508 de = &d->dentry[bit_pos];
509 de->hash_code = name_hash;
510 de->name_len = cpu_to_le16(name->len);
511 memcpy(d->filename[bit_pos], name->name, name->len);
512 de->ino = cpu_to_le32(ino);
513 set_de_type(de, mode);
514 for (i = 0; i < slots; i++)
515 test_and_set_bit_le(bit_pos + i, (void *)d->bitmap);
519 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
522 int __f2fs_add_link(struct inode *dir, const struct qstr *name,
523 struct inode *inode, nid_t ino, umode_t mode)
525 unsigned int bit_pos;
527 unsigned int current_depth;
528 unsigned long bidx, block;
529 f2fs_hash_t dentry_hash;
530 unsigned int nbucket, nblock;
531 struct page *dentry_page = NULL;
532 struct f2fs_dentry_block *dentry_blk = NULL;
533 struct f2fs_dentry_ptr d;
534 struct page *page = NULL;
535 struct f2fs_filename fname;
536 struct qstr new_name;
539 err = f2fs_fname_setup_filename(dir, name, 0, &fname);
543 new_name.name = fname_name(&fname);
544 new_name.len = fname_len(&fname);
546 if (f2fs_has_inline_dentry(dir)) {
547 err = f2fs_add_inline_entry(dir, &new_name, inode, ino, mode);
548 if (!err || err != -EAGAIN)
555 slots = GET_DENTRY_SLOTS(new_name.len);
556 dentry_hash = f2fs_dentry_hash(&new_name);
558 current_depth = F2FS_I(dir)->i_current_depth;
559 if (F2FS_I(dir)->chash == dentry_hash) {
560 level = F2FS_I(dir)->clevel;
561 F2FS_I(dir)->chash = 0;
565 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH)) {
570 /* Increase the depth, if required */
571 if (level == current_depth)
574 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
575 nblock = bucket_blocks(level);
577 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
578 (le32_to_cpu(dentry_hash) % nbucket));
580 for (block = bidx; block <= (bidx + nblock - 1); block++) {
581 dentry_page = get_new_data_page(dir, NULL, block, true);
582 if (IS_ERR(dentry_page)) {
583 err = PTR_ERR(dentry_page);
587 dentry_blk = kmap(dentry_page);
588 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
589 slots, NR_DENTRY_IN_BLOCK);
590 if (bit_pos < NR_DENTRY_IN_BLOCK)
594 f2fs_put_page(dentry_page, 1);
597 /* Move to next level to find the empty slot for new dentry */
601 f2fs_wait_on_page_writeback(dentry_page, DATA);
604 down_write(&F2FS_I(inode)->i_sem);
605 page = init_inode_metadata(inode, dir, &new_name, NULL);
610 if (f2fs_encrypted_inode(dir))
611 file_set_enc_name(inode);
614 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
615 f2fs_update_dentry(ino, mode, &d, &new_name, dentry_hash, bit_pos);
617 set_page_dirty(dentry_page);
620 /* we don't need to mark_inode_dirty now */
621 F2FS_I(inode)->i_pino = dir->i_ino;
622 update_inode(inode, page);
623 f2fs_put_page(page, 1);
626 update_parent_metadata(dir, inode, current_depth);
629 up_write(&F2FS_I(inode)->i_sem);
631 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
632 update_inode_page(dir);
633 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
636 f2fs_put_page(dentry_page, 1);
638 f2fs_fname_free_filename(&fname);
639 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
643 int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
648 down_write(&F2FS_I(inode)->i_sem);
649 page = init_inode_metadata(inode, dir, NULL, NULL);
654 /* we don't need to mark_inode_dirty now */
655 update_inode(inode, page);
656 f2fs_put_page(page, 1);
658 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
660 up_write(&F2FS_I(inode)->i_sem);
661 f2fs_update_time(F2FS_I_SB(inode), REQ_TIME);
665 void f2fs_drop_nlink(struct inode *dir, struct inode *inode, struct page *page)
667 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
669 down_write(&F2FS_I(inode)->i_sem);
671 if (S_ISDIR(inode->i_mode)) {
674 update_inode(dir, page);
676 update_inode_page(dir);
678 inode->i_ctime = CURRENT_TIME;
681 if (S_ISDIR(inode->i_mode)) {
683 i_size_write(inode, 0);
685 up_write(&F2FS_I(inode)->i_sem);
686 update_inode_page(inode);
688 if (inode->i_nlink == 0)
689 add_orphan_inode(sbi, inode->i_ino);
691 release_orphan_inode(sbi);
695 * It only removes the dentry from the dentry page, corresponding name
696 * entry in name page does not need to be touched during deletion.
698 void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
699 struct inode *dir, struct inode *inode)
701 struct f2fs_dentry_block *dentry_blk;
702 unsigned int bit_pos;
703 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
706 f2fs_update_time(F2FS_I_SB(dir), REQ_TIME);
708 if (f2fs_has_inline_dentry(dir))
709 return f2fs_delete_inline_entry(dentry, page, dir, inode);
712 f2fs_wait_on_page_writeback(page, DATA);
714 dentry_blk = page_address(page);
715 bit_pos = dentry - dentry_blk->dentry;
716 for (i = 0; i < slots; i++)
717 clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
719 /* Let's check and deallocate this dentry page */
720 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
723 kunmap(page); /* kunmap - pair of f2fs_find_entry */
724 set_page_dirty(page);
726 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
729 f2fs_drop_nlink(dir, inode, NULL);
731 if (bit_pos == NR_DENTRY_IN_BLOCK &&
732 !truncate_hole(dir, page->index, page->index + 1)) {
733 clear_page_dirty_for_io(page);
734 ClearPagePrivate(page);
735 ClearPageUptodate(page);
736 inode_dec_dirty_pages(dir);
738 f2fs_put_page(page, 1);
741 bool f2fs_empty_dir(struct inode *dir)
744 struct page *dentry_page;
745 unsigned int bit_pos;
746 struct f2fs_dentry_block *dentry_blk;
747 unsigned long nblock = dir_blocks(dir);
749 if (f2fs_has_inline_dentry(dir))
750 return f2fs_empty_inline_dir(dir);
752 for (bidx = 0; bidx < nblock; bidx++) {
753 dentry_page = get_lock_data_page(dir, bidx, false);
754 if (IS_ERR(dentry_page)) {
755 if (PTR_ERR(dentry_page) == -ENOENT)
761 dentry_blk = kmap_atomic(dentry_page);
766 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
769 kunmap_atomic(dentry_blk);
771 f2fs_put_page(dentry_page, 1);
773 if (bit_pos < NR_DENTRY_IN_BLOCK)
779 bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
780 unsigned int start_pos, struct f2fs_str *fstr)
782 unsigned char d_type = DT_UNKNOWN;
783 unsigned int bit_pos;
784 struct f2fs_dir_entry *de = NULL;
785 struct f2fs_str de_name = FSTR_INIT(NULL, 0);
787 bit_pos = ((unsigned long)ctx->pos % d->max);
789 while (bit_pos < d->max) {
790 bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
791 if (bit_pos >= d->max)
794 de = &d->dentry[bit_pos];
795 if (de->file_type < F2FS_FT_MAX)
796 d_type = f2fs_filetype_table[de->file_type];
800 de_name.name = d->filename[bit_pos];
801 de_name.len = le16_to_cpu(de->name_len);
803 if (f2fs_encrypted_inode(d->inode)) {
804 int save_len = fstr->len;
807 de_name.name = kmalloc(de_name.len, GFP_NOFS);
811 memcpy(de_name.name, d->filename[bit_pos], de_name.len);
813 ret = f2fs_fname_disk_to_usr(d->inode, &de->hash_code,
820 fstr->len = save_len;
823 if (!dir_emit(ctx, de_name.name, de_name.len,
824 le32_to_cpu(de->ino), d_type))
827 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
828 ctx->pos = start_pos + bit_pos;
833 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
835 struct inode *inode = file_inode(file);
836 unsigned long npages = dir_blocks(inode);
837 struct f2fs_dentry_block *dentry_blk = NULL;
838 struct page *dentry_page = NULL;
839 struct file_ra_state *ra = &file->f_ra;
840 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
841 struct f2fs_dentry_ptr d;
842 struct f2fs_str fstr = FSTR_INIT(NULL, 0);
845 if (f2fs_encrypted_inode(inode)) {
846 err = f2fs_get_encryption_info(inode);
850 err = f2fs_fname_crypto_alloc_buffer(inode, F2FS_NAME_LEN,
856 if (f2fs_has_inline_dentry(inode)) {
857 err = f2fs_read_inline_dir(file, ctx, &fstr);
861 /* readahead for multi pages of dir */
862 if (npages - n > 1 && !ra_has_index(ra, n))
863 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
864 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
866 for (; n < npages; n++) {
867 dentry_page = get_lock_data_page(inode, n, false);
868 if (IS_ERR(dentry_page)) {
869 err = PTR_ERR(dentry_page);
876 dentry_blk = kmap(dentry_page);
878 make_dentry_ptr(inode, &d, (void *)dentry_blk, 1);
880 if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK, &fstr)) {
882 f2fs_put_page(dentry_page, 1);
886 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
888 f2fs_put_page(dentry_page, 1);
891 f2fs_fname_crypto_free_buffer(&fstr);
895 const struct file_operations f2fs_dir_operations = {
896 .llseek = generic_file_llseek,
897 .read = generic_read_dir,
898 .iterate = f2fs_readdir,
899 .fsync = f2fs_sync_file,
900 .unlocked_ioctl = f2fs_ioctl,
902 .compat_ioctl = f2fs_compat_ioctl,