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
, struct inode
*inode
)
64 umode_t mode
= inode
->i_mode
;
65 de
->file_type
= f2fs_type_by_mode
[(mode
& S_IFMT
) >> S_SHIFT
];
68 static unsigned long dir_block_index(unsigned int level
,
69 int dir_level
, unsigned int idx
)
72 unsigned long bidx
= 0;
74 for (i
= 0; i
< level
; i
++)
75 bidx
+= dir_buckets(i
, dir_level
) * bucket_blocks(i
);
76 bidx
+= idx
* bucket_blocks(level
);
80 static bool early_match_name(size_t namelen
, f2fs_hash_t namehash
,
81 struct f2fs_dir_entry
*de
)
83 if (le16_to_cpu(de
->name_len
) != namelen
)
86 if (de
->hash_code
!= namehash
)
92 static struct f2fs_dir_entry
*find_in_block(struct page
*dentry_page
,
93 struct qstr
*name
, int *max_slots
,
94 struct page
**res_page
)
96 struct f2fs_dentry_block
*dentry_blk
;
97 struct f2fs_dir_entry
*de
;
98 struct f2fs_dentry_ptr d
;
100 dentry_blk
= (struct f2fs_dentry_block
*)kmap(dentry_page
);
102 make_dentry_ptr(&d
, (void *)dentry_blk
, 1);
103 de
= find_target_dentry(name
, max_slots
, &d
);
106 *res_page
= dentry_page
;
111 * For the most part, it should be a bug when name_len is zero.
112 * We stop here for figuring out where the bugs has occurred.
114 f2fs_bug_on(F2FS_P_SB(dentry_page
), d
.max
< 0);
118 struct f2fs_dir_entry
*find_target_dentry(struct qstr
*name
, int *max_slots
,
119 struct f2fs_dentry_ptr
*d
)
121 struct f2fs_dir_entry
*de
;
122 unsigned long bit_pos
= 0;
123 f2fs_hash_t namehash
= f2fs_dentry_hash(name
);
128 while (bit_pos
< d
->max
) {
129 if (!test_bit_le(bit_pos
, d
->bitmap
)) {
132 else if (!test_bit_le(bit_pos
- 1, d
->bitmap
))
137 de
= &d
->dentry
[bit_pos
];
138 if (early_match_name(name
->len
, namehash
, de
) &&
139 !memcmp(d
->filename
[bit_pos
], name
->name
, name
->len
))
142 if (max_slots
&& *max_slots
>= 0 && max_len
> *max_slots
) {
143 *max_slots
= max_len
;
147 /* remain bug on condition */
148 if (unlikely(!de
->name_len
))
151 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
156 if (max_slots
&& max_len
> *max_slots
)
157 *max_slots
= max_len
;
161 static struct f2fs_dir_entry
*find_in_level(struct inode
*dir
,
162 unsigned int level
, struct qstr
*name
,
163 f2fs_hash_t namehash
, struct page
**res_page
)
165 int s
= GET_DENTRY_SLOTS(name
->len
);
166 unsigned int nbucket
, nblock
;
167 unsigned int bidx
, end_block
;
168 struct page
*dentry_page
;
169 struct f2fs_dir_entry
*de
= NULL
;
173 f2fs_bug_on(F2FS_I_SB(dir
), level
> MAX_DIR_HASH_DEPTH
);
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
, true);
185 if (IS_ERR(dentry_page
)) {
190 de
= find_in_block(dentry_page
, name
, &max_slots
, res_page
);
196 f2fs_put_page(dentry_page
, 0);
199 if (!de
&& room
&& F2FS_I(dir
)->chash
!= namehash
) {
200 F2FS_I(dir
)->chash
= namehash
;
201 F2FS_I(dir
)->clevel
= level
;
208 * Find an entry in the specified directory with the wanted name.
209 * It returns the page where the entry was found (as a parameter - res_page),
210 * and the entry itself. Page is returned mapped and unlocked.
211 * Entry is guaranteed to be valid.
213 struct f2fs_dir_entry
*f2fs_find_entry(struct inode
*dir
,
214 struct qstr
*child
, struct page
**res_page
)
216 unsigned long npages
= dir_blocks(dir
);
217 struct f2fs_dir_entry
*de
= NULL
;
218 f2fs_hash_t name_hash
;
219 unsigned int max_depth
;
222 if (f2fs_has_inline_dentry(dir
))
223 return find_in_inline_dir(dir
, child
, res_page
);
230 name_hash
= f2fs_dentry_hash(child
);
231 max_depth
= F2FS_I(dir
)->i_current_depth
;
233 for (level
= 0; level
< max_depth
; level
++) {
234 de
= find_in_level(dir
, level
, child
, name_hash
, res_page
);
238 if (!de
&& F2FS_I(dir
)->chash
!= name_hash
) {
239 F2FS_I(dir
)->chash
= name_hash
;
240 F2FS_I(dir
)->clevel
= level
- 1;
245 struct f2fs_dir_entry
*f2fs_parent_dir(struct inode
*dir
, struct page
**p
)
248 struct f2fs_dir_entry
*de
;
249 struct f2fs_dentry_block
*dentry_blk
;
251 if (f2fs_has_inline_dentry(dir
))
252 return f2fs_parent_inline_dir(dir
, p
);
254 page
= get_lock_data_page(dir
, 0);
258 dentry_blk
= kmap(page
);
259 de
= &dentry_blk
->dentry
[1];
265 ino_t
f2fs_inode_by_name(struct inode
*dir
, struct qstr
*qstr
)
268 struct f2fs_dir_entry
*de
;
271 de
= f2fs_find_entry(dir
, qstr
, &page
);
273 res
= le32_to_cpu(de
->ino
);
274 f2fs_dentry_kunmap(dir
, page
);
275 f2fs_put_page(page
, 0);
281 void f2fs_set_link(struct inode
*dir
, struct f2fs_dir_entry
*de
,
282 struct page
*page
, struct inode
*inode
)
284 enum page_type type
= f2fs_has_inline_dentry(dir
) ? NODE
: DATA
;
286 f2fs_wait_on_page_writeback(page
, type
);
287 de
->ino
= cpu_to_le32(inode
->i_ino
);
288 set_de_type(de
, inode
);
289 if (!f2fs_has_inline_dentry(dir
))
291 set_page_dirty(page
);
292 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
293 mark_inode_dirty(dir
);
295 f2fs_put_page(page
, 1);
298 static void init_dent_inode(const struct qstr
*name
, struct page
*ipage
)
300 struct f2fs_inode
*ri
;
302 f2fs_wait_on_page_writeback(ipage
, NODE
);
304 /* copy name info. to this inode page */
305 ri
= F2FS_INODE(ipage
);
306 ri
->i_namelen
= cpu_to_le32(name
->len
);
307 memcpy(ri
->i_name
, name
->name
, name
->len
);
308 set_page_dirty(ipage
);
311 int update_dent_inode(struct inode
*inode
, const struct qstr
*name
)
315 page
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
317 return PTR_ERR(page
);
319 init_dent_inode(name
, page
);
320 f2fs_put_page(page
, 1);
325 void do_make_empty_dir(struct inode
*inode
, struct inode
*parent
,
326 struct f2fs_dentry_ptr
*d
)
328 struct f2fs_dir_entry
*de
;
331 de
->name_len
= cpu_to_le16(1);
333 de
->ino
= cpu_to_le32(inode
->i_ino
);
334 memcpy(d
->filename
[0], ".", 1);
335 set_de_type(de
, inode
);
339 de
->name_len
= cpu_to_le16(2);
340 de
->ino
= cpu_to_le32(parent
->i_ino
);
341 memcpy(d
->filename
[1], "..", 2);
342 set_de_type(de
, inode
);
344 test_and_set_bit_le(0, (void *)d
->bitmap
);
345 test_and_set_bit_le(1, (void *)d
->bitmap
);
348 static int make_empty_dir(struct inode
*inode
,
349 struct inode
*parent
, struct page
*page
)
351 struct page
*dentry_page
;
352 struct f2fs_dentry_block
*dentry_blk
;
353 struct f2fs_dentry_ptr d
;
355 if (f2fs_has_inline_dentry(inode
))
356 return make_empty_inline_dir(inode
, parent
, page
);
358 dentry_page
= get_new_data_page(inode
, page
, 0, true);
359 if (IS_ERR(dentry_page
))
360 return PTR_ERR(dentry_page
);
362 dentry_blk
= kmap_atomic(dentry_page
);
364 make_dentry_ptr(&d
, (void *)dentry_blk
, 1);
365 do_make_empty_dir(inode
, parent
, &d
);
367 kunmap_atomic(dentry_blk
);
369 set_page_dirty(dentry_page
);
370 f2fs_put_page(dentry_page
, 1);
374 struct page
*init_inode_metadata(struct inode
*inode
, struct inode
*dir
,
375 const struct qstr
*name
, struct page
*dpage
)
380 if (is_inode_flag_set(F2FS_I(inode
), FI_NEW_INODE
)) {
381 page
= new_inode_page(inode
);
385 if (S_ISDIR(inode
->i_mode
)) {
386 err
= make_empty_dir(inode
, dir
, page
);
391 err
= f2fs_init_acl(inode
, dir
, page
, dpage
);
395 err
= f2fs_init_security(inode
, dir
, name
, page
);
399 page
= get_node_page(F2FS_I_SB(dir
), inode
->i_ino
);
403 set_cold_node(inode
, page
);
407 init_dent_inode(name
, page
);
410 * This file should be checkpointed during fsync.
411 * We lost i_pino from now on.
413 if (is_inode_flag_set(F2FS_I(inode
), FI_INC_LINK
)) {
414 file_lost_pino(inode
);
416 * If link the tmpfile to alias through linkat path,
417 * we should remove this inode from orphan list.
419 if (inode
->i_nlink
== 0)
420 remove_orphan_inode(F2FS_I_SB(dir
), inode
->i_ino
);
426 f2fs_put_page(page
, 1);
428 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
429 truncate_inode_pages(&inode
->i_data
, 0);
430 truncate_blocks(inode
, 0, false);
431 remove_dirty_dir_inode(inode
);
432 remove_inode_page(inode
);
436 void update_parent_metadata(struct inode
*dir
, struct inode
*inode
,
437 unsigned int current_depth
)
439 if (is_inode_flag_set(F2FS_I(inode
), FI_NEW_INODE
)) {
440 if (S_ISDIR(inode
->i_mode
)) {
442 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
444 clear_inode_flag(F2FS_I(inode
), FI_NEW_INODE
);
446 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
447 mark_inode_dirty(dir
);
449 if (F2FS_I(dir
)->i_current_depth
!= current_depth
) {
450 F2FS_I(dir
)->i_current_depth
= current_depth
;
451 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
454 if (is_inode_flag_set(F2FS_I(inode
), FI_INC_LINK
))
455 clear_inode_flag(F2FS_I(inode
), FI_INC_LINK
);
458 int room_for_filename(const void *bitmap
, int slots
, int max_slots
)
461 int zero_start
, zero_end
;
463 zero_start
= find_next_zero_bit_le(bitmap
, max_slots
, bit_start
);
464 if (zero_start
>= max_slots
)
467 zero_end
= find_next_bit_le(bitmap
, max_slots
, zero_start
);
468 if (zero_end
- zero_start
>= slots
)
471 bit_start
= zero_end
+ 1;
473 if (zero_end
+ 1 >= max_slots
)
479 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
482 int __f2fs_add_link(struct inode
*dir
, const struct qstr
*name
,
485 unsigned int bit_pos
;
487 unsigned int current_depth
;
488 unsigned long bidx
, block
;
489 f2fs_hash_t dentry_hash
;
490 struct f2fs_dir_entry
*de
;
491 unsigned int nbucket
, nblock
;
492 size_t namelen
= name
->len
;
493 struct page
*dentry_page
= NULL
;
494 struct f2fs_dentry_block
*dentry_blk
= NULL
;
495 int slots
= GET_DENTRY_SLOTS(namelen
);
500 if (f2fs_has_inline_dentry(dir
)) {
501 err
= f2fs_add_inline_entry(dir
, name
, inode
);
502 if (!err
|| err
!= -EAGAIN
)
508 dentry_hash
= f2fs_dentry_hash(name
);
510 current_depth
= F2FS_I(dir
)->i_current_depth
;
511 if (F2FS_I(dir
)->chash
== dentry_hash
) {
512 level
= F2FS_I(dir
)->clevel
;
513 F2FS_I(dir
)->chash
= 0;
517 if (unlikely(current_depth
== MAX_DIR_HASH_DEPTH
))
520 /* Increase the depth, if required */
521 if (level
== current_depth
)
524 nbucket
= dir_buckets(level
, F2FS_I(dir
)->i_dir_level
);
525 nblock
= bucket_blocks(level
);
527 bidx
= dir_block_index(level
, F2FS_I(dir
)->i_dir_level
,
528 (le32_to_cpu(dentry_hash
) % nbucket
));
530 for (block
= bidx
; block
<= (bidx
+ nblock
- 1); block
++) {
531 dentry_page
= get_new_data_page(dir
, NULL
, block
, true);
532 if (IS_ERR(dentry_page
))
533 return PTR_ERR(dentry_page
);
535 dentry_blk
= kmap(dentry_page
);
536 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
537 slots
, NR_DENTRY_IN_BLOCK
);
538 if (bit_pos
< NR_DENTRY_IN_BLOCK
)
542 f2fs_put_page(dentry_page
, 1);
545 /* Move to next level to find the empty slot for new dentry */
549 f2fs_wait_on_page_writeback(dentry_page
, DATA
);
551 down_write(&F2FS_I(inode
)->i_sem
);
552 page
= init_inode_metadata(inode
, dir
, name
, NULL
);
557 de
= &dentry_blk
->dentry
[bit_pos
];
558 de
->hash_code
= dentry_hash
;
559 de
->name_len
= cpu_to_le16(namelen
);
560 memcpy(dentry_blk
->filename
[bit_pos
], name
->name
, name
->len
);
561 de
->ino
= cpu_to_le32(inode
->i_ino
);
562 set_de_type(de
, inode
);
563 for (i
= 0; i
< slots
; i
++)
564 test_and_set_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
565 set_page_dirty(dentry_page
);
567 /* we don't need to mark_inode_dirty now */
568 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
569 update_inode(inode
, page
);
570 f2fs_put_page(page
, 1);
572 update_parent_metadata(dir
, inode
, current_depth
);
574 up_write(&F2FS_I(inode
)->i_sem
);
576 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
577 update_inode_page(dir
);
578 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
581 f2fs_put_page(dentry_page
, 1);
585 int f2fs_do_tmpfile(struct inode
*inode
, struct inode
*dir
)
590 down_write(&F2FS_I(inode
)->i_sem
);
591 page
= init_inode_metadata(inode
, dir
, NULL
, NULL
);
596 /* we don't need to mark_inode_dirty now */
597 update_inode(inode
, page
);
598 f2fs_put_page(page
, 1);
600 clear_inode_flag(F2FS_I(inode
), FI_NEW_INODE
);
602 up_write(&F2FS_I(inode
)->i_sem
);
606 void f2fs_drop_nlink(struct inode
*dir
, struct inode
*inode
, struct page
*page
)
608 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
610 down_write(&F2FS_I(inode
)->i_sem
);
612 if (S_ISDIR(inode
->i_mode
)) {
615 update_inode(dir
, page
);
617 update_inode_page(dir
);
619 inode
->i_ctime
= CURRENT_TIME
;
622 if (S_ISDIR(inode
->i_mode
)) {
624 i_size_write(inode
, 0);
626 up_write(&F2FS_I(inode
)->i_sem
);
627 update_inode_page(inode
);
629 if (inode
->i_nlink
== 0)
630 add_orphan_inode(sbi
, inode
->i_ino
);
632 release_orphan_inode(sbi
);
636 * It only removes the dentry from the dentry page, corresponding name
637 * entry in name page does not need to be touched during deletion.
639 void f2fs_delete_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
640 struct inode
*dir
, struct inode
*inode
)
642 struct f2fs_dentry_block
*dentry_blk
;
643 unsigned int bit_pos
;
644 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
647 if (f2fs_has_inline_dentry(dir
))
648 return f2fs_delete_inline_entry(dentry
, page
, dir
, inode
);
651 f2fs_wait_on_page_writeback(page
, DATA
);
653 dentry_blk
= page_address(page
);
654 bit_pos
= dentry
- dentry_blk
->dentry
;
655 for (i
= 0; i
< slots
; i
++)
656 clear_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
658 /* Let's check and deallocate this dentry page */
659 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
662 kunmap(page
); /* kunmap - pair of f2fs_find_entry */
663 set_page_dirty(page
);
665 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
668 f2fs_drop_nlink(dir
, inode
, NULL
);
670 if (bit_pos
== NR_DENTRY_IN_BLOCK
) {
671 truncate_hole(dir
, page
->index
, page
->index
+ 1);
672 clear_page_dirty_for_io(page
);
673 ClearPageUptodate(page
);
674 inode_dec_dirty_pages(dir
);
676 f2fs_put_page(page
, 1);
679 bool f2fs_empty_dir(struct inode
*dir
)
682 struct page
*dentry_page
;
683 unsigned int bit_pos
;
684 struct f2fs_dentry_block
*dentry_blk
;
685 unsigned long nblock
= dir_blocks(dir
);
687 if (f2fs_has_inline_dentry(dir
))
688 return f2fs_empty_inline_dir(dir
);
690 for (bidx
= 0; bidx
< nblock
; bidx
++) {
691 dentry_page
= get_lock_data_page(dir
, bidx
);
692 if (IS_ERR(dentry_page
)) {
693 if (PTR_ERR(dentry_page
) == -ENOENT
)
699 dentry_blk
= kmap_atomic(dentry_page
);
704 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
707 kunmap_atomic(dentry_blk
);
709 f2fs_put_page(dentry_page
, 1);
711 if (bit_pos
< NR_DENTRY_IN_BLOCK
)
717 bool f2fs_fill_dentries(struct dir_context
*ctx
, struct f2fs_dentry_ptr
*d
,
718 unsigned int start_pos
)
720 unsigned char d_type
= DT_UNKNOWN
;
721 unsigned int bit_pos
;
722 struct f2fs_dir_entry
*de
= NULL
;
724 bit_pos
= ((unsigned long)ctx
->pos
% d
->max
);
726 while (bit_pos
< d
->max
) {
727 bit_pos
= find_next_bit_le(d
->bitmap
, d
->max
, bit_pos
);
728 if (bit_pos
>= d
->max
)
731 de
= &d
->dentry
[bit_pos
];
732 if (de
->file_type
< F2FS_FT_MAX
)
733 d_type
= f2fs_filetype_table
[de
->file_type
];
736 if (!dir_emit(ctx
, d
->filename
[bit_pos
],
737 le16_to_cpu(de
->name_len
),
738 le32_to_cpu(de
->ino
), d_type
))
741 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
742 ctx
->pos
= start_pos
+ bit_pos
;
747 static int f2fs_readdir(struct file
*file
, struct dir_context
*ctx
)
749 struct inode
*inode
= file_inode(file
);
750 unsigned long npages
= dir_blocks(inode
);
751 struct f2fs_dentry_block
*dentry_blk
= NULL
;
752 struct page
*dentry_page
= NULL
;
753 struct file_ra_state
*ra
= &file
->f_ra
;
754 unsigned int n
= ((unsigned long)ctx
->pos
/ NR_DENTRY_IN_BLOCK
);
755 struct f2fs_dentry_ptr d
;
757 if (f2fs_has_inline_dentry(inode
))
758 return f2fs_read_inline_dir(file
, ctx
);
760 /* readahead for multi pages of dir */
761 if (npages
- n
> 1 && !ra_has_index(ra
, n
))
762 page_cache_sync_readahead(inode
->i_mapping
, ra
, file
, n
,
763 min(npages
- n
, (pgoff_t
)MAX_DIR_RA_PAGES
));
765 for (; n
< npages
; n
++) {
766 dentry_page
= get_lock_data_page(inode
, n
);
767 if (IS_ERR(dentry_page
))
770 dentry_blk
= kmap(dentry_page
);
772 make_dentry_ptr(&d
, (void *)dentry_blk
, 1);
774 if (f2fs_fill_dentries(ctx
, &d
, n
* NR_DENTRY_IN_BLOCK
))
777 ctx
->pos
= (n
+ 1) * NR_DENTRY_IN_BLOCK
;
779 f2fs_put_page(dentry_page
, 1);
783 if (dentry_page
&& !IS_ERR(dentry_page
)) {
785 f2fs_put_page(dentry_page
, 1);
791 const struct file_operations f2fs_dir_operations
= {
792 .llseek
= generic_file_llseek
,
793 .read
= generic_read_dir
,
794 .iterate
= f2fs_readdir
,
795 .fsync
= f2fs_sync_file
,
796 .unlocked_ioctl
= f2fs_ioctl
,