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
;
99 *max_slots
= NR_DENTRY_IN_BLOCK
;
101 dentry_blk
= (struct f2fs_dentry_block
*)kmap(dentry_page
);
102 de
= find_target_dentry(name
, max_slots
, &dentry_blk
->dentry_bitmap
,
104 dentry_blk
->filename
);
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
), *max_slots
< 0);
118 struct f2fs_dir_entry
*find_target_dentry(struct qstr
*name
, int *max_slots
,
119 const void *bitmap
, struct f2fs_dir_entry
*dentry
,
120 __u8 (*filenames
)[F2FS_SLOT_LEN
])
122 struct f2fs_dir_entry
*de
;
123 unsigned long bit_pos
= 0;
124 f2fs_hash_t namehash
= f2fs_dentry_hash(name
);
125 int max_bits
= *max_slots
;
129 while (bit_pos
< max_bits
) {
130 if (!test_bit_le(bit_pos
, bitmap
)) {
133 else if (!test_bit_le(bit_pos
- 1, bitmap
))
138 de
= &dentry
[bit_pos
];
139 if (early_match_name(name
->len
, namehash
, de
) &&
140 !memcmp(filenames
[bit_pos
], name
->name
, name
->len
))
143 if (*max_slots
>= 0 && max_len
> *max_slots
) {
144 *max_slots
= max_len
;
148 /* remain bug on condition */
149 if (unlikely(!de
->name_len
))
152 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
157 if (max_len
> *max_slots
)
158 *max_slots
= max_len
;
162 static struct f2fs_dir_entry
*find_in_level(struct inode
*dir
,
163 unsigned int level
, struct qstr
*name
,
164 f2fs_hash_t namehash
, struct page
**res_page
)
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
;
174 f2fs_bug_on(F2FS_I_SB(dir
), level
> MAX_DIR_HASH_DEPTH
);
176 nbucket
= dir_buckets(level
, F2FS_I(dir
)->i_dir_level
);
177 nblock
= bucket_blocks(level
);
179 bidx
= dir_block_index(level
, F2FS_I(dir
)->i_dir_level
,
180 le32_to_cpu(namehash
) % nbucket
);
181 end_block
= bidx
+ nblock
;
183 for (; bidx
< end_block
; bidx
++) {
184 /* no need to allocate new dentry pages to all the indices */
185 dentry_page
= find_data_page(dir
, bidx
, true);
186 if (IS_ERR(dentry_page
)) {
191 de
= find_in_block(dentry_page
, name
, &max_slots
, res_page
);
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 f2fs_hash_t name_hash
;
220 unsigned int max_depth
;
223 if (f2fs_has_inline_dentry(dir
))
224 return find_in_inline_dir(dir
, child
, res_page
);
231 name_hash
= f2fs_dentry_hash(child
);
232 max_depth
= F2FS_I(dir
)->i_current_depth
;
234 for (level
= 0; level
< max_depth
; level
++) {
235 de
= find_in_level(dir
, level
, child
, name_hash
, res_page
);
239 if (!de
&& F2FS_I(dir
)->chash
!= name_hash
) {
240 F2FS_I(dir
)->chash
= name_hash
;
241 F2FS_I(dir
)->clevel
= level
- 1;
246 struct f2fs_dir_entry
*f2fs_parent_dir(struct inode
*dir
, struct page
**p
)
249 struct f2fs_dir_entry
*de
;
250 struct f2fs_dentry_block
*dentry_blk
;
252 if (f2fs_has_inline_dentry(dir
))
253 return f2fs_parent_inline_dir(dir
, p
);
255 page
= get_lock_data_page(dir
, 0);
259 dentry_blk
= kmap(page
);
260 de
= &dentry_blk
->dentry
[1];
266 ino_t
f2fs_inode_by_name(struct inode
*dir
, struct qstr
*qstr
)
269 struct f2fs_dir_entry
*de
;
272 de
= f2fs_find_entry(dir
, qstr
, &page
);
274 res
= le32_to_cpu(de
->ino
);
275 if (!f2fs_has_inline_dentry(dir
))
277 f2fs_put_page(page
, 0);
283 void f2fs_set_link(struct inode
*dir
, struct f2fs_dir_entry
*de
,
284 struct page
*page
, struct inode
*inode
)
287 f2fs_wait_on_page_writeback(page
, DATA
);
288 de
->ino
= cpu_to_le32(inode
->i_ino
);
289 set_de_type(de
, inode
);
290 if (!f2fs_has_inline_dentry(dir
))
292 set_page_dirty(page
);
293 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
294 mark_inode_dirty(dir
);
296 f2fs_put_page(page
, 1);
299 static void init_dent_inode(const struct qstr
*name
, struct page
*ipage
)
301 struct f2fs_inode
*ri
;
303 f2fs_wait_on_page_writeback(ipage
, NODE
);
305 /* copy name info. to this inode page */
306 ri
= F2FS_INODE(ipage
);
307 ri
->i_namelen
= cpu_to_le32(name
->len
);
308 memcpy(ri
->i_name
, name
->name
, name
->len
);
309 set_page_dirty(ipage
);
312 int update_dent_inode(struct inode
*inode
, const struct qstr
*name
)
316 page
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
318 return PTR_ERR(page
);
320 init_dent_inode(name
, page
);
321 f2fs_put_page(page
, 1);
326 static int make_empty_dir(struct inode
*inode
,
327 struct inode
*parent
, struct page
*page
)
329 struct page
*dentry_page
;
330 struct f2fs_dentry_block
*dentry_blk
;
331 struct f2fs_dir_entry
*de
;
333 if (f2fs_has_inline_dentry(inode
))
334 return make_empty_inline_dir(inode
, parent
, page
);
336 dentry_page
= get_new_data_page(inode
, page
, 0, true);
337 if (IS_ERR(dentry_page
))
338 return PTR_ERR(dentry_page
);
340 dentry_blk
= kmap_atomic(dentry_page
);
342 de
= &dentry_blk
->dentry
[0];
343 de
->name_len
= cpu_to_le16(1);
345 de
->ino
= cpu_to_le32(inode
->i_ino
);
346 memcpy(dentry_blk
->filename
[0], ".", 1);
347 set_de_type(de
, inode
);
349 de
= &dentry_blk
->dentry
[1];
351 de
->name_len
= cpu_to_le16(2);
352 de
->ino
= cpu_to_le32(parent
->i_ino
);
353 memcpy(dentry_blk
->filename
[1], "..", 2);
354 set_de_type(de
, inode
);
356 test_and_set_bit_le(0, &dentry_blk
->dentry_bitmap
);
357 test_and_set_bit_le(1, &dentry_blk
->dentry_bitmap
);
358 kunmap_atomic(dentry_blk
);
360 set_page_dirty(dentry_page
);
361 f2fs_put_page(dentry_page
, 1);
365 struct page
*init_inode_metadata(struct inode
*inode
,
366 struct inode
*dir
, const struct qstr
*name
)
371 if (is_inode_flag_set(F2FS_I(inode
), FI_NEW_INODE
)) {
372 page
= new_inode_page(inode
);
376 if (S_ISDIR(inode
->i_mode
)) {
377 err
= make_empty_dir(inode
, dir
, page
);
382 err
= f2fs_init_acl(inode
, dir
, page
);
386 err
= f2fs_init_security(inode
, dir
, name
, page
);
390 page
= get_node_page(F2FS_I_SB(dir
), inode
->i_ino
);
394 set_cold_node(inode
, page
);
398 init_dent_inode(name
, page
);
401 * This file should be checkpointed during fsync.
402 * We lost i_pino from now on.
404 if (is_inode_flag_set(F2FS_I(inode
), FI_INC_LINK
)) {
405 file_lost_pino(inode
);
407 * If link the tmpfile to alias through linkat path,
408 * we should remove this inode from orphan list.
410 if (inode
->i_nlink
== 0)
411 remove_orphan_inode(F2FS_I_SB(dir
), inode
->i_ino
);
417 f2fs_put_page(page
, 1);
419 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
420 truncate_inode_pages(&inode
->i_data
, 0);
421 truncate_blocks(inode
, 0, false);
422 remove_dirty_dir_inode(inode
);
423 remove_inode_page(inode
);
427 void update_parent_metadata(struct inode
*dir
, struct inode
*inode
,
428 unsigned int current_depth
)
430 if (is_inode_flag_set(F2FS_I(inode
), FI_NEW_INODE
)) {
431 if (S_ISDIR(inode
->i_mode
)) {
433 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
435 clear_inode_flag(F2FS_I(inode
), FI_NEW_INODE
);
437 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
438 mark_inode_dirty(dir
);
440 if (F2FS_I(dir
)->i_current_depth
!= current_depth
) {
441 F2FS_I(dir
)->i_current_depth
= current_depth
;
442 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
445 if (is_inode_flag_set(F2FS_I(inode
), FI_INC_LINK
))
446 clear_inode_flag(F2FS_I(inode
), FI_INC_LINK
);
449 int room_for_filename(const void *bitmap
, int slots
, int max_slots
)
452 int zero_start
, zero_end
;
454 zero_start
= find_next_zero_bit_le(bitmap
, max_slots
, bit_start
);
455 if (zero_start
>= max_slots
)
458 zero_end
= find_next_bit_le(bitmap
, max_slots
, zero_start
);
459 if (zero_end
- zero_start
>= slots
)
462 bit_start
= zero_end
+ 1;
464 if (zero_end
+ 1 >= max_slots
)
470 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
473 int __f2fs_add_link(struct inode
*dir
, const struct qstr
*name
,
476 unsigned int bit_pos
;
478 unsigned int current_depth
;
479 unsigned long bidx
, block
;
480 f2fs_hash_t dentry_hash
;
481 struct f2fs_dir_entry
*de
;
482 unsigned int nbucket
, nblock
;
483 size_t namelen
= name
->len
;
484 struct page
*dentry_page
= NULL
;
485 struct f2fs_dentry_block
*dentry_blk
= NULL
;
486 int slots
= GET_DENTRY_SLOTS(namelen
);
491 if (f2fs_has_inline_dentry(dir
)) {
492 err
= f2fs_add_inline_entry(dir
, name
, inode
);
493 if (!err
|| err
!= -EAGAIN
)
499 dentry_hash
= f2fs_dentry_hash(name
);
501 current_depth
= F2FS_I(dir
)->i_current_depth
;
502 if (F2FS_I(dir
)->chash
== dentry_hash
) {
503 level
= F2FS_I(dir
)->clevel
;
504 F2FS_I(dir
)->chash
= 0;
508 if (unlikely(current_depth
== MAX_DIR_HASH_DEPTH
))
511 /* Increase the depth, if required */
512 if (level
== current_depth
)
515 nbucket
= dir_buckets(level
, F2FS_I(dir
)->i_dir_level
);
516 nblock
= bucket_blocks(level
);
518 bidx
= dir_block_index(level
, F2FS_I(dir
)->i_dir_level
,
519 (le32_to_cpu(dentry_hash
) % nbucket
));
521 for (block
= bidx
; block
<= (bidx
+ nblock
- 1); block
++) {
522 dentry_page
= get_new_data_page(dir
, NULL
, block
, true);
523 if (IS_ERR(dentry_page
))
524 return PTR_ERR(dentry_page
);
526 dentry_blk
= kmap(dentry_page
);
527 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
528 slots
, NR_DENTRY_IN_BLOCK
);
529 if (bit_pos
< NR_DENTRY_IN_BLOCK
)
533 f2fs_put_page(dentry_page
, 1);
536 /* Move to next level to find the empty slot for new dentry */
540 f2fs_wait_on_page_writeback(dentry_page
, DATA
);
542 down_write(&F2FS_I(inode
)->i_sem
);
543 page
= init_inode_metadata(inode
, dir
, name
);
548 de
= &dentry_blk
->dentry
[bit_pos
];
549 de
->hash_code
= dentry_hash
;
550 de
->name_len
= cpu_to_le16(namelen
);
551 memcpy(dentry_blk
->filename
[bit_pos
], name
->name
, name
->len
);
552 de
->ino
= cpu_to_le32(inode
->i_ino
);
553 set_de_type(de
, inode
);
554 for (i
= 0; i
< slots
; i
++)
555 test_and_set_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
556 set_page_dirty(dentry_page
);
558 /* we don't need to mark_inode_dirty now */
559 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
560 update_inode(inode
, page
);
561 f2fs_put_page(page
, 1);
563 update_parent_metadata(dir
, inode
, current_depth
);
565 up_write(&F2FS_I(inode
)->i_sem
);
567 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
568 update_inode_page(dir
);
569 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
572 f2fs_put_page(dentry_page
, 1);
576 int f2fs_do_tmpfile(struct inode
*inode
, struct inode
*dir
)
581 down_write(&F2FS_I(inode
)->i_sem
);
582 page
= init_inode_metadata(inode
, dir
, NULL
);
587 /* we don't need to mark_inode_dirty now */
588 update_inode(inode
, page
);
589 f2fs_put_page(page
, 1);
591 clear_inode_flag(F2FS_I(inode
), FI_NEW_INODE
);
593 up_write(&F2FS_I(inode
)->i_sem
);
597 void f2fs_drop_nlink(struct inode
*dir
, struct inode
*inode
, struct page
*page
)
599 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
601 down_write(&F2FS_I(inode
)->i_sem
);
603 if (S_ISDIR(inode
->i_mode
)) {
606 update_inode(dir
, page
);
608 update_inode_page(dir
);
610 inode
->i_ctime
= CURRENT_TIME
;
613 if (S_ISDIR(inode
->i_mode
)) {
615 i_size_write(inode
, 0);
617 up_write(&F2FS_I(inode
)->i_sem
);
618 update_inode_page(inode
);
620 if (inode
->i_nlink
== 0)
621 add_orphan_inode(sbi
, inode
->i_ino
);
623 release_orphan_inode(sbi
);
627 * It only removes the dentry from the dentry page, corresponding name
628 * entry in name page does not need to be touched during deletion.
630 void f2fs_delete_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
631 struct inode
*dir
, struct inode
*inode
)
633 struct f2fs_dentry_block
*dentry_blk
;
634 unsigned int bit_pos
;
635 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
638 if (f2fs_has_inline_dentry(dir
))
639 return f2fs_delete_inline_entry(dentry
, page
, dir
, inode
);
642 f2fs_wait_on_page_writeback(page
, DATA
);
644 dentry_blk
= page_address(page
);
645 bit_pos
= dentry
- dentry_blk
->dentry
;
646 for (i
= 0; i
< slots
; i
++)
647 test_and_clear_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
649 /* Let's check and deallocate this dentry page */
650 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
653 kunmap(page
); /* kunmap - pair of f2fs_find_entry */
654 set_page_dirty(page
);
656 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
659 f2fs_drop_nlink(dir
, inode
, NULL
);
661 if (bit_pos
== NR_DENTRY_IN_BLOCK
) {
662 truncate_hole(dir
, page
->index
, page
->index
+ 1);
663 clear_page_dirty_for_io(page
);
664 ClearPageUptodate(page
);
665 inode_dec_dirty_pages(dir
);
667 f2fs_put_page(page
, 1);
670 bool f2fs_empty_dir(struct inode
*dir
)
673 struct page
*dentry_page
;
674 unsigned int bit_pos
;
675 struct f2fs_dentry_block
*dentry_blk
;
676 unsigned long nblock
= dir_blocks(dir
);
678 if (f2fs_has_inline_dentry(dir
))
679 return f2fs_empty_inline_dir(dir
);
681 for (bidx
= 0; bidx
< nblock
; bidx
++) {
682 dentry_page
= get_lock_data_page(dir
, bidx
);
683 if (IS_ERR(dentry_page
)) {
684 if (PTR_ERR(dentry_page
) == -ENOENT
)
690 dentry_blk
= kmap_atomic(dentry_page
);
695 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
698 kunmap_atomic(dentry_blk
);
700 f2fs_put_page(dentry_page
, 1);
702 if (bit_pos
< NR_DENTRY_IN_BLOCK
)
708 static int f2fs_readdir(struct file
*file
, struct dir_context
*ctx
)
710 struct inode
*inode
= file_inode(file
);
711 unsigned long npages
= dir_blocks(inode
);
712 unsigned int bit_pos
= 0;
713 struct f2fs_dentry_block
*dentry_blk
= NULL
;
714 struct f2fs_dir_entry
*de
= NULL
;
715 struct page
*dentry_page
= NULL
;
716 struct file_ra_state
*ra
= &file
->f_ra
;
717 unsigned int n
= ((unsigned long)ctx
->pos
/ NR_DENTRY_IN_BLOCK
);
718 unsigned char d_type
= DT_UNKNOWN
;
720 if (f2fs_has_inline_dentry(inode
))
721 return f2fs_read_inline_dir(file
, ctx
);
723 bit_pos
= ((unsigned long)ctx
->pos
% NR_DENTRY_IN_BLOCK
);
725 /* readahead for multi pages of dir */
726 if (npages
- n
> 1 && !ra_has_index(ra
, n
))
727 page_cache_sync_readahead(inode
->i_mapping
, ra
, file
, n
,
728 min(npages
- n
, (pgoff_t
)MAX_DIR_RA_PAGES
));
730 for (; n
< npages
; n
++) {
731 dentry_page
= get_lock_data_page(inode
, n
);
732 if (IS_ERR(dentry_page
))
735 dentry_blk
= kmap(dentry_page
);
736 while (bit_pos
< NR_DENTRY_IN_BLOCK
) {
737 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
740 if (bit_pos
>= NR_DENTRY_IN_BLOCK
)
743 de
= &dentry_blk
->dentry
[bit_pos
];
744 if (de
->file_type
< F2FS_FT_MAX
)
745 d_type
= f2fs_filetype_table
[de
->file_type
];
749 dentry_blk
->filename
[bit_pos
],
750 le16_to_cpu(de
->name_len
),
751 le32_to_cpu(de
->ino
), d_type
))
754 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
755 ctx
->pos
= n
* NR_DENTRY_IN_BLOCK
+ bit_pos
;
758 ctx
->pos
= (n
+ 1) * NR_DENTRY_IN_BLOCK
;
760 f2fs_put_page(dentry_page
, 1);
764 if (dentry_page
&& !IS_ERR(dentry_page
)) {
766 f2fs_put_page(dentry_page
, 1);
772 const struct file_operations f2fs_dir_operations
= {
773 .llseek
= generic_file_llseek
,
774 .read
= generic_read_dir
,
775 .iterate
= f2fs_readdir
,
776 .fsync
= f2fs_sync_file
,
777 .unlocked_ioctl
= f2fs_ioctl
,