1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
6 * http://www.samsung.com/
9 #include <linux/f2fs_fs.h>
10 #include <linux/bio.h>
11 #include <linux/blkdev.h>
12 #include <linux/prefetch.h>
13 #include <linux/kthread.h>
14 #include <linux/swap.h>
15 #include <linux/timer.h>
16 #include <linux/freezer.h>
17 #include <linux/sched/signal.h>
24 #include <trace/events/f2fs.h>
26 #define __reverse_ffz(x) __reverse_ffs(~(x))
28 static struct kmem_cache *discard_entry_slab;
29 static struct kmem_cache *discard_cmd_slab;
30 static struct kmem_cache *sit_entry_set_slab;
31 static struct kmem_cache *inmem_entry_slab;
33 static unsigned long __reverse_ulong(unsigned char *str)
35 unsigned long tmp = 0;
36 int shift = 24, idx = 0;
38 #if BITS_PER_LONG == 64
42 tmp |= (unsigned long)str[idx++] << shift;
43 shift -= BITS_PER_BYTE;
49 * __reverse_ffs is copied from include/asm-generic/bitops/__ffs.h since
50 * MSB and LSB are reversed in a byte by f2fs_set_bit.
52 static inline unsigned long __reverse_ffs(unsigned long word)
56 #if BITS_PER_LONG == 64
57 if ((word & 0xffffffff00000000UL) == 0)
62 if ((word & 0xffff0000) == 0)
67 if ((word & 0xff00) == 0)
72 if ((word & 0xf0) == 0)
77 if ((word & 0xc) == 0)
82 if ((word & 0x2) == 0)
88 * __find_rev_next(_zero)_bit is copied from lib/find_next_bit.c because
89 * f2fs_set_bit makes MSB and LSB reversed in a byte.
90 * @size must be integral times of unsigned long.
93 * f2fs_set_bit(0, bitmap) => 1000 0000
94 * f2fs_set_bit(7, bitmap) => 0000 0001
96 static unsigned long __find_rev_next_bit(const unsigned long *addr,
97 unsigned long size, unsigned long offset)
99 const unsigned long *p = addr + BIT_WORD(offset);
100 unsigned long result = size;
106 size -= (offset & ~(BITS_PER_LONG - 1));
107 offset %= BITS_PER_LONG;
113 tmp = __reverse_ulong((unsigned char *)p);
115 tmp &= ~0UL >> offset;
116 if (size < BITS_PER_LONG)
117 tmp &= (~0UL << (BITS_PER_LONG - size));
121 if (size <= BITS_PER_LONG)
123 size -= BITS_PER_LONG;
129 return result - size + __reverse_ffs(tmp);
132 static unsigned long __find_rev_next_zero_bit(const unsigned long *addr,
133 unsigned long size, unsigned long offset)
135 const unsigned long *p = addr + BIT_WORD(offset);
136 unsigned long result = size;
142 size -= (offset & ~(BITS_PER_LONG - 1));
143 offset %= BITS_PER_LONG;
149 tmp = __reverse_ulong((unsigned char *)p);
152 tmp |= ~0UL << (BITS_PER_LONG - offset);
153 if (size < BITS_PER_LONG)
158 if (size <= BITS_PER_LONG)
160 size -= BITS_PER_LONG;
166 return result - size + __reverse_ffz(tmp);
169 bool f2fs_need_SSR(struct f2fs_sb_info *sbi)
171 int node_secs = get_blocktype_secs(sbi, F2FS_DIRTY_NODES);
172 int dent_secs = get_blocktype_secs(sbi, F2FS_DIRTY_DENTS);
173 int imeta_secs = get_blocktype_secs(sbi, F2FS_DIRTY_IMETA);
175 if (test_opt(sbi, LFS))
177 if (sbi->gc_mode == GC_URGENT)
179 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
182 return free_sections(sbi) <= (node_secs + 2 * dent_secs + imeta_secs +
183 SM_I(sbi)->min_ssr_sections + reserved_sections(sbi));
186 void f2fs_register_inmem_page(struct inode *inode, struct page *page)
188 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
189 struct f2fs_inode_info *fi = F2FS_I(inode);
190 struct inmem_pages *new;
192 f2fs_trace_pid(page);
194 f2fs_set_page_private(page, (unsigned long)ATOMIC_WRITTEN_PAGE);
196 new = f2fs_kmem_cache_alloc(inmem_entry_slab, GFP_NOFS);
198 /* add atomic page indices to the list */
200 INIT_LIST_HEAD(&new->list);
202 /* increase reference count with clean state */
203 mutex_lock(&fi->inmem_lock);
205 list_add_tail(&new->list, &fi->inmem_pages);
206 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
207 if (list_empty(&fi->inmem_ilist))
208 list_add_tail(&fi->inmem_ilist, &sbi->inode_list[ATOMIC_FILE]);
209 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
210 inc_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
211 mutex_unlock(&fi->inmem_lock);
213 trace_f2fs_register_inmem_page(page, INMEM);
216 static int __revoke_inmem_pages(struct inode *inode,
217 struct list_head *head, bool drop, bool recover,
220 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
221 struct inmem_pages *cur, *tmp;
224 list_for_each_entry_safe(cur, tmp, head, list) {
225 struct page *page = cur->page;
228 trace_f2fs_commit_inmem_page(page, INMEM_DROP);
232 * to avoid deadlock in between page lock and
235 if (!trylock_page(page))
241 f2fs_wait_on_page_writeback(page, DATA, true, true);
244 struct dnode_of_data dn;
247 trace_f2fs_commit_inmem_page(page, INMEM_REVOKE);
249 set_new_dnode(&dn, inode, NULL, NULL, 0);
250 err = f2fs_get_dnode_of_data(&dn, page->index,
253 if (err == -ENOMEM) {
254 congestion_wait(BLK_RW_ASYNC, HZ/50);
262 err = f2fs_get_node_info(sbi, dn.nid, &ni);
268 if (cur->old_addr == NEW_ADDR) {
269 f2fs_invalidate_blocks(sbi, dn.data_blkaddr);
270 f2fs_update_data_blkaddr(&dn, NEW_ADDR);
272 f2fs_replace_block(sbi, &dn, dn.data_blkaddr,
273 cur->old_addr, ni.version, true, true);
277 /* we don't need to invalidate this in the sccessful status */
278 if (drop || recover) {
279 ClearPageUptodate(page);
280 clear_cold_data(page);
282 f2fs_clear_page_private(page);
283 f2fs_put_page(page, 1);
285 list_del(&cur->list);
286 kmem_cache_free(inmem_entry_slab, cur);
287 dec_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
292 void f2fs_drop_inmem_pages_all(struct f2fs_sb_info *sbi, bool gc_failure)
294 struct list_head *head = &sbi->inode_list[ATOMIC_FILE];
296 struct f2fs_inode_info *fi;
298 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
299 if (list_empty(head)) {
300 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
303 fi = list_first_entry(head, struct f2fs_inode_info, inmem_ilist);
304 inode = igrab(&fi->vfs_inode);
305 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
309 if (fi->i_gc_failures[GC_FAILURE_ATOMIC])
314 set_inode_flag(inode, FI_ATOMIC_REVOKE_REQUEST);
315 f2fs_drop_inmem_pages(inode);
319 congestion_wait(BLK_RW_ASYNC, HZ/50);
324 void f2fs_drop_inmem_pages(struct inode *inode)
326 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
327 struct f2fs_inode_info *fi = F2FS_I(inode);
329 while (!list_empty(&fi->inmem_pages)) {
330 mutex_lock(&fi->inmem_lock);
331 __revoke_inmem_pages(inode, &fi->inmem_pages,
334 if (list_empty(&fi->inmem_pages)) {
335 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
336 if (!list_empty(&fi->inmem_ilist))
337 list_del_init(&fi->inmem_ilist);
338 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
340 mutex_unlock(&fi->inmem_lock);
343 clear_inode_flag(inode, FI_ATOMIC_FILE);
344 fi->i_gc_failures[GC_FAILURE_ATOMIC] = 0;
345 stat_dec_atomic_write(inode);
348 void f2fs_drop_inmem_page(struct inode *inode, struct page *page)
350 struct f2fs_inode_info *fi = F2FS_I(inode);
351 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
352 struct list_head *head = &fi->inmem_pages;
353 struct inmem_pages *cur = NULL;
355 f2fs_bug_on(sbi, !IS_ATOMIC_WRITTEN_PAGE(page));
357 mutex_lock(&fi->inmem_lock);
358 list_for_each_entry(cur, head, list) {
359 if (cur->page == page)
363 f2fs_bug_on(sbi, list_empty(head) || cur->page != page);
364 list_del(&cur->list);
365 mutex_unlock(&fi->inmem_lock);
367 dec_page_count(sbi, F2FS_INMEM_PAGES);
368 kmem_cache_free(inmem_entry_slab, cur);
370 ClearPageUptodate(page);
371 f2fs_clear_page_private(page);
372 f2fs_put_page(page, 0);
374 trace_f2fs_commit_inmem_page(page, INMEM_INVALIDATE);
377 static int __f2fs_commit_inmem_pages(struct inode *inode)
379 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
380 struct f2fs_inode_info *fi = F2FS_I(inode);
381 struct inmem_pages *cur, *tmp;
382 struct f2fs_io_info fio = {
387 .op_flags = REQ_SYNC | REQ_PRIO,
388 .io_type = FS_DATA_IO,
390 struct list_head revoke_list;
391 bool submit_bio = false;
394 INIT_LIST_HEAD(&revoke_list);
396 list_for_each_entry_safe(cur, tmp, &fi->inmem_pages, list) {
397 struct page *page = cur->page;
400 if (page->mapping == inode->i_mapping) {
401 trace_f2fs_commit_inmem_page(page, INMEM);
403 f2fs_wait_on_page_writeback(page, DATA, true, true);
405 set_page_dirty(page);
406 if (clear_page_dirty_for_io(page)) {
407 inode_dec_dirty_pages(inode);
408 f2fs_remove_dirty_inode(inode);
412 fio.old_blkaddr = NULL_ADDR;
413 fio.encrypted_page = NULL;
414 fio.need_lock = LOCK_DONE;
415 err = f2fs_do_write_data_page(&fio);
417 if (err == -ENOMEM) {
418 congestion_wait(BLK_RW_ASYNC, HZ/50);
425 /* record old blkaddr for revoking */
426 cur->old_addr = fio.old_blkaddr;
430 list_move_tail(&cur->list, &revoke_list);
434 f2fs_submit_merged_write_cond(sbi, inode, NULL, 0, DATA);
438 * try to revoke all committed pages, but still we could fail
439 * due to no memory or other reason, if that happened, EAGAIN
440 * will be returned, which means in such case, transaction is
441 * already not integrity, caller should use journal to do the
442 * recovery or rewrite & commit last transaction. For other
443 * error number, revoking was done by filesystem itself.
445 err = __revoke_inmem_pages(inode, &revoke_list,
448 /* drop all uncommitted pages */
449 __revoke_inmem_pages(inode, &fi->inmem_pages,
452 __revoke_inmem_pages(inode, &revoke_list,
453 false, false, false);
459 int f2fs_commit_inmem_pages(struct inode *inode)
461 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
462 struct f2fs_inode_info *fi = F2FS_I(inode);
465 f2fs_balance_fs(sbi, true);
467 down_write(&fi->i_gc_rwsem[WRITE]);
470 set_inode_flag(inode, FI_ATOMIC_COMMIT);
472 mutex_lock(&fi->inmem_lock);
473 err = __f2fs_commit_inmem_pages(inode);
475 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
476 if (!list_empty(&fi->inmem_ilist))
477 list_del_init(&fi->inmem_ilist);
478 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
479 mutex_unlock(&fi->inmem_lock);
481 clear_inode_flag(inode, FI_ATOMIC_COMMIT);
484 up_write(&fi->i_gc_rwsem[WRITE]);
490 * This function balances dirty node and dentry pages.
491 * In addition, it controls garbage collection.
493 void f2fs_balance_fs(struct f2fs_sb_info *sbi, bool need)
495 if (time_to_inject(sbi, FAULT_CHECKPOINT)) {
496 f2fs_show_injection_info(FAULT_CHECKPOINT);
497 f2fs_stop_checkpoint(sbi, false);
500 /* balance_fs_bg is able to be pending */
501 if (need && excess_cached_nats(sbi))
502 f2fs_balance_fs_bg(sbi);
504 if (f2fs_is_checkpoint_ready(sbi))
508 * We should do GC or end up with checkpoint, if there are so many dirty
509 * dir/node pages without enough free segments.
511 if (has_not_enough_free_secs(sbi, 0, 0)) {
512 mutex_lock(&sbi->gc_mutex);
513 f2fs_gc(sbi, false, false, NULL_SEGNO);
517 void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi)
519 if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
522 /* try to shrink extent cache when there is no enough memory */
523 if (!f2fs_available_free_memory(sbi, EXTENT_CACHE))
524 f2fs_shrink_extent_tree(sbi, EXTENT_CACHE_SHRINK_NUMBER);
526 /* check the # of cached NAT entries */
527 if (!f2fs_available_free_memory(sbi, NAT_ENTRIES))
528 f2fs_try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK);
530 if (!f2fs_available_free_memory(sbi, FREE_NIDS))
531 f2fs_try_to_free_nids(sbi, MAX_FREE_NIDS);
533 f2fs_build_free_nids(sbi, false, false);
535 if (!is_idle(sbi, REQ_TIME) &&
536 (!excess_dirty_nats(sbi) && !excess_dirty_nodes(sbi)))
539 /* checkpoint is the only way to shrink partial cached entries */
540 if (!f2fs_available_free_memory(sbi, NAT_ENTRIES) ||
541 !f2fs_available_free_memory(sbi, INO_ENTRIES) ||
542 excess_prefree_segs(sbi) ||
543 excess_dirty_nats(sbi) ||
544 excess_dirty_nodes(sbi) ||
545 f2fs_time_over(sbi, CP_TIME)) {
546 if (test_opt(sbi, DATA_FLUSH)) {
547 struct blk_plug plug;
549 mutex_lock(&sbi->flush_lock);
551 blk_start_plug(&plug);
552 f2fs_sync_dirty_inodes(sbi, FILE_INODE);
553 blk_finish_plug(&plug);
555 mutex_unlock(&sbi->flush_lock);
557 f2fs_sync_fs(sbi->sb, true);
558 stat_inc_bg_cp_count(sbi->stat_info);
562 static int __submit_flush_wait(struct f2fs_sb_info *sbi,
563 struct block_device *bdev)
568 bio = f2fs_bio_alloc(sbi, 0, false);
572 bio->bi_opf = REQ_OP_WRITE | REQ_SYNC | REQ_PREFLUSH;
573 bio_set_dev(bio, bdev);
574 ret = submit_bio_wait(bio);
577 trace_f2fs_issue_flush(bdev, test_opt(sbi, NOBARRIER),
578 test_opt(sbi, FLUSH_MERGE), ret);
582 static int submit_flush_wait(struct f2fs_sb_info *sbi, nid_t ino)
587 if (!f2fs_is_multi_device(sbi))
588 return __submit_flush_wait(sbi, sbi->sb->s_bdev);
590 for (i = 0; i < sbi->s_ndevs; i++) {
591 if (!f2fs_is_dirty_device(sbi, ino, i, FLUSH_INO))
593 ret = __submit_flush_wait(sbi, FDEV(i).bdev);
600 static int issue_flush_thread(void *data)
602 struct f2fs_sb_info *sbi = data;
603 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
604 wait_queue_head_t *q = &fcc->flush_wait_queue;
606 if (kthread_should_stop())
609 sb_start_intwrite(sbi->sb);
611 if (!llist_empty(&fcc->issue_list)) {
612 struct flush_cmd *cmd, *next;
615 fcc->dispatch_list = llist_del_all(&fcc->issue_list);
616 fcc->dispatch_list = llist_reverse_order(fcc->dispatch_list);
618 cmd = llist_entry(fcc->dispatch_list, struct flush_cmd, llnode);
620 ret = submit_flush_wait(sbi, cmd->ino);
621 atomic_inc(&fcc->issued_flush);
623 llist_for_each_entry_safe(cmd, next,
624 fcc->dispatch_list, llnode) {
626 complete(&cmd->wait);
628 fcc->dispatch_list = NULL;
631 sb_end_intwrite(sbi->sb);
633 wait_event_interruptible(*q,
634 kthread_should_stop() || !llist_empty(&fcc->issue_list));
638 int f2fs_issue_flush(struct f2fs_sb_info *sbi, nid_t ino)
640 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
641 struct flush_cmd cmd;
644 if (test_opt(sbi, NOBARRIER))
647 if (!test_opt(sbi, FLUSH_MERGE)) {
648 atomic_inc(&fcc->queued_flush);
649 ret = submit_flush_wait(sbi, ino);
650 atomic_dec(&fcc->queued_flush);
651 atomic_inc(&fcc->issued_flush);
655 if (atomic_inc_return(&fcc->queued_flush) == 1 ||
656 f2fs_is_multi_device(sbi)) {
657 ret = submit_flush_wait(sbi, ino);
658 atomic_dec(&fcc->queued_flush);
660 atomic_inc(&fcc->issued_flush);
665 init_completion(&cmd.wait);
667 llist_add(&cmd.llnode, &fcc->issue_list);
669 /* update issue_list before we wake up issue_flush thread */
672 if (waitqueue_active(&fcc->flush_wait_queue))
673 wake_up(&fcc->flush_wait_queue);
675 if (fcc->f2fs_issue_flush) {
676 wait_for_completion(&cmd.wait);
677 atomic_dec(&fcc->queued_flush);
679 struct llist_node *list;
681 list = llist_del_all(&fcc->issue_list);
683 wait_for_completion(&cmd.wait);
684 atomic_dec(&fcc->queued_flush);
686 struct flush_cmd *tmp, *next;
688 ret = submit_flush_wait(sbi, ino);
690 llist_for_each_entry_safe(tmp, next, list, llnode) {
693 atomic_dec(&fcc->queued_flush);
697 complete(&tmp->wait);
705 int f2fs_create_flush_cmd_control(struct f2fs_sb_info *sbi)
707 dev_t dev = sbi->sb->s_bdev->bd_dev;
708 struct flush_cmd_control *fcc;
711 if (SM_I(sbi)->fcc_info) {
712 fcc = SM_I(sbi)->fcc_info;
713 if (fcc->f2fs_issue_flush)
718 fcc = f2fs_kzalloc(sbi, sizeof(struct flush_cmd_control), GFP_KERNEL);
721 atomic_set(&fcc->issued_flush, 0);
722 atomic_set(&fcc->queued_flush, 0);
723 init_waitqueue_head(&fcc->flush_wait_queue);
724 init_llist_head(&fcc->issue_list);
725 SM_I(sbi)->fcc_info = fcc;
726 if (!test_opt(sbi, FLUSH_MERGE))
730 fcc->f2fs_issue_flush = kthread_run(issue_flush_thread, sbi,
731 "f2fs_flush-%u:%u", MAJOR(dev), MINOR(dev));
732 if (IS_ERR(fcc->f2fs_issue_flush)) {
733 err = PTR_ERR(fcc->f2fs_issue_flush);
735 SM_I(sbi)->fcc_info = NULL;
742 void f2fs_destroy_flush_cmd_control(struct f2fs_sb_info *sbi, bool free)
744 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
746 if (fcc && fcc->f2fs_issue_flush) {
747 struct task_struct *flush_thread = fcc->f2fs_issue_flush;
749 fcc->f2fs_issue_flush = NULL;
750 kthread_stop(flush_thread);
754 SM_I(sbi)->fcc_info = NULL;
758 int f2fs_flush_device_cache(struct f2fs_sb_info *sbi)
762 if (!f2fs_is_multi_device(sbi))
765 for (i = 1; i < sbi->s_ndevs; i++) {
766 if (!f2fs_test_bit(i, (char *)&sbi->dirty_device))
768 ret = __submit_flush_wait(sbi, FDEV(i).bdev);
772 spin_lock(&sbi->dev_lock);
773 f2fs_clear_bit(i, (char *)&sbi->dirty_device);
774 spin_unlock(&sbi->dev_lock);
780 static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
781 enum dirty_type dirty_type)
783 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
785 /* need not be added */
786 if (IS_CURSEG(sbi, segno))
789 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type]))
790 dirty_i->nr_dirty[dirty_type]++;
792 if (dirty_type == DIRTY) {
793 struct seg_entry *sentry = get_seg_entry(sbi, segno);
794 enum dirty_type t = sentry->type;
796 if (unlikely(t >= DIRTY)) {
800 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t]))
801 dirty_i->nr_dirty[t]++;
805 static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
806 enum dirty_type dirty_type)
808 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
810 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type]))
811 dirty_i->nr_dirty[dirty_type]--;
813 if (dirty_type == DIRTY) {
814 struct seg_entry *sentry = get_seg_entry(sbi, segno);
815 enum dirty_type t = sentry->type;
817 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t]))
818 dirty_i->nr_dirty[t]--;
820 if (get_valid_blocks(sbi, segno, true) == 0)
821 clear_bit(GET_SEC_FROM_SEG(sbi, segno),
822 dirty_i->victim_secmap);
827 * Should not occur error such as -ENOMEM.
828 * Adding dirty entry into seglist is not critical operation.
829 * If a given segment is one of current working segments, it won't be added.
831 static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno)
833 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
834 unsigned short valid_blocks, ckpt_valid_blocks;
836 if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno))
839 mutex_lock(&dirty_i->seglist_lock);
841 valid_blocks = get_valid_blocks(sbi, segno, false);
842 ckpt_valid_blocks = get_ckpt_valid_blocks(sbi, segno);
844 if (valid_blocks == 0 && (!is_sbi_flag_set(sbi, SBI_CP_DISABLED) ||
845 ckpt_valid_blocks == sbi->blocks_per_seg)) {
846 __locate_dirty_segment(sbi, segno, PRE);
847 __remove_dirty_segment(sbi, segno, DIRTY);
848 } else if (valid_blocks < sbi->blocks_per_seg) {
849 __locate_dirty_segment(sbi, segno, DIRTY);
851 /* Recovery routine with SSR needs this */
852 __remove_dirty_segment(sbi, segno, DIRTY);
855 mutex_unlock(&dirty_i->seglist_lock);
858 /* This moves currently empty dirty blocks to prefree. Must hold seglist_lock */
859 void f2fs_dirty_to_prefree(struct f2fs_sb_info *sbi)
861 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
864 mutex_lock(&dirty_i->seglist_lock);
865 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
866 if (get_valid_blocks(sbi, segno, false))
868 if (IS_CURSEG(sbi, segno))
870 __locate_dirty_segment(sbi, segno, PRE);
871 __remove_dirty_segment(sbi, segno, DIRTY);
873 mutex_unlock(&dirty_i->seglist_lock);
876 block_t f2fs_get_unusable_blocks(struct f2fs_sb_info *sbi)
879 (overprovision_segments(sbi) - reserved_segments(sbi));
880 block_t ovp_holes = ovp_hole_segs << sbi->log_blocks_per_seg;
881 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
882 block_t holes[2] = {0, 0}; /* DATA and NODE */
884 struct seg_entry *se;
887 mutex_lock(&dirty_i->seglist_lock);
888 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
889 se = get_seg_entry(sbi, segno);
890 if (IS_NODESEG(se->type))
891 holes[NODE] += sbi->blocks_per_seg - se->valid_blocks;
893 holes[DATA] += sbi->blocks_per_seg - se->valid_blocks;
895 mutex_unlock(&dirty_i->seglist_lock);
897 unusable = holes[DATA] > holes[NODE] ? holes[DATA] : holes[NODE];
898 if (unusable > ovp_holes)
899 return unusable - ovp_holes;
903 int f2fs_disable_cp_again(struct f2fs_sb_info *sbi, block_t unusable)
906 (overprovision_segments(sbi) - reserved_segments(sbi));
907 if (unusable > F2FS_OPTION(sbi).unusable_cap)
909 if (is_sbi_flag_set(sbi, SBI_CP_DISABLED_QUICK) &&
910 dirty_segments(sbi) > ovp_hole_segs)
915 /* This is only used by SBI_CP_DISABLED */
916 static unsigned int get_free_segment(struct f2fs_sb_info *sbi)
918 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
919 unsigned int segno = 0;
921 mutex_lock(&dirty_i->seglist_lock);
922 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
923 if (get_valid_blocks(sbi, segno, false))
925 if (get_ckpt_valid_blocks(sbi, segno))
927 mutex_unlock(&dirty_i->seglist_lock);
930 mutex_unlock(&dirty_i->seglist_lock);
934 static struct discard_cmd *__create_discard_cmd(struct f2fs_sb_info *sbi,
935 struct block_device *bdev, block_t lstart,
936 block_t start, block_t len)
938 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
939 struct list_head *pend_list;
940 struct discard_cmd *dc;
942 f2fs_bug_on(sbi, !len);
944 pend_list = &dcc->pend_list[plist_idx(len)];
946 dc = f2fs_kmem_cache_alloc(discard_cmd_slab, GFP_NOFS);
947 INIT_LIST_HEAD(&dc->list);
956 init_completion(&dc->wait);
957 list_add_tail(&dc->list, pend_list);
958 spin_lock_init(&dc->lock);
960 atomic_inc(&dcc->discard_cmd_cnt);
961 dcc->undiscard_blks += len;
966 static struct discard_cmd *__attach_discard_cmd(struct f2fs_sb_info *sbi,
967 struct block_device *bdev, block_t lstart,
968 block_t start, block_t len,
969 struct rb_node *parent, struct rb_node **p,
972 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
973 struct discard_cmd *dc;
975 dc = __create_discard_cmd(sbi, bdev, lstart, start, len);
977 rb_link_node(&dc->rb_node, parent, p);
978 rb_insert_color_cached(&dc->rb_node, &dcc->root, leftmost);
983 static void __detach_discard_cmd(struct discard_cmd_control *dcc,
984 struct discard_cmd *dc)
986 if (dc->state == D_DONE)
987 atomic_sub(dc->queued, &dcc->queued_discard);
990 rb_erase_cached(&dc->rb_node, &dcc->root);
991 dcc->undiscard_blks -= dc->len;
993 kmem_cache_free(discard_cmd_slab, dc);
995 atomic_dec(&dcc->discard_cmd_cnt);
998 static void __remove_discard_cmd(struct f2fs_sb_info *sbi,
999 struct discard_cmd *dc)
1001 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1002 unsigned long flags;
1004 trace_f2fs_remove_discard(dc->bdev, dc->start, dc->len);
1006 spin_lock_irqsave(&dc->lock, flags);
1008 spin_unlock_irqrestore(&dc->lock, flags);
1011 spin_unlock_irqrestore(&dc->lock, flags);
1013 f2fs_bug_on(sbi, dc->ref);
1015 if (dc->error == -EOPNOTSUPP)
1020 "%sF2FS-fs: Issue discard(%u, %u, %u) failed, ret: %d",
1021 KERN_INFO, dc->lstart, dc->start, dc->len, dc->error);
1022 __detach_discard_cmd(dcc, dc);
1025 static void f2fs_submit_discard_endio(struct bio *bio)
1027 struct discard_cmd *dc = (struct discard_cmd *)bio->bi_private;
1028 unsigned long flags;
1030 dc->error = blk_status_to_errno(bio->bi_status);
1032 spin_lock_irqsave(&dc->lock, flags);
1034 if (!dc->bio_ref && dc->state == D_SUBMIT) {
1036 complete_all(&dc->wait);
1038 spin_unlock_irqrestore(&dc->lock, flags);
1042 static void __check_sit_bitmap(struct f2fs_sb_info *sbi,
1043 block_t start, block_t end)
1045 #ifdef CONFIG_F2FS_CHECK_FS
1046 struct seg_entry *sentry;
1048 block_t blk = start;
1049 unsigned long offset, size, max_blocks = sbi->blocks_per_seg;
1053 segno = GET_SEGNO(sbi, blk);
1054 sentry = get_seg_entry(sbi, segno);
1055 offset = GET_BLKOFF_FROM_SEG0(sbi, blk);
1057 if (end < START_BLOCK(sbi, segno + 1))
1058 size = GET_BLKOFF_FROM_SEG0(sbi, end);
1061 map = (unsigned long *)(sentry->cur_valid_map);
1062 offset = __find_rev_next_bit(map, size, offset);
1063 f2fs_bug_on(sbi, offset != size);
1064 blk = START_BLOCK(sbi, segno + 1);
1069 static void __init_discard_policy(struct f2fs_sb_info *sbi,
1070 struct discard_policy *dpolicy,
1071 int discard_type, unsigned int granularity)
1074 dpolicy->type = discard_type;
1075 dpolicy->sync = true;
1076 dpolicy->ordered = false;
1077 dpolicy->granularity = granularity;
1079 dpolicy->max_requests = DEF_MAX_DISCARD_REQUEST;
1080 dpolicy->io_aware_gran = MAX_PLIST_NUM;
1081 dpolicy->timeout = 0;
1083 if (discard_type == DPOLICY_BG) {
1084 dpolicy->min_interval = DEF_MIN_DISCARD_ISSUE_TIME;
1085 dpolicy->mid_interval = DEF_MID_DISCARD_ISSUE_TIME;
1086 dpolicy->max_interval = DEF_MAX_DISCARD_ISSUE_TIME;
1087 dpolicy->io_aware = true;
1088 dpolicy->sync = false;
1089 dpolicy->ordered = true;
1090 if (utilization(sbi) > DEF_DISCARD_URGENT_UTIL) {
1091 dpolicy->granularity = 1;
1092 dpolicy->max_interval = DEF_MIN_DISCARD_ISSUE_TIME;
1094 } else if (discard_type == DPOLICY_FORCE) {
1095 dpolicy->min_interval = DEF_MIN_DISCARD_ISSUE_TIME;
1096 dpolicy->mid_interval = DEF_MID_DISCARD_ISSUE_TIME;
1097 dpolicy->max_interval = DEF_MAX_DISCARD_ISSUE_TIME;
1098 dpolicy->io_aware = false;
1099 } else if (discard_type == DPOLICY_FSTRIM) {
1100 dpolicy->io_aware = false;
1101 } else if (discard_type == DPOLICY_UMOUNT) {
1102 dpolicy->max_requests = UINT_MAX;
1103 dpolicy->io_aware = false;
1104 /* we need to issue all to keep CP_TRIMMED_FLAG */
1105 dpolicy->granularity = 1;
1109 static void __update_discard_tree_range(struct f2fs_sb_info *sbi,
1110 struct block_device *bdev, block_t lstart,
1111 block_t start, block_t len);
1112 /* this function is copied from blkdev_issue_discard from block/blk-lib.c */
1113 static int __submit_discard_cmd(struct f2fs_sb_info *sbi,
1114 struct discard_policy *dpolicy,
1115 struct discard_cmd *dc,
1116 unsigned int *issued)
1118 struct block_device *bdev = dc->bdev;
1119 struct request_queue *q = bdev_get_queue(bdev);
1120 unsigned int max_discard_blocks =
1121 SECTOR_TO_BLOCK(q->limits.max_discard_sectors);
1122 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1123 struct list_head *wait_list = (dpolicy->type == DPOLICY_FSTRIM) ?
1124 &(dcc->fstrim_list) : &(dcc->wait_list);
1125 int flag = dpolicy->sync ? REQ_SYNC : 0;
1126 block_t lstart, start, len, total_len;
1129 if (dc->state != D_PREP)
1132 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK))
1135 trace_f2fs_issue_discard(bdev, dc->start, dc->len);
1137 lstart = dc->lstart;
1144 while (total_len && *issued < dpolicy->max_requests && !err) {
1145 struct bio *bio = NULL;
1146 unsigned long flags;
1149 if (len > max_discard_blocks) {
1150 len = max_discard_blocks;
1155 if (*issued == dpolicy->max_requests)
1160 if (time_to_inject(sbi, FAULT_DISCARD)) {
1161 f2fs_show_injection_info(FAULT_DISCARD);
1165 err = __blkdev_issue_discard(bdev,
1166 SECTOR_FROM_BLOCK(start),
1167 SECTOR_FROM_BLOCK(len),
1171 spin_lock_irqsave(&dc->lock, flags);
1172 if (dc->state == D_PARTIAL)
1173 dc->state = D_SUBMIT;
1174 spin_unlock_irqrestore(&dc->lock, flags);
1179 f2fs_bug_on(sbi, !bio);
1182 * should keep before submission to avoid D_DONE
1185 spin_lock_irqsave(&dc->lock, flags);
1187 dc->state = D_SUBMIT;
1189 dc->state = D_PARTIAL;
1191 spin_unlock_irqrestore(&dc->lock, flags);
1193 atomic_inc(&dcc->queued_discard);
1195 list_move_tail(&dc->list, wait_list);
1197 /* sanity check on discard range */
1198 __check_sit_bitmap(sbi, lstart, lstart + len);
1200 bio->bi_private = dc;
1201 bio->bi_end_io = f2fs_submit_discard_endio;
1202 bio->bi_opf |= flag;
1205 atomic_inc(&dcc->issued_discard);
1207 f2fs_update_iostat(sbi, FS_DISCARD, 1);
1216 __update_discard_tree_range(sbi, bdev, lstart, start, len);
1220 static struct discard_cmd *__insert_discard_tree(struct f2fs_sb_info *sbi,
1221 struct block_device *bdev, block_t lstart,
1222 block_t start, block_t len,
1223 struct rb_node **insert_p,
1224 struct rb_node *insert_parent)
1226 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1228 struct rb_node *parent = NULL;
1229 struct discard_cmd *dc = NULL;
1230 bool leftmost = true;
1232 if (insert_p && insert_parent) {
1233 parent = insert_parent;
1238 p = f2fs_lookup_rb_tree_for_insert(sbi, &dcc->root, &parent,
1241 dc = __attach_discard_cmd(sbi, bdev, lstart, start, len, parent,
1249 static void __relocate_discard_cmd(struct discard_cmd_control *dcc,
1250 struct discard_cmd *dc)
1252 list_move_tail(&dc->list, &dcc->pend_list[plist_idx(dc->len)]);
1255 static void __punch_discard_cmd(struct f2fs_sb_info *sbi,
1256 struct discard_cmd *dc, block_t blkaddr)
1258 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1259 struct discard_info di = dc->di;
1260 bool modified = false;
1262 if (dc->state == D_DONE || dc->len == 1) {
1263 __remove_discard_cmd(sbi, dc);
1267 dcc->undiscard_blks -= di.len;
1269 if (blkaddr > di.lstart) {
1270 dc->len = blkaddr - dc->lstart;
1271 dcc->undiscard_blks += dc->len;
1272 __relocate_discard_cmd(dcc, dc);
1276 if (blkaddr < di.lstart + di.len - 1) {
1278 __insert_discard_tree(sbi, dc->bdev, blkaddr + 1,
1279 di.start + blkaddr + 1 - di.lstart,
1280 di.lstart + di.len - 1 - blkaddr,
1286 dcc->undiscard_blks += dc->len;
1287 __relocate_discard_cmd(dcc, dc);
1292 static void __update_discard_tree_range(struct f2fs_sb_info *sbi,
1293 struct block_device *bdev, block_t lstart,
1294 block_t start, block_t len)
1296 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1297 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1298 struct discard_cmd *dc;
1299 struct discard_info di = {0};
1300 struct rb_node **insert_p = NULL, *insert_parent = NULL;
1301 struct request_queue *q = bdev_get_queue(bdev);
1302 unsigned int max_discard_blocks =
1303 SECTOR_TO_BLOCK(q->limits.max_discard_sectors);
1304 block_t end = lstart + len;
1306 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
1308 (struct rb_entry **)&prev_dc,
1309 (struct rb_entry **)&next_dc,
1310 &insert_p, &insert_parent, true, NULL);
1316 di.len = next_dc ? next_dc->lstart - lstart : len;
1317 di.len = min(di.len, len);
1322 struct rb_node *node;
1323 bool merged = false;
1324 struct discard_cmd *tdc = NULL;
1327 di.lstart = prev_dc->lstart + prev_dc->len;
1328 if (di.lstart < lstart)
1330 if (di.lstart >= end)
1333 if (!next_dc || next_dc->lstart > end)
1334 di.len = end - di.lstart;
1336 di.len = next_dc->lstart - di.lstart;
1337 di.start = start + di.lstart - lstart;
1343 if (prev_dc && prev_dc->state == D_PREP &&
1344 prev_dc->bdev == bdev &&
1345 __is_discard_back_mergeable(&di, &prev_dc->di,
1346 max_discard_blocks)) {
1347 prev_dc->di.len += di.len;
1348 dcc->undiscard_blks += di.len;
1349 __relocate_discard_cmd(dcc, prev_dc);
1355 if (next_dc && next_dc->state == D_PREP &&
1356 next_dc->bdev == bdev &&
1357 __is_discard_front_mergeable(&di, &next_dc->di,
1358 max_discard_blocks)) {
1359 next_dc->di.lstart = di.lstart;
1360 next_dc->di.len += di.len;
1361 next_dc->di.start = di.start;
1362 dcc->undiscard_blks += di.len;
1363 __relocate_discard_cmd(dcc, next_dc);
1365 __remove_discard_cmd(sbi, tdc);
1370 __insert_discard_tree(sbi, bdev, di.lstart, di.start,
1371 di.len, NULL, NULL);
1378 node = rb_next(&prev_dc->rb_node);
1379 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1383 static int __queue_discard_cmd(struct f2fs_sb_info *sbi,
1384 struct block_device *bdev, block_t blkstart, block_t blklen)
1386 block_t lblkstart = blkstart;
1388 if (!f2fs_bdev_support_discard(bdev))
1391 trace_f2fs_queue_discard(bdev, blkstart, blklen);
1393 if (f2fs_is_multi_device(sbi)) {
1394 int devi = f2fs_target_device_index(sbi, blkstart);
1396 blkstart -= FDEV(devi).start_blk;
1398 mutex_lock(&SM_I(sbi)->dcc_info->cmd_lock);
1399 __update_discard_tree_range(sbi, bdev, lblkstart, blkstart, blklen);
1400 mutex_unlock(&SM_I(sbi)->dcc_info->cmd_lock);
1404 static unsigned int __issue_discard_cmd_orderly(struct f2fs_sb_info *sbi,
1405 struct discard_policy *dpolicy)
1407 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1408 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1409 struct rb_node **insert_p = NULL, *insert_parent = NULL;
1410 struct discard_cmd *dc;
1411 struct blk_plug plug;
1412 unsigned int pos = dcc->next_pos;
1413 unsigned int issued = 0;
1414 bool io_interrupted = false;
1416 mutex_lock(&dcc->cmd_lock);
1417 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
1419 (struct rb_entry **)&prev_dc,
1420 (struct rb_entry **)&next_dc,
1421 &insert_p, &insert_parent, true, NULL);
1425 blk_start_plug(&plug);
1428 struct rb_node *node;
1431 if (dc->state != D_PREP)
1434 if (dpolicy->io_aware && !is_idle(sbi, DISCARD_TIME)) {
1435 io_interrupted = true;
1439 dcc->next_pos = dc->lstart + dc->len;
1440 err = __submit_discard_cmd(sbi, dpolicy, dc, &issued);
1442 if (issued >= dpolicy->max_requests)
1445 node = rb_next(&dc->rb_node);
1447 __remove_discard_cmd(sbi, dc);
1448 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1451 blk_finish_plug(&plug);
1456 mutex_unlock(&dcc->cmd_lock);
1458 if (!issued && io_interrupted)
1464 static int __issue_discard_cmd(struct f2fs_sb_info *sbi,
1465 struct discard_policy *dpolicy)
1467 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1468 struct list_head *pend_list;
1469 struct discard_cmd *dc, *tmp;
1470 struct blk_plug plug;
1472 bool io_interrupted = false;
1474 if (dpolicy->timeout != 0)
1475 f2fs_update_time(sbi, dpolicy->timeout);
1477 for (i = MAX_PLIST_NUM - 1; i >= 0; i--) {
1478 if (dpolicy->timeout != 0 &&
1479 f2fs_time_over(sbi, dpolicy->timeout))
1482 if (i + 1 < dpolicy->granularity)
1485 if (i < DEFAULT_DISCARD_GRANULARITY && dpolicy->ordered)
1486 return __issue_discard_cmd_orderly(sbi, dpolicy);
1488 pend_list = &dcc->pend_list[i];
1490 mutex_lock(&dcc->cmd_lock);
1491 if (list_empty(pend_list))
1493 if (unlikely(dcc->rbtree_check))
1494 f2fs_bug_on(sbi, !f2fs_check_rb_tree_consistence(sbi,
1496 blk_start_plug(&plug);
1497 list_for_each_entry_safe(dc, tmp, pend_list, list) {
1498 f2fs_bug_on(sbi, dc->state != D_PREP);
1500 if (dpolicy->timeout != 0 &&
1501 f2fs_time_over(sbi, dpolicy->timeout))
1504 if (dpolicy->io_aware && i < dpolicy->io_aware_gran &&
1505 !is_idle(sbi, DISCARD_TIME)) {
1506 io_interrupted = true;
1510 __submit_discard_cmd(sbi, dpolicy, dc, &issued);
1512 if (issued >= dpolicy->max_requests)
1515 blk_finish_plug(&plug);
1517 mutex_unlock(&dcc->cmd_lock);
1519 if (issued >= dpolicy->max_requests || io_interrupted)
1523 if (!issued && io_interrupted)
1529 static bool __drop_discard_cmd(struct f2fs_sb_info *sbi)
1531 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1532 struct list_head *pend_list;
1533 struct discard_cmd *dc, *tmp;
1535 bool dropped = false;
1537 mutex_lock(&dcc->cmd_lock);
1538 for (i = MAX_PLIST_NUM - 1; i >= 0; i--) {
1539 pend_list = &dcc->pend_list[i];
1540 list_for_each_entry_safe(dc, tmp, pend_list, list) {
1541 f2fs_bug_on(sbi, dc->state != D_PREP);
1542 __remove_discard_cmd(sbi, dc);
1546 mutex_unlock(&dcc->cmd_lock);
1551 void f2fs_drop_discard_cmd(struct f2fs_sb_info *sbi)
1553 __drop_discard_cmd(sbi);
1556 static unsigned int __wait_one_discard_bio(struct f2fs_sb_info *sbi,
1557 struct discard_cmd *dc)
1559 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1560 unsigned int len = 0;
1562 wait_for_completion_io(&dc->wait);
1563 mutex_lock(&dcc->cmd_lock);
1564 f2fs_bug_on(sbi, dc->state != D_DONE);
1569 __remove_discard_cmd(sbi, dc);
1571 mutex_unlock(&dcc->cmd_lock);
1576 static unsigned int __wait_discard_cmd_range(struct f2fs_sb_info *sbi,
1577 struct discard_policy *dpolicy,
1578 block_t start, block_t end)
1580 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1581 struct list_head *wait_list = (dpolicy->type == DPOLICY_FSTRIM) ?
1582 &(dcc->fstrim_list) : &(dcc->wait_list);
1583 struct discard_cmd *dc, *tmp;
1585 unsigned int trimmed = 0;
1590 mutex_lock(&dcc->cmd_lock);
1591 list_for_each_entry_safe(dc, tmp, wait_list, list) {
1592 if (dc->lstart + dc->len <= start || end <= dc->lstart)
1594 if (dc->len < dpolicy->granularity)
1596 if (dc->state == D_DONE && !dc->ref) {
1597 wait_for_completion_io(&dc->wait);
1600 __remove_discard_cmd(sbi, dc);
1607 mutex_unlock(&dcc->cmd_lock);
1610 trimmed += __wait_one_discard_bio(sbi, dc);
1617 static unsigned int __wait_all_discard_cmd(struct f2fs_sb_info *sbi,
1618 struct discard_policy *dpolicy)
1620 struct discard_policy dp;
1621 unsigned int discard_blks;
1624 return __wait_discard_cmd_range(sbi, dpolicy, 0, UINT_MAX);
1627 __init_discard_policy(sbi, &dp, DPOLICY_FSTRIM, 1);
1628 discard_blks = __wait_discard_cmd_range(sbi, &dp, 0, UINT_MAX);
1629 __init_discard_policy(sbi, &dp, DPOLICY_UMOUNT, 1);
1630 discard_blks += __wait_discard_cmd_range(sbi, &dp, 0, UINT_MAX);
1632 return discard_blks;
1635 /* This should be covered by global mutex, &sit_i->sentry_lock */
1636 static void f2fs_wait_discard_bio(struct f2fs_sb_info *sbi, block_t blkaddr)
1638 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1639 struct discard_cmd *dc;
1640 bool need_wait = false;
1642 mutex_lock(&dcc->cmd_lock);
1643 dc = (struct discard_cmd *)f2fs_lookup_rb_tree(&dcc->root,
1646 if (dc->state == D_PREP) {
1647 __punch_discard_cmd(sbi, dc, blkaddr);
1653 mutex_unlock(&dcc->cmd_lock);
1656 __wait_one_discard_bio(sbi, dc);
1659 void f2fs_stop_discard_thread(struct f2fs_sb_info *sbi)
1661 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1663 if (dcc && dcc->f2fs_issue_discard) {
1664 struct task_struct *discard_thread = dcc->f2fs_issue_discard;
1666 dcc->f2fs_issue_discard = NULL;
1667 kthread_stop(discard_thread);
1671 /* This comes from f2fs_put_super */
1672 bool f2fs_issue_discard_timeout(struct f2fs_sb_info *sbi)
1674 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1675 struct discard_policy dpolicy;
1678 __init_discard_policy(sbi, &dpolicy, DPOLICY_UMOUNT,
1679 dcc->discard_granularity);
1680 dpolicy.timeout = UMOUNT_DISCARD_TIMEOUT;
1681 __issue_discard_cmd(sbi, &dpolicy);
1682 dropped = __drop_discard_cmd(sbi);
1684 /* just to make sure there is no pending discard commands */
1685 __wait_all_discard_cmd(sbi, NULL);
1687 f2fs_bug_on(sbi, atomic_read(&dcc->discard_cmd_cnt));
1691 static int issue_discard_thread(void *data)
1693 struct f2fs_sb_info *sbi = data;
1694 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1695 wait_queue_head_t *q = &dcc->discard_wait_queue;
1696 struct discard_policy dpolicy;
1697 unsigned int wait_ms = DEF_MIN_DISCARD_ISSUE_TIME;
1703 __init_discard_policy(sbi, &dpolicy, DPOLICY_BG,
1704 dcc->discard_granularity);
1706 wait_event_interruptible_timeout(*q,
1707 kthread_should_stop() || freezing(current) ||
1709 msecs_to_jiffies(wait_ms));
1711 if (dcc->discard_wake)
1712 dcc->discard_wake = 0;
1714 /* clean up pending candidates before going to sleep */
1715 if (atomic_read(&dcc->queued_discard))
1716 __wait_all_discard_cmd(sbi, NULL);
1718 if (try_to_freeze())
1720 if (f2fs_readonly(sbi->sb))
1722 if (kthread_should_stop())
1724 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
1725 wait_ms = dpolicy.max_interval;
1729 if (sbi->gc_mode == GC_URGENT)
1730 __init_discard_policy(sbi, &dpolicy, DPOLICY_FORCE, 1);
1732 sb_start_intwrite(sbi->sb);
1734 issued = __issue_discard_cmd(sbi, &dpolicy);
1736 __wait_all_discard_cmd(sbi, &dpolicy);
1737 wait_ms = dpolicy.min_interval;
1738 } else if (issued == -1){
1739 wait_ms = f2fs_time_to_wait(sbi, DISCARD_TIME);
1741 wait_ms = dpolicy.mid_interval;
1743 wait_ms = dpolicy.max_interval;
1746 sb_end_intwrite(sbi->sb);
1748 } while (!kthread_should_stop());
1752 #ifdef CONFIG_BLK_DEV_ZONED
1753 static int __f2fs_issue_discard_zone(struct f2fs_sb_info *sbi,
1754 struct block_device *bdev, block_t blkstart, block_t blklen)
1756 sector_t sector, nr_sects;
1757 block_t lblkstart = blkstart;
1760 if (f2fs_is_multi_device(sbi)) {
1761 devi = f2fs_target_device_index(sbi, blkstart);
1762 if (blkstart < FDEV(devi).start_blk ||
1763 blkstart > FDEV(devi).end_blk) {
1764 f2fs_err(sbi, "Invalid block %x", blkstart);
1767 blkstart -= FDEV(devi).start_blk;
1770 /* For sequential zones, reset the zone write pointer */
1771 if (f2fs_blkz_is_seq(sbi, devi, blkstart)) {
1772 sector = SECTOR_FROM_BLOCK(blkstart);
1773 nr_sects = SECTOR_FROM_BLOCK(blklen);
1775 if (sector & (bdev_zone_sectors(bdev) - 1) ||
1776 nr_sects != bdev_zone_sectors(bdev)) {
1777 f2fs_err(sbi, "(%d) %s: Unaligned zone reset attempted (block %x + %x)",
1778 devi, sbi->s_ndevs ? FDEV(devi).path : "",
1782 trace_f2fs_issue_reset_zone(bdev, blkstart);
1783 return blkdev_reset_zones(bdev, sector, nr_sects, GFP_NOFS);
1786 /* For conventional zones, use regular discard if supported */
1787 return __queue_discard_cmd(sbi, bdev, lblkstart, blklen);
1791 static int __issue_discard_async(struct f2fs_sb_info *sbi,
1792 struct block_device *bdev, block_t blkstart, block_t blklen)
1794 #ifdef CONFIG_BLK_DEV_ZONED
1795 if (f2fs_sb_has_blkzoned(sbi) && bdev_is_zoned(bdev))
1796 return __f2fs_issue_discard_zone(sbi, bdev, blkstart, blklen);
1798 return __queue_discard_cmd(sbi, bdev, blkstart, blklen);
1801 static int f2fs_issue_discard(struct f2fs_sb_info *sbi,
1802 block_t blkstart, block_t blklen)
1804 sector_t start = blkstart, len = 0;
1805 struct block_device *bdev;
1806 struct seg_entry *se;
1807 unsigned int offset;
1811 bdev = f2fs_target_device(sbi, blkstart, NULL);
1813 for (i = blkstart; i < blkstart + blklen; i++, len++) {
1815 struct block_device *bdev2 =
1816 f2fs_target_device(sbi, i, NULL);
1818 if (bdev2 != bdev) {
1819 err = __issue_discard_async(sbi, bdev,
1829 se = get_seg_entry(sbi, GET_SEGNO(sbi, i));
1830 offset = GET_BLKOFF_FROM_SEG0(sbi, i);
1832 if (!f2fs_test_and_set_bit(offset, se->discard_map))
1833 sbi->discard_blks--;
1837 err = __issue_discard_async(sbi, bdev, start, len);
1841 static bool add_discard_addrs(struct f2fs_sb_info *sbi, struct cp_control *cpc,
1844 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
1845 int max_blocks = sbi->blocks_per_seg;
1846 struct seg_entry *se = get_seg_entry(sbi, cpc->trim_start);
1847 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
1848 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
1849 unsigned long *discard_map = (unsigned long *)se->discard_map;
1850 unsigned long *dmap = SIT_I(sbi)->tmp_map;
1851 unsigned int start = 0, end = -1;
1852 bool force = (cpc->reason & CP_DISCARD);
1853 struct discard_entry *de = NULL;
1854 struct list_head *head = &SM_I(sbi)->dcc_info->entry_list;
1857 if (se->valid_blocks == max_blocks || !f2fs_hw_support_discard(sbi))
1861 if (!f2fs_realtime_discard_enable(sbi) || !se->valid_blocks ||
1862 SM_I(sbi)->dcc_info->nr_discards >=
1863 SM_I(sbi)->dcc_info->max_discards)
1867 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
1868 for (i = 0; i < entries; i++)
1869 dmap[i] = force ? ~ckpt_map[i] & ~discard_map[i] :
1870 (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i];
1872 while (force || SM_I(sbi)->dcc_info->nr_discards <=
1873 SM_I(sbi)->dcc_info->max_discards) {
1874 start = __find_rev_next_bit(dmap, max_blocks, end + 1);
1875 if (start >= max_blocks)
1878 end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1);
1879 if (force && start && end != max_blocks
1880 && (end - start) < cpc->trim_minlen)
1887 de = f2fs_kmem_cache_alloc(discard_entry_slab,
1889 de->start_blkaddr = START_BLOCK(sbi, cpc->trim_start);
1890 list_add_tail(&de->list, head);
1893 for (i = start; i < end; i++)
1894 __set_bit_le(i, (void *)de->discard_map);
1896 SM_I(sbi)->dcc_info->nr_discards += end - start;
1901 static void release_discard_addr(struct discard_entry *entry)
1903 list_del(&entry->list);
1904 kmem_cache_free(discard_entry_slab, entry);
1907 void f2fs_release_discard_addrs(struct f2fs_sb_info *sbi)
1909 struct list_head *head = &(SM_I(sbi)->dcc_info->entry_list);
1910 struct discard_entry *entry, *this;
1913 list_for_each_entry_safe(entry, this, head, list)
1914 release_discard_addr(entry);
1918 * Should call f2fs_clear_prefree_segments after checkpoint is done.
1920 static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi)
1922 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1925 mutex_lock(&dirty_i->seglist_lock);
1926 for_each_set_bit(segno, dirty_i->dirty_segmap[PRE], MAIN_SEGS(sbi))
1927 __set_test_and_free(sbi, segno);
1928 mutex_unlock(&dirty_i->seglist_lock);
1931 void f2fs_clear_prefree_segments(struct f2fs_sb_info *sbi,
1932 struct cp_control *cpc)
1934 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1935 struct list_head *head = &dcc->entry_list;
1936 struct discard_entry *entry, *this;
1937 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1938 unsigned long *prefree_map = dirty_i->dirty_segmap[PRE];
1939 unsigned int start = 0, end = -1;
1940 unsigned int secno, start_segno;
1941 bool force = (cpc->reason & CP_DISCARD);
1942 bool need_align = test_opt(sbi, LFS) && __is_large_section(sbi);
1944 mutex_lock(&dirty_i->seglist_lock);
1949 if (need_align && end != -1)
1951 start = find_next_bit(prefree_map, MAIN_SEGS(sbi), end + 1);
1952 if (start >= MAIN_SEGS(sbi))
1954 end = find_next_zero_bit(prefree_map, MAIN_SEGS(sbi),
1958 start = rounddown(start, sbi->segs_per_sec);
1959 end = roundup(end, sbi->segs_per_sec);
1962 for (i = start; i < end; i++) {
1963 if (test_and_clear_bit(i, prefree_map))
1964 dirty_i->nr_dirty[PRE]--;
1967 if (!f2fs_realtime_discard_enable(sbi))
1970 if (force && start >= cpc->trim_start &&
1971 (end - 1) <= cpc->trim_end)
1974 if (!test_opt(sbi, LFS) || !__is_large_section(sbi)) {
1975 f2fs_issue_discard(sbi, START_BLOCK(sbi, start),
1976 (end - start) << sbi->log_blocks_per_seg);
1980 secno = GET_SEC_FROM_SEG(sbi, start);
1981 start_segno = GET_SEG_FROM_SEC(sbi, secno);
1982 if (!IS_CURSEC(sbi, secno) &&
1983 !get_valid_blocks(sbi, start, true))
1984 f2fs_issue_discard(sbi, START_BLOCK(sbi, start_segno),
1985 sbi->segs_per_sec << sbi->log_blocks_per_seg);
1987 start = start_segno + sbi->segs_per_sec;
1993 mutex_unlock(&dirty_i->seglist_lock);
1995 /* send small discards */
1996 list_for_each_entry_safe(entry, this, head, list) {
1997 unsigned int cur_pos = 0, next_pos, len, total_len = 0;
1998 bool is_valid = test_bit_le(0, entry->discard_map);
2002 next_pos = find_next_zero_bit_le(entry->discard_map,
2003 sbi->blocks_per_seg, cur_pos);
2004 len = next_pos - cur_pos;
2006 if (f2fs_sb_has_blkzoned(sbi) ||
2007 (force && len < cpc->trim_minlen))
2010 f2fs_issue_discard(sbi, entry->start_blkaddr + cur_pos,
2014 next_pos = find_next_bit_le(entry->discard_map,
2015 sbi->blocks_per_seg, cur_pos);
2019 is_valid = !is_valid;
2021 if (cur_pos < sbi->blocks_per_seg)
2024 release_discard_addr(entry);
2025 dcc->nr_discards -= total_len;
2028 wake_up_discard_thread(sbi, false);
2031 static int create_discard_cmd_control(struct f2fs_sb_info *sbi)
2033 dev_t dev = sbi->sb->s_bdev->bd_dev;
2034 struct discard_cmd_control *dcc;
2037 if (SM_I(sbi)->dcc_info) {
2038 dcc = SM_I(sbi)->dcc_info;
2042 dcc = f2fs_kzalloc(sbi, sizeof(struct discard_cmd_control), GFP_KERNEL);
2046 dcc->discard_granularity = DEFAULT_DISCARD_GRANULARITY;
2047 INIT_LIST_HEAD(&dcc->entry_list);
2048 for (i = 0; i < MAX_PLIST_NUM; i++)
2049 INIT_LIST_HEAD(&dcc->pend_list[i]);
2050 INIT_LIST_HEAD(&dcc->wait_list);
2051 INIT_LIST_HEAD(&dcc->fstrim_list);
2052 mutex_init(&dcc->cmd_lock);
2053 atomic_set(&dcc->issued_discard, 0);
2054 atomic_set(&dcc->queued_discard, 0);
2055 atomic_set(&dcc->discard_cmd_cnt, 0);
2056 dcc->nr_discards = 0;
2057 dcc->max_discards = MAIN_SEGS(sbi) << sbi->log_blocks_per_seg;
2058 dcc->undiscard_blks = 0;
2060 dcc->root = RB_ROOT_CACHED;
2061 dcc->rbtree_check = false;
2063 init_waitqueue_head(&dcc->discard_wait_queue);
2064 SM_I(sbi)->dcc_info = dcc;
2066 dcc->f2fs_issue_discard = kthread_run(issue_discard_thread, sbi,
2067 "f2fs_discard-%u:%u", MAJOR(dev), MINOR(dev));
2068 if (IS_ERR(dcc->f2fs_issue_discard)) {
2069 err = PTR_ERR(dcc->f2fs_issue_discard);
2071 SM_I(sbi)->dcc_info = NULL;
2078 static void destroy_discard_cmd_control(struct f2fs_sb_info *sbi)
2080 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
2085 f2fs_stop_discard_thread(sbi);
2088 * Recovery can cache discard commands, so in error path of
2089 * fill_super(), it needs to give a chance to handle them.
2091 if (unlikely(atomic_read(&dcc->discard_cmd_cnt)))
2092 f2fs_issue_discard_timeout(sbi);
2095 SM_I(sbi)->dcc_info = NULL;
2098 static bool __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno)
2100 struct sit_info *sit_i = SIT_I(sbi);
2102 if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap)) {
2103 sit_i->dirty_sentries++;
2110 static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type,
2111 unsigned int segno, int modified)
2113 struct seg_entry *se = get_seg_entry(sbi, segno);
2116 __mark_sit_entry_dirty(sbi, segno);
2119 static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del)
2121 struct seg_entry *se;
2122 unsigned int segno, offset;
2123 long int new_vblocks;
2125 #ifdef CONFIG_F2FS_CHECK_FS
2129 segno = GET_SEGNO(sbi, blkaddr);
2131 se = get_seg_entry(sbi, segno);
2132 new_vblocks = se->valid_blocks + del;
2133 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
2135 f2fs_bug_on(sbi, (new_vblocks >> (sizeof(unsigned short) << 3) ||
2136 (new_vblocks > sbi->blocks_per_seg)));
2138 se->valid_blocks = new_vblocks;
2139 se->mtime = get_mtime(sbi, false);
2140 if (se->mtime > SIT_I(sbi)->max_mtime)
2141 SIT_I(sbi)->max_mtime = se->mtime;
2143 /* Update valid block bitmap */
2145 exist = f2fs_test_and_set_bit(offset, se->cur_valid_map);
2146 #ifdef CONFIG_F2FS_CHECK_FS
2147 mir_exist = f2fs_test_and_set_bit(offset,
2148 se->cur_valid_map_mir);
2149 if (unlikely(exist != mir_exist)) {
2150 f2fs_err(sbi, "Inconsistent error when setting bitmap, blk:%u, old bit:%d",
2152 f2fs_bug_on(sbi, 1);
2155 if (unlikely(exist)) {
2156 f2fs_err(sbi, "Bitmap was wrongly set, blk:%u",
2158 f2fs_bug_on(sbi, 1);
2163 if (!f2fs_test_and_set_bit(offset, se->discard_map))
2164 sbi->discard_blks--;
2167 * SSR should never reuse block which is checkpointed
2168 * or newly invalidated.
2170 if (!is_sbi_flag_set(sbi, SBI_CP_DISABLED)) {
2171 if (!f2fs_test_and_set_bit(offset, se->ckpt_valid_map))
2172 se->ckpt_valid_blocks++;
2175 exist = f2fs_test_and_clear_bit(offset, se->cur_valid_map);
2176 #ifdef CONFIG_F2FS_CHECK_FS
2177 mir_exist = f2fs_test_and_clear_bit(offset,
2178 se->cur_valid_map_mir);
2179 if (unlikely(exist != mir_exist)) {
2180 f2fs_err(sbi, "Inconsistent error when clearing bitmap, blk:%u, old bit:%d",
2182 f2fs_bug_on(sbi, 1);
2185 if (unlikely(!exist)) {
2186 f2fs_err(sbi, "Bitmap was wrongly cleared, blk:%u",
2188 f2fs_bug_on(sbi, 1);
2191 } else if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED))) {
2193 * If checkpoints are off, we must not reuse data that
2194 * was used in the previous checkpoint. If it was used
2195 * before, we must track that to know how much space we
2198 if (f2fs_test_bit(offset, se->ckpt_valid_map)) {
2199 spin_lock(&sbi->stat_lock);
2200 sbi->unusable_block_count++;
2201 spin_unlock(&sbi->stat_lock);
2205 if (f2fs_test_and_clear_bit(offset, se->discard_map))
2206 sbi->discard_blks++;
2208 if (!f2fs_test_bit(offset, se->ckpt_valid_map))
2209 se->ckpt_valid_blocks += del;
2211 __mark_sit_entry_dirty(sbi, segno);
2213 /* update total number of valid blocks to be written in ckpt area */
2214 SIT_I(sbi)->written_valid_blocks += del;
2216 if (__is_large_section(sbi))
2217 get_sec_entry(sbi, segno)->valid_blocks += del;
2220 void f2fs_invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr)
2222 unsigned int segno = GET_SEGNO(sbi, addr);
2223 struct sit_info *sit_i = SIT_I(sbi);
2225 f2fs_bug_on(sbi, addr == NULL_ADDR);
2226 if (addr == NEW_ADDR)
2229 invalidate_mapping_pages(META_MAPPING(sbi), addr, addr);
2231 /* add it into sit main buffer */
2232 down_write(&sit_i->sentry_lock);
2234 update_sit_entry(sbi, addr, -1);
2236 /* add it into dirty seglist */
2237 locate_dirty_segment(sbi, segno);
2239 up_write(&sit_i->sentry_lock);
2242 bool f2fs_is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr)
2244 struct sit_info *sit_i = SIT_I(sbi);
2245 unsigned int segno, offset;
2246 struct seg_entry *se;
2249 if (!__is_valid_data_blkaddr(blkaddr))
2252 down_read(&sit_i->sentry_lock);
2254 segno = GET_SEGNO(sbi, blkaddr);
2255 se = get_seg_entry(sbi, segno);
2256 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
2258 if (f2fs_test_bit(offset, se->ckpt_valid_map))
2261 up_read(&sit_i->sentry_lock);
2267 * This function should be resided under the curseg_mutex lock
2269 static void __add_sum_entry(struct f2fs_sb_info *sbi, int type,
2270 struct f2fs_summary *sum)
2272 struct curseg_info *curseg = CURSEG_I(sbi, type);
2273 void *addr = curseg->sum_blk;
2274 addr += curseg->next_blkoff * sizeof(struct f2fs_summary);
2275 memcpy(addr, sum, sizeof(struct f2fs_summary));
2279 * Calculate the number of current summary pages for writing
2281 int f2fs_npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra)
2283 int valid_sum_count = 0;
2286 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
2287 if (sbi->ckpt->alloc_type[i] == SSR)
2288 valid_sum_count += sbi->blocks_per_seg;
2291 valid_sum_count += le16_to_cpu(
2292 F2FS_CKPT(sbi)->cur_data_blkoff[i]);
2294 valid_sum_count += curseg_blkoff(sbi, i);
2298 sum_in_page = (PAGE_SIZE - 2 * SUM_JOURNAL_SIZE -
2299 SUM_FOOTER_SIZE) / SUMMARY_SIZE;
2300 if (valid_sum_count <= sum_in_page)
2302 else if ((valid_sum_count - sum_in_page) <=
2303 (PAGE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE)
2309 * Caller should put this summary page
2311 struct page *f2fs_get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno)
2313 return f2fs_get_meta_page_nofail(sbi, GET_SUM_BLOCK(sbi, segno));
2316 void f2fs_update_meta_page(struct f2fs_sb_info *sbi,
2317 void *src, block_t blk_addr)
2319 struct page *page = f2fs_grab_meta_page(sbi, blk_addr);
2321 memcpy(page_address(page), src, PAGE_SIZE);
2322 set_page_dirty(page);
2323 f2fs_put_page(page, 1);
2326 static void write_sum_page(struct f2fs_sb_info *sbi,
2327 struct f2fs_summary_block *sum_blk, block_t blk_addr)
2329 f2fs_update_meta_page(sbi, (void *)sum_blk, blk_addr);
2332 static void write_current_sum_page(struct f2fs_sb_info *sbi,
2333 int type, block_t blk_addr)
2335 struct curseg_info *curseg = CURSEG_I(sbi, type);
2336 struct page *page = f2fs_grab_meta_page(sbi, blk_addr);
2337 struct f2fs_summary_block *src = curseg->sum_blk;
2338 struct f2fs_summary_block *dst;
2340 dst = (struct f2fs_summary_block *)page_address(page);
2341 memset(dst, 0, PAGE_SIZE);
2343 mutex_lock(&curseg->curseg_mutex);
2345 down_read(&curseg->journal_rwsem);
2346 memcpy(&dst->journal, curseg->journal, SUM_JOURNAL_SIZE);
2347 up_read(&curseg->journal_rwsem);
2349 memcpy(dst->entries, src->entries, SUM_ENTRY_SIZE);
2350 memcpy(&dst->footer, &src->footer, SUM_FOOTER_SIZE);
2352 mutex_unlock(&curseg->curseg_mutex);
2354 set_page_dirty(page);
2355 f2fs_put_page(page, 1);
2358 static int is_next_segment_free(struct f2fs_sb_info *sbi, int type)
2360 struct curseg_info *curseg = CURSEG_I(sbi, type);
2361 unsigned int segno = curseg->segno + 1;
2362 struct free_segmap_info *free_i = FREE_I(sbi);
2364 if (segno < MAIN_SEGS(sbi) && segno % sbi->segs_per_sec)
2365 return !test_bit(segno, free_i->free_segmap);
2370 * Find a new segment from the free segments bitmap to right order
2371 * This function should be returned with success, otherwise BUG
2373 static void get_new_segment(struct f2fs_sb_info *sbi,
2374 unsigned int *newseg, bool new_sec, int dir)
2376 struct free_segmap_info *free_i = FREE_I(sbi);
2377 unsigned int segno, secno, zoneno;
2378 unsigned int total_zones = MAIN_SECS(sbi) / sbi->secs_per_zone;
2379 unsigned int hint = GET_SEC_FROM_SEG(sbi, *newseg);
2380 unsigned int old_zoneno = GET_ZONE_FROM_SEG(sbi, *newseg);
2381 unsigned int left_start = hint;
2386 spin_lock(&free_i->segmap_lock);
2388 if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) {
2389 segno = find_next_zero_bit(free_i->free_segmap,
2390 GET_SEG_FROM_SEC(sbi, hint + 1), *newseg + 1);
2391 if (segno < GET_SEG_FROM_SEC(sbi, hint + 1))
2395 secno = find_next_zero_bit(free_i->free_secmap, MAIN_SECS(sbi), hint);
2396 if (secno >= MAIN_SECS(sbi)) {
2397 if (dir == ALLOC_RIGHT) {
2398 secno = find_next_zero_bit(free_i->free_secmap,
2400 f2fs_bug_on(sbi, secno >= MAIN_SECS(sbi));
2403 left_start = hint - 1;
2409 while (test_bit(left_start, free_i->free_secmap)) {
2410 if (left_start > 0) {
2414 left_start = find_next_zero_bit(free_i->free_secmap,
2416 f2fs_bug_on(sbi, left_start >= MAIN_SECS(sbi));
2421 segno = GET_SEG_FROM_SEC(sbi, secno);
2422 zoneno = GET_ZONE_FROM_SEC(sbi, secno);
2424 /* give up on finding another zone */
2427 if (sbi->secs_per_zone == 1)
2429 if (zoneno == old_zoneno)
2431 if (dir == ALLOC_LEFT) {
2432 if (!go_left && zoneno + 1 >= total_zones)
2434 if (go_left && zoneno == 0)
2437 for (i = 0; i < NR_CURSEG_TYPE; i++)
2438 if (CURSEG_I(sbi, i)->zone == zoneno)
2441 if (i < NR_CURSEG_TYPE) {
2442 /* zone is in user, try another */
2444 hint = zoneno * sbi->secs_per_zone - 1;
2445 else if (zoneno + 1 >= total_zones)
2448 hint = (zoneno + 1) * sbi->secs_per_zone;
2450 goto find_other_zone;
2453 /* set it as dirty segment in free segmap */
2454 f2fs_bug_on(sbi, test_bit(segno, free_i->free_segmap));
2455 __set_inuse(sbi, segno);
2457 spin_unlock(&free_i->segmap_lock);
2460 static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified)
2462 struct curseg_info *curseg = CURSEG_I(sbi, type);
2463 struct summary_footer *sum_footer;
2465 curseg->segno = curseg->next_segno;
2466 curseg->zone = GET_ZONE_FROM_SEG(sbi, curseg->segno);
2467 curseg->next_blkoff = 0;
2468 curseg->next_segno = NULL_SEGNO;
2470 sum_footer = &(curseg->sum_blk->footer);
2471 memset(sum_footer, 0, sizeof(struct summary_footer));
2472 if (IS_DATASEG(type))
2473 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA);
2474 if (IS_NODESEG(type))
2475 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE);
2476 __set_sit_entry_type(sbi, type, curseg->segno, modified);
2479 static unsigned int __get_next_segno(struct f2fs_sb_info *sbi, int type)
2481 /* if segs_per_sec is large than 1, we need to keep original policy. */
2482 if (__is_large_section(sbi))
2483 return CURSEG_I(sbi, type)->segno;
2485 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
2488 if (test_opt(sbi, NOHEAP) &&
2489 (type == CURSEG_HOT_DATA || IS_NODESEG(type)))
2492 if (SIT_I(sbi)->last_victim[ALLOC_NEXT])
2493 return SIT_I(sbi)->last_victim[ALLOC_NEXT];
2495 /* find segments from 0 to reuse freed segments */
2496 if (F2FS_OPTION(sbi).alloc_mode == ALLOC_MODE_REUSE)
2499 return CURSEG_I(sbi, type)->segno;
2503 * Allocate a current working segment.
2504 * This function always allocates a free segment in LFS manner.
2506 static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec)
2508 struct curseg_info *curseg = CURSEG_I(sbi, type);
2509 unsigned int segno = curseg->segno;
2510 int dir = ALLOC_LEFT;
2512 write_sum_page(sbi, curseg->sum_blk,
2513 GET_SUM_BLOCK(sbi, segno));
2514 if (type == CURSEG_WARM_DATA || type == CURSEG_COLD_DATA)
2517 if (test_opt(sbi, NOHEAP))
2520 segno = __get_next_segno(sbi, type);
2521 get_new_segment(sbi, &segno, new_sec, dir);
2522 curseg->next_segno = segno;
2523 reset_curseg(sbi, type, 1);
2524 curseg->alloc_type = LFS;
2527 static void __next_free_blkoff(struct f2fs_sb_info *sbi,
2528 struct curseg_info *seg, block_t start)
2530 struct seg_entry *se = get_seg_entry(sbi, seg->segno);
2531 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
2532 unsigned long *target_map = SIT_I(sbi)->tmp_map;
2533 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
2534 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
2537 for (i = 0; i < entries; i++)
2538 target_map[i] = ckpt_map[i] | cur_map[i];
2540 pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start);
2542 seg->next_blkoff = pos;
2546 * If a segment is written by LFS manner, next block offset is just obtained
2547 * by increasing the current block offset. However, if a segment is written by
2548 * SSR manner, next block offset obtained by calling __next_free_blkoff
2550 static void __refresh_next_blkoff(struct f2fs_sb_info *sbi,
2551 struct curseg_info *seg)
2553 if (seg->alloc_type == SSR)
2554 __next_free_blkoff(sbi, seg, seg->next_blkoff + 1);
2560 * This function always allocates a used segment(from dirty seglist) by SSR
2561 * manner, so it should recover the existing segment information of valid blocks
2563 static void change_curseg(struct f2fs_sb_info *sbi, int type)
2565 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2566 struct curseg_info *curseg = CURSEG_I(sbi, type);
2567 unsigned int new_segno = curseg->next_segno;
2568 struct f2fs_summary_block *sum_node;
2569 struct page *sum_page;
2571 write_sum_page(sbi, curseg->sum_blk,
2572 GET_SUM_BLOCK(sbi, curseg->segno));
2573 __set_test_and_inuse(sbi, new_segno);
2575 mutex_lock(&dirty_i->seglist_lock);
2576 __remove_dirty_segment(sbi, new_segno, PRE);
2577 __remove_dirty_segment(sbi, new_segno, DIRTY);
2578 mutex_unlock(&dirty_i->seglist_lock);
2580 reset_curseg(sbi, type, 1);
2581 curseg->alloc_type = SSR;
2582 __next_free_blkoff(sbi, curseg, 0);
2584 sum_page = f2fs_get_sum_page(sbi, new_segno);
2585 f2fs_bug_on(sbi, IS_ERR(sum_page));
2586 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
2587 memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE);
2588 f2fs_put_page(sum_page, 1);
2591 static int get_ssr_segment(struct f2fs_sb_info *sbi, int type)
2593 struct curseg_info *curseg = CURSEG_I(sbi, type);
2594 const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops;
2595 unsigned segno = NULL_SEGNO;
2597 bool reversed = false;
2599 /* f2fs_need_SSR() already forces to do this */
2600 if (v_ops->get_victim(sbi, &segno, BG_GC, type, SSR)) {
2601 curseg->next_segno = segno;
2605 /* For node segments, let's do SSR more intensively */
2606 if (IS_NODESEG(type)) {
2607 if (type >= CURSEG_WARM_NODE) {
2609 i = CURSEG_COLD_NODE;
2611 i = CURSEG_HOT_NODE;
2613 cnt = NR_CURSEG_NODE_TYPE;
2615 if (type >= CURSEG_WARM_DATA) {
2617 i = CURSEG_COLD_DATA;
2619 i = CURSEG_HOT_DATA;
2621 cnt = NR_CURSEG_DATA_TYPE;
2624 for (; cnt-- > 0; reversed ? i-- : i++) {
2627 if (v_ops->get_victim(sbi, &segno, BG_GC, i, SSR)) {
2628 curseg->next_segno = segno;
2633 /* find valid_blocks=0 in dirty list */
2634 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED))) {
2635 segno = get_free_segment(sbi);
2636 if (segno != NULL_SEGNO) {
2637 curseg->next_segno = segno;
2645 * flush out current segment and replace it with new segment
2646 * This function should be returned with success, otherwise BUG
2648 static void allocate_segment_by_default(struct f2fs_sb_info *sbi,
2649 int type, bool force)
2651 struct curseg_info *curseg = CURSEG_I(sbi, type);
2654 new_curseg(sbi, type, true);
2655 else if (!is_set_ckpt_flags(sbi, CP_CRC_RECOVERY_FLAG) &&
2656 type == CURSEG_WARM_NODE)
2657 new_curseg(sbi, type, false);
2658 else if (curseg->alloc_type == LFS && is_next_segment_free(sbi, type) &&
2659 likely(!is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
2660 new_curseg(sbi, type, false);
2661 else if (f2fs_need_SSR(sbi) && get_ssr_segment(sbi, type))
2662 change_curseg(sbi, type);
2664 new_curseg(sbi, type, false);
2666 stat_inc_seg_type(sbi, curseg);
2669 void allocate_segment_for_resize(struct f2fs_sb_info *sbi, int type,
2670 unsigned int start, unsigned int end)
2672 struct curseg_info *curseg = CURSEG_I(sbi, type);
2675 down_read(&SM_I(sbi)->curseg_lock);
2676 mutex_lock(&curseg->curseg_mutex);
2677 down_write(&SIT_I(sbi)->sentry_lock);
2679 segno = CURSEG_I(sbi, type)->segno;
2680 if (segno < start || segno > end)
2683 if (f2fs_need_SSR(sbi) && get_ssr_segment(sbi, type))
2684 change_curseg(sbi, type);
2686 new_curseg(sbi, type, true);
2688 stat_inc_seg_type(sbi, curseg);
2690 locate_dirty_segment(sbi, segno);
2692 up_write(&SIT_I(sbi)->sentry_lock);
2694 if (segno != curseg->segno)
2695 f2fs_notice(sbi, "For resize: curseg of type %d: %u ==> %u",
2696 type, segno, curseg->segno);
2698 mutex_unlock(&curseg->curseg_mutex);
2699 up_read(&SM_I(sbi)->curseg_lock);
2702 void f2fs_allocate_new_segments(struct f2fs_sb_info *sbi)
2704 struct curseg_info *curseg;
2705 unsigned int old_segno;
2708 down_write(&SIT_I(sbi)->sentry_lock);
2710 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
2711 curseg = CURSEG_I(sbi, i);
2712 old_segno = curseg->segno;
2713 SIT_I(sbi)->s_ops->allocate_segment(sbi, i, true);
2714 locate_dirty_segment(sbi, old_segno);
2717 up_write(&SIT_I(sbi)->sentry_lock);
2720 static const struct segment_allocation default_salloc_ops = {
2721 .allocate_segment = allocate_segment_by_default,
2724 bool f2fs_exist_trim_candidates(struct f2fs_sb_info *sbi,
2725 struct cp_control *cpc)
2727 __u64 trim_start = cpc->trim_start;
2728 bool has_candidate = false;
2730 down_write(&SIT_I(sbi)->sentry_lock);
2731 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++) {
2732 if (add_discard_addrs(sbi, cpc, true)) {
2733 has_candidate = true;
2737 up_write(&SIT_I(sbi)->sentry_lock);
2739 cpc->trim_start = trim_start;
2740 return has_candidate;
2743 static unsigned int __issue_discard_cmd_range(struct f2fs_sb_info *sbi,
2744 struct discard_policy *dpolicy,
2745 unsigned int start, unsigned int end)
2747 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
2748 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
2749 struct rb_node **insert_p = NULL, *insert_parent = NULL;
2750 struct discard_cmd *dc;
2751 struct blk_plug plug;
2753 unsigned int trimmed = 0;
2758 mutex_lock(&dcc->cmd_lock);
2759 if (unlikely(dcc->rbtree_check))
2760 f2fs_bug_on(sbi, !f2fs_check_rb_tree_consistence(sbi,
2763 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
2765 (struct rb_entry **)&prev_dc,
2766 (struct rb_entry **)&next_dc,
2767 &insert_p, &insert_parent, true, NULL);
2771 blk_start_plug(&plug);
2773 while (dc && dc->lstart <= end) {
2774 struct rb_node *node;
2777 if (dc->len < dpolicy->granularity)
2780 if (dc->state != D_PREP) {
2781 list_move_tail(&dc->list, &dcc->fstrim_list);
2785 err = __submit_discard_cmd(sbi, dpolicy, dc, &issued);
2787 if (issued >= dpolicy->max_requests) {
2788 start = dc->lstart + dc->len;
2791 __remove_discard_cmd(sbi, dc);
2793 blk_finish_plug(&plug);
2794 mutex_unlock(&dcc->cmd_lock);
2795 trimmed += __wait_all_discard_cmd(sbi, NULL);
2796 congestion_wait(BLK_RW_ASYNC, HZ/50);
2800 node = rb_next(&dc->rb_node);
2802 __remove_discard_cmd(sbi, dc);
2803 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
2805 if (fatal_signal_pending(current))
2809 blk_finish_plug(&plug);
2810 mutex_unlock(&dcc->cmd_lock);
2815 int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range)
2817 __u64 start = F2FS_BYTES_TO_BLK(range->start);
2818 __u64 end = start + F2FS_BYTES_TO_BLK(range->len) - 1;
2819 unsigned int start_segno, end_segno;
2820 block_t start_block, end_block;
2821 struct cp_control cpc;
2822 struct discard_policy dpolicy;
2823 unsigned long long trimmed = 0;
2825 bool need_align = test_opt(sbi, LFS) && __is_large_section(sbi);
2827 if (start >= MAX_BLKADDR(sbi) || range->len < sbi->blocksize)
2830 if (end < MAIN_BLKADDR(sbi))
2833 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
2834 f2fs_warn(sbi, "Found FS corruption, run fsck to fix.");
2835 return -EFSCORRUPTED;
2838 /* start/end segment number in main_area */
2839 start_segno = (start <= MAIN_BLKADDR(sbi)) ? 0 : GET_SEGNO(sbi, start);
2840 end_segno = (end >= MAX_BLKADDR(sbi)) ? MAIN_SEGS(sbi) - 1 :
2841 GET_SEGNO(sbi, end);
2843 start_segno = rounddown(start_segno, sbi->segs_per_sec);
2844 end_segno = roundup(end_segno + 1, sbi->segs_per_sec) - 1;
2847 cpc.reason = CP_DISCARD;
2848 cpc.trim_minlen = max_t(__u64, 1, F2FS_BYTES_TO_BLK(range->minlen));
2849 cpc.trim_start = start_segno;
2850 cpc.trim_end = end_segno;
2852 if (sbi->discard_blks == 0)
2855 mutex_lock(&sbi->gc_mutex);
2856 err = f2fs_write_checkpoint(sbi, &cpc);
2857 mutex_unlock(&sbi->gc_mutex);
2862 * We filed discard candidates, but actually we don't need to wait for
2863 * all of them, since they'll be issued in idle time along with runtime
2864 * discard option. User configuration looks like using runtime discard
2865 * or periodic fstrim instead of it.
2867 if (f2fs_realtime_discard_enable(sbi))
2870 start_block = START_BLOCK(sbi, start_segno);
2871 end_block = START_BLOCK(sbi, end_segno + 1);
2873 __init_discard_policy(sbi, &dpolicy, DPOLICY_FSTRIM, cpc.trim_minlen);
2874 trimmed = __issue_discard_cmd_range(sbi, &dpolicy,
2875 start_block, end_block);
2877 trimmed += __wait_discard_cmd_range(sbi, &dpolicy,
2878 start_block, end_block);
2881 range->len = F2FS_BLK_TO_BYTES(trimmed);
2885 static bool __has_curseg_space(struct f2fs_sb_info *sbi, int type)
2887 struct curseg_info *curseg = CURSEG_I(sbi, type);
2888 if (curseg->next_blkoff < sbi->blocks_per_seg)
2893 int f2fs_rw_hint_to_seg_type(enum rw_hint hint)
2896 case WRITE_LIFE_SHORT:
2897 return CURSEG_HOT_DATA;
2898 case WRITE_LIFE_EXTREME:
2899 return CURSEG_COLD_DATA;
2901 return CURSEG_WARM_DATA;
2905 /* This returns write hints for each segment type. This hints will be
2906 * passed down to block layer. There are mapping tables which depend on
2907 * the mount option 'whint_mode'.
2909 * 1) whint_mode=off. F2FS only passes down WRITE_LIFE_NOT_SET.
2911 * 2) whint_mode=user-based. F2FS tries to pass down hints given by users.
2915 * META WRITE_LIFE_NOT_SET
2919 * ioctl(COLD) COLD_DATA WRITE_LIFE_EXTREME
2920 * extension list " "
2923 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
2924 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
2925 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
2926 * WRITE_LIFE_NONE " "
2927 * WRITE_LIFE_MEDIUM " "
2928 * WRITE_LIFE_LONG " "
2931 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
2932 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
2933 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
2934 * WRITE_LIFE_NONE " WRITE_LIFE_NONE
2935 * WRITE_LIFE_MEDIUM " WRITE_LIFE_MEDIUM
2936 * WRITE_LIFE_LONG " WRITE_LIFE_LONG
2938 * 3) whint_mode=fs-based. F2FS passes down hints with its policy.
2942 * META WRITE_LIFE_MEDIUM;
2943 * HOT_NODE WRITE_LIFE_NOT_SET
2945 * COLD_NODE WRITE_LIFE_NONE
2946 * ioctl(COLD) COLD_DATA WRITE_LIFE_EXTREME
2947 * extension list " "
2950 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
2951 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
2952 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_LONG
2953 * WRITE_LIFE_NONE " "
2954 * WRITE_LIFE_MEDIUM " "
2955 * WRITE_LIFE_LONG " "
2958 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
2959 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
2960 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
2961 * WRITE_LIFE_NONE " WRITE_LIFE_NONE
2962 * WRITE_LIFE_MEDIUM " WRITE_LIFE_MEDIUM
2963 * WRITE_LIFE_LONG " WRITE_LIFE_LONG
2966 enum rw_hint f2fs_io_type_to_rw_hint(struct f2fs_sb_info *sbi,
2967 enum page_type type, enum temp_type temp)
2969 if (F2FS_OPTION(sbi).whint_mode == WHINT_MODE_USER) {
2972 return WRITE_LIFE_NOT_SET;
2973 else if (temp == HOT)
2974 return WRITE_LIFE_SHORT;
2975 else if (temp == COLD)
2976 return WRITE_LIFE_EXTREME;
2978 return WRITE_LIFE_NOT_SET;
2980 } else if (F2FS_OPTION(sbi).whint_mode == WHINT_MODE_FS) {
2983 return WRITE_LIFE_LONG;
2984 else if (temp == HOT)
2985 return WRITE_LIFE_SHORT;
2986 else if (temp == COLD)
2987 return WRITE_LIFE_EXTREME;
2988 } else if (type == NODE) {
2989 if (temp == WARM || temp == HOT)
2990 return WRITE_LIFE_NOT_SET;
2991 else if (temp == COLD)
2992 return WRITE_LIFE_NONE;
2993 } else if (type == META) {
2994 return WRITE_LIFE_MEDIUM;
2997 return WRITE_LIFE_NOT_SET;
3000 static int __get_segment_type_2(struct f2fs_io_info *fio)
3002 if (fio->type == DATA)
3003 return CURSEG_HOT_DATA;
3005 return CURSEG_HOT_NODE;
3008 static int __get_segment_type_4(struct f2fs_io_info *fio)
3010 if (fio->type == DATA) {
3011 struct inode *inode = fio->page->mapping->host;
3013 if (S_ISDIR(inode->i_mode))
3014 return CURSEG_HOT_DATA;
3016 return CURSEG_COLD_DATA;
3018 if (IS_DNODE(fio->page) && is_cold_node(fio->page))
3019 return CURSEG_WARM_NODE;
3021 return CURSEG_COLD_NODE;
3025 static int __get_segment_type_6(struct f2fs_io_info *fio)
3027 if (fio->type == DATA) {
3028 struct inode *inode = fio->page->mapping->host;
3030 if (is_cold_data(fio->page) || file_is_cold(inode))
3031 return CURSEG_COLD_DATA;
3032 if (file_is_hot(inode) ||
3033 is_inode_flag_set(inode, FI_HOT_DATA) ||
3034 f2fs_is_atomic_file(inode) ||
3035 f2fs_is_volatile_file(inode))
3036 return CURSEG_HOT_DATA;
3037 return f2fs_rw_hint_to_seg_type(inode->i_write_hint);
3039 if (IS_DNODE(fio->page))
3040 return is_cold_node(fio->page) ? CURSEG_WARM_NODE :
3042 return CURSEG_COLD_NODE;
3046 static int __get_segment_type(struct f2fs_io_info *fio)
3050 switch (F2FS_OPTION(fio->sbi).active_logs) {
3052 type = __get_segment_type_2(fio);
3055 type = __get_segment_type_4(fio);
3058 type = __get_segment_type_6(fio);
3061 f2fs_bug_on(fio->sbi, true);
3066 else if (IS_WARM(type))
3073 void f2fs_allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
3074 block_t old_blkaddr, block_t *new_blkaddr,
3075 struct f2fs_summary *sum, int type,
3076 struct f2fs_io_info *fio, bool add_list)
3078 struct sit_info *sit_i = SIT_I(sbi);
3079 struct curseg_info *curseg = CURSEG_I(sbi, type);
3081 down_read(&SM_I(sbi)->curseg_lock);
3083 mutex_lock(&curseg->curseg_mutex);
3084 down_write(&sit_i->sentry_lock);
3086 *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
3088 f2fs_wait_discard_bio(sbi, *new_blkaddr);
3091 * __add_sum_entry should be resided under the curseg_mutex
3092 * because, this function updates a summary entry in the
3093 * current summary block.
3095 __add_sum_entry(sbi, type, sum);
3097 __refresh_next_blkoff(sbi, curseg);
3099 stat_inc_block_count(sbi, curseg);
3102 * SIT information should be updated before segment allocation,
3103 * since SSR needs latest valid block information.
3105 update_sit_entry(sbi, *new_blkaddr, 1);
3106 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO)
3107 update_sit_entry(sbi, old_blkaddr, -1);
3109 if (!__has_curseg_space(sbi, type))
3110 sit_i->s_ops->allocate_segment(sbi, type, false);
3113 * segment dirty status should be updated after segment allocation,
3114 * so we just need to update status only one time after previous
3115 * segment being closed.
3117 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
3118 locate_dirty_segment(sbi, GET_SEGNO(sbi, *new_blkaddr));
3120 up_write(&sit_i->sentry_lock);
3122 if (page && IS_NODESEG(type)) {
3123 fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg));
3125 f2fs_inode_chksum_set(sbi, page);
3129 struct f2fs_bio_info *io;
3131 INIT_LIST_HEAD(&fio->list);
3132 fio->in_list = true;
3134 io = sbi->write_io[fio->type] + fio->temp;
3135 spin_lock(&io->io_lock);
3136 list_add_tail(&fio->list, &io->io_list);
3137 spin_unlock(&io->io_lock);
3140 mutex_unlock(&curseg->curseg_mutex);
3142 up_read(&SM_I(sbi)->curseg_lock);
3145 static void update_device_state(struct f2fs_io_info *fio)
3147 struct f2fs_sb_info *sbi = fio->sbi;
3148 unsigned int devidx;
3150 if (!f2fs_is_multi_device(sbi))
3153 devidx = f2fs_target_device_index(sbi, fio->new_blkaddr);
3155 /* update device state for fsync */
3156 f2fs_set_dirty_device(sbi, fio->ino, devidx, FLUSH_INO);
3158 /* update device state for checkpoint */
3159 if (!f2fs_test_bit(devidx, (char *)&sbi->dirty_device)) {
3160 spin_lock(&sbi->dev_lock);
3161 f2fs_set_bit(devidx, (char *)&sbi->dirty_device);
3162 spin_unlock(&sbi->dev_lock);
3166 static void do_write_page(struct f2fs_summary *sum, struct f2fs_io_info *fio)
3168 int type = __get_segment_type(fio);
3169 bool keep_order = (test_opt(fio->sbi, LFS) && type == CURSEG_COLD_DATA);
3172 down_read(&fio->sbi->io_order_lock);
3174 f2fs_allocate_data_block(fio->sbi, fio->page, fio->old_blkaddr,
3175 &fio->new_blkaddr, sum, type, fio, true);
3176 if (GET_SEGNO(fio->sbi, fio->old_blkaddr) != NULL_SEGNO)
3177 invalidate_mapping_pages(META_MAPPING(fio->sbi),
3178 fio->old_blkaddr, fio->old_blkaddr);
3180 /* writeout dirty page into bdev */
3181 f2fs_submit_page_write(fio);
3183 fio->old_blkaddr = fio->new_blkaddr;
3187 update_device_state(fio);
3190 up_read(&fio->sbi->io_order_lock);
3193 void f2fs_do_write_meta_page(struct f2fs_sb_info *sbi, struct page *page,
3194 enum iostat_type io_type)
3196 struct f2fs_io_info fio = {
3201 .op_flags = REQ_SYNC | REQ_META | REQ_PRIO,
3202 .old_blkaddr = page->index,
3203 .new_blkaddr = page->index,
3205 .encrypted_page = NULL,
3209 if (unlikely(page->index >= MAIN_BLKADDR(sbi)))
3210 fio.op_flags &= ~REQ_META;
3212 set_page_writeback(page);
3213 ClearPageError(page);
3214 f2fs_submit_page_write(&fio);
3216 stat_inc_meta_count(sbi, page->index);
3217 f2fs_update_iostat(sbi, io_type, F2FS_BLKSIZE);
3220 void f2fs_do_write_node_page(unsigned int nid, struct f2fs_io_info *fio)
3222 struct f2fs_summary sum;
3224 set_summary(&sum, nid, 0, 0);
3225 do_write_page(&sum, fio);
3227 f2fs_update_iostat(fio->sbi, fio->io_type, F2FS_BLKSIZE);
3230 void f2fs_outplace_write_data(struct dnode_of_data *dn,
3231 struct f2fs_io_info *fio)
3233 struct f2fs_sb_info *sbi = fio->sbi;
3234 struct f2fs_summary sum;
3236 f2fs_bug_on(sbi, dn->data_blkaddr == NULL_ADDR);
3237 set_summary(&sum, dn->nid, dn->ofs_in_node, fio->version);
3238 do_write_page(&sum, fio);
3239 f2fs_update_data_blkaddr(dn, fio->new_blkaddr);
3241 f2fs_update_iostat(sbi, fio->io_type, F2FS_BLKSIZE);
3244 int f2fs_inplace_write_data(struct f2fs_io_info *fio)
3247 struct f2fs_sb_info *sbi = fio->sbi;
3250 fio->new_blkaddr = fio->old_blkaddr;
3251 /* i/o temperature is needed for passing down write hints */
3252 __get_segment_type(fio);
3254 segno = GET_SEGNO(sbi, fio->new_blkaddr);
3256 if (!IS_DATASEG(get_seg_entry(sbi, segno)->type)) {
3257 set_sbi_flag(sbi, SBI_NEED_FSCK);
3258 f2fs_warn(sbi, "%s: incorrect segment(%u) type, run fsck to fix.",
3260 return -EFSCORRUPTED;
3263 stat_inc_inplace_blocks(fio->sbi);
3266 err = f2fs_merge_page_bio(fio);
3268 err = f2fs_submit_page_bio(fio);
3270 update_device_state(fio);
3271 f2fs_update_iostat(fio->sbi, fio->io_type, F2FS_BLKSIZE);
3277 static inline int __f2fs_get_curseg(struct f2fs_sb_info *sbi,
3282 for (i = CURSEG_HOT_DATA; i < NO_CHECK_TYPE; i++) {
3283 if (CURSEG_I(sbi, i)->segno == segno)
3289 void f2fs_do_replace_block(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
3290 block_t old_blkaddr, block_t new_blkaddr,
3291 bool recover_curseg, bool recover_newaddr)
3293 struct sit_info *sit_i = SIT_I(sbi);
3294 struct curseg_info *curseg;
3295 unsigned int segno, old_cursegno;
3296 struct seg_entry *se;
3298 unsigned short old_blkoff;
3300 segno = GET_SEGNO(sbi, new_blkaddr);
3301 se = get_seg_entry(sbi, segno);
3304 down_write(&SM_I(sbi)->curseg_lock);
3306 if (!recover_curseg) {
3307 /* for recovery flow */
3308 if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) {
3309 if (old_blkaddr == NULL_ADDR)
3310 type = CURSEG_COLD_DATA;
3312 type = CURSEG_WARM_DATA;
3315 if (IS_CURSEG(sbi, segno)) {
3316 /* se->type is volatile as SSR allocation */
3317 type = __f2fs_get_curseg(sbi, segno);
3318 f2fs_bug_on(sbi, type == NO_CHECK_TYPE);
3320 type = CURSEG_WARM_DATA;
3324 f2fs_bug_on(sbi, !IS_DATASEG(type));
3325 curseg = CURSEG_I(sbi, type);
3327 mutex_lock(&curseg->curseg_mutex);
3328 down_write(&sit_i->sentry_lock);
3330 old_cursegno = curseg->segno;
3331 old_blkoff = curseg->next_blkoff;
3333 /* change the current segment */
3334 if (segno != curseg->segno) {
3335 curseg->next_segno = segno;
3336 change_curseg(sbi, type);
3339 curseg->next_blkoff = GET_BLKOFF_FROM_SEG0(sbi, new_blkaddr);
3340 __add_sum_entry(sbi, type, sum);
3342 if (!recover_curseg || recover_newaddr)
3343 update_sit_entry(sbi, new_blkaddr, 1);
3344 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO) {
3345 invalidate_mapping_pages(META_MAPPING(sbi),
3346 old_blkaddr, old_blkaddr);
3347 update_sit_entry(sbi, old_blkaddr, -1);
3350 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
3351 locate_dirty_segment(sbi, GET_SEGNO(sbi, new_blkaddr));
3353 locate_dirty_segment(sbi, old_cursegno);
3355 if (recover_curseg) {
3356 if (old_cursegno != curseg->segno) {
3357 curseg->next_segno = old_cursegno;
3358 change_curseg(sbi, type);
3360 curseg->next_blkoff = old_blkoff;
3363 up_write(&sit_i->sentry_lock);
3364 mutex_unlock(&curseg->curseg_mutex);
3365 up_write(&SM_I(sbi)->curseg_lock);
3368 void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn,
3369 block_t old_addr, block_t new_addr,
3370 unsigned char version, bool recover_curseg,
3371 bool recover_newaddr)
3373 struct f2fs_summary sum;
3375 set_summary(&sum, dn->nid, dn->ofs_in_node, version);
3377 f2fs_do_replace_block(sbi, &sum, old_addr, new_addr,
3378 recover_curseg, recover_newaddr);
3380 f2fs_update_data_blkaddr(dn, new_addr);
3383 void f2fs_wait_on_page_writeback(struct page *page,
3384 enum page_type type, bool ordered, bool locked)
3386 if (PageWriteback(page)) {
3387 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
3389 f2fs_submit_merged_write_cond(sbi, NULL, page, 0, type);
3391 wait_on_page_writeback(page);
3392 f2fs_bug_on(sbi, locked && PageWriteback(page));
3394 wait_for_stable_page(page);
3399 void f2fs_wait_on_block_writeback(struct inode *inode, block_t blkaddr)
3401 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
3404 if (!f2fs_post_read_required(inode))
3407 if (!__is_valid_data_blkaddr(blkaddr))
3410 cpage = find_lock_page(META_MAPPING(sbi), blkaddr);
3412 f2fs_wait_on_page_writeback(cpage, DATA, true, true);
3413 f2fs_put_page(cpage, 1);
3417 void f2fs_wait_on_block_writeback_range(struct inode *inode, block_t blkaddr,
3422 for (i = 0; i < len; i++)
3423 f2fs_wait_on_block_writeback(inode, blkaddr + i);
3426 static int read_compacted_summaries(struct f2fs_sb_info *sbi)
3428 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
3429 struct curseg_info *seg_i;
3430 unsigned char *kaddr;
3435 start = start_sum_block(sbi);
3437 page = f2fs_get_meta_page(sbi, start++);
3439 return PTR_ERR(page);
3440 kaddr = (unsigned char *)page_address(page);
3442 /* Step 1: restore nat cache */
3443 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
3444 memcpy(seg_i->journal, kaddr, SUM_JOURNAL_SIZE);
3446 /* Step 2: restore sit cache */
3447 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
3448 memcpy(seg_i->journal, kaddr + SUM_JOURNAL_SIZE, SUM_JOURNAL_SIZE);
3449 offset = 2 * SUM_JOURNAL_SIZE;
3451 /* Step 3: restore summary entries */
3452 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
3453 unsigned short blk_off;
3456 seg_i = CURSEG_I(sbi, i);
3457 segno = le32_to_cpu(ckpt->cur_data_segno[i]);
3458 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]);
3459 seg_i->next_segno = segno;
3460 reset_curseg(sbi, i, 0);
3461 seg_i->alloc_type = ckpt->alloc_type[i];
3462 seg_i->next_blkoff = blk_off;
3464 if (seg_i->alloc_type == SSR)
3465 blk_off = sbi->blocks_per_seg;
3467 for (j = 0; j < blk_off; j++) {
3468 struct f2fs_summary *s;
3469 s = (struct f2fs_summary *)(kaddr + offset);
3470 seg_i->sum_blk->entries[j] = *s;
3471 offset += SUMMARY_SIZE;
3472 if (offset + SUMMARY_SIZE <= PAGE_SIZE -
3476 f2fs_put_page(page, 1);
3479 page = f2fs_get_meta_page(sbi, start++);
3481 return PTR_ERR(page);
3482 kaddr = (unsigned char *)page_address(page);
3486 f2fs_put_page(page, 1);
3490 static int read_normal_summaries(struct f2fs_sb_info *sbi, int type)
3492 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
3493 struct f2fs_summary_block *sum;
3494 struct curseg_info *curseg;
3496 unsigned short blk_off;
3497 unsigned int segno = 0;
3498 block_t blk_addr = 0;
3501 /* get segment number and block addr */
3502 if (IS_DATASEG(type)) {
3503 segno = le32_to_cpu(ckpt->cur_data_segno[type]);
3504 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type -
3506 if (__exist_node_summaries(sbi))
3507 blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type);
3509 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type);
3511 segno = le32_to_cpu(ckpt->cur_node_segno[type -
3513 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type -
3515 if (__exist_node_summaries(sbi))
3516 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE,
3517 type - CURSEG_HOT_NODE);
3519 blk_addr = GET_SUM_BLOCK(sbi, segno);
3522 new = f2fs_get_meta_page(sbi, blk_addr);
3524 return PTR_ERR(new);
3525 sum = (struct f2fs_summary_block *)page_address(new);
3527 if (IS_NODESEG(type)) {
3528 if (__exist_node_summaries(sbi)) {
3529 struct f2fs_summary *ns = &sum->entries[0];
3531 for (i = 0; i < sbi->blocks_per_seg; i++, ns++) {
3533 ns->ofs_in_node = 0;
3536 err = f2fs_restore_node_summary(sbi, segno, sum);
3542 /* set uncompleted segment to curseg */
3543 curseg = CURSEG_I(sbi, type);
3544 mutex_lock(&curseg->curseg_mutex);
3546 /* update journal info */
3547 down_write(&curseg->journal_rwsem);
3548 memcpy(curseg->journal, &sum->journal, SUM_JOURNAL_SIZE);
3549 up_write(&curseg->journal_rwsem);
3551 memcpy(curseg->sum_blk->entries, sum->entries, SUM_ENTRY_SIZE);
3552 memcpy(&curseg->sum_blk->footer, &sum->footer, SUM_FOOTER_SIZE);
3553 curseg->next_segno = segno;
3554 reset_curseg(sbi, type, 0);
3555 curseg->alloc_type = ckpt->alloc_type[type];
3556 curseg->next_blkoff = blk_off;
3557 mutex_unlock(&curseg->curseg_mutex);
3559 f2fs_put_page(new, 1);
3563 static int restore_curseg_summaries(struct f2fs_sb_info *sbi)
3565 struct f2fs_journal *sit_j = CURSEG_I(sbi, CURSEG_COLD_DATA)->journal;
3566 struct f2fs_journal *nat_j = CURSEG_I(sbi, CURSEG_HOT_DATA)->journal;
3567 int type = CURSEG_HOT_DATA;
3570 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG)) {
3571 int npages = f2fs_npages_for_summary_flush(sbi, true);
3574 f2fs_ra_meta_pages(sbi, start_sum_block(sbi), npages,
3577 /* restore for compacted data summary */
3578 err = read_compacted_summaries(sbi);
3581 type = CURSEG_HOT_NODE;
3584 if (__exist_node_summaries(sbi))
3585 f2fs_ra_meta_pages(sbi, sum_blk_addr(sbi, NR_CURSEG_TYPE, type),
3586 NR_CURSEG_TYPE - type, META_CP, true);
3588 for (; type <= CURSEG_COLD_NODE; type++) {
3589 err = read_normal_summaries(sbi, type);
3594 /* sanity check for summary blocks */
3595 if (nats_in_cursum(nat_j) > NAT_JOURNAL_ENTRIES ||
3596 sits_in_cursum(sit_j) > SIT_JOURNAL_ENTRIES) {
3597 f2fs_err(sbi, "invalid journal entries nats %u sits %u\n",
3598 nats_in_cursum(nat_j), sits_in_cursum(sit_j));
3605 static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr)
3608 unsigned char *kaddr;
3609 struct f2fs_summary *summary;
3610 struct curseg_info *seg_i;
3611 int written_size = 0;
3614 page = f2fs_grab_meta_page(sbi, blkaddr++);
3615 kaddr = (unsigned char *)page_address(page);
3616 memset(kaddr, 0, PAGE_SIZE);
3618 /* Step 1: write nat cache */
3619 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
3620 memcpy(kaddr, seg_i->journal, SUM_JOURNAL_SIZE);
3621 written_size += SUM_JOURNAL_SIZE;
3623 /* Step 2: write sit cache */
3624 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
3625 memcpy(kaddr + written_size, seg_i->journal, SUM_JOURNAL_SIZE);
3626 written_size += SUM_JOURNAL_SIZE;
3628 /* Step 3: write summary entries */
3629 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
3630 unsigned short blkoff;
3631 seg_i = CURSEG_I(sbi, i);
3632 if (sbi->ckpt->alloc_type[i] == SSR)
3633 blkoff = sbi->blocks_per_seg;
3635 blkoff = curseg_blkoff(sbi, i);
3637 for (j = 0; j < blkoff; j++) {
3639 page = f2fs_grab_meta_page(sbi, blkaddr++);
3640 kaddr = (unsigned char *)page_address(page);
3641 memset(kaddr, 0, PAGE_SIZE);
3644 summary = (struct f2fs_summary *)(kaddr + written_size);
3645 *summary = seg_i->sum_blk->entries[j];
3646 written_size += SUMMARY_SIZE;
3648 if (written_size + SUMMARY_SIZE <= PAGE_SIZE -
3652 set_page_dirty(page);
3653 f2fs_put_page(page, 1);
3658 set_page_dirty(page);
3659 f2fs_put_page(page, 1);
3663 static void write_normal_summaries(struct f2fs_sb_info *sbi,
3664 block_t blkaddr, int type)
3667 if (IS_DATASEG(type))
3668 end = type + NR_CURSEG_DATA_TYPE;
3670 end = type + NR_CURSEG_NODE_TYPE;
3672 for (i = type; i < end; i++)
3673 write_current_sum_page(sbi, i, blkaddr + (i - type));
3676 void f2fs_write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
3678 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG))
3679 write_compacted_summaries(sbi, start_blk);
3681 write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA);
3684 void f2fs_write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
3686 write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE);
3689 int f2fs_lookup_journal_in_cursum(struct f2fs_journal *journal, int type,
3690 unsigned int val, int alloc)
3694 if (type == NAT_JOURNAL) {
3695 for (i = 0; i < nats_in_cursum(journal); i++) {
3696 if (le32_to_cpu(nid_in_journal(journal, i)) == val)
3699 if (alloc && __has_cursum_space(journal, 1, NAT_JOURNAL))
3700 return update_nats_in_cursum(journal, 1);
3701 } else if (type == SIT_JOURNAL) {
3702 for (i = 0; i < sits_in_cursum(journal); i++)
3703 if (le32_to_cpu(segno_in_journal(journal, i)) == val)
3705 if (alloc && __has_cursum_space(journal, 1, SIT_JOURNAL))
3706 return update_sits_in_cursum(journal, 1);
3711 static struct page *get_current_sit_page(struct f2fs_sb_info *sbi,
3714 return f2fs_get_meta_page_nofail(sbi, current_sit_addr(sbi, segno));
3717 static struct page *get_next_sit_page(struct f2fs_sb_info *sbi,
3720 struct sit_info *sit_i = SIT_I(sbi);
3722 pgoff_t src_off, dst_off;
3724 src_off = current_sit_addr(sbi, start);
3725 dst_off = next_sit_addr(sbi, src_off);
3727 page = f2fs_grab_meta_page(sbi, dst_off);
3728 seg_info_to_sit_page(sbi, page, start);
3730 set_page_dirty(page);
3731 set_to_next_sit(sit_i, start);
3736 static struct sit_entry_set *grab_sit_entry_set(void)
3738 struct sit_entry_set *ses =
3739 f2fs_kmem_cache_alloc(sit_entry_set_slab, GFP_NOFS);
3742 INIT_LIST_HEAD(&ses->set_list);
3746 static void release_sit_entry_set(struct sit_entry_set *ses)
3748 list_del(&ses->set_list);
3749 kmem_cache_free(sit_entry_set_slab, ses);
3752 static void adjust_sit_entry_set(struct sit_entry_set *ses,
3753 struct list_head *head)
3755 struct sit_entry_set *next = ses;
3757 if (list_is_last(&ses->set_list, head))
3760 list_for_each_entry_continue(next, head, set_list)
3761 if (ses->entry_cnt <= next->entry_cnt)
3764 list_move_tail(&ses->set_list, &next->set_list);
3767 static void add_sit_entry(unsigned int segno, struct list_head *head)
3769 struct sit_entry_set *ses;
3770 unsigned int start_segno = START_SEGNO(segno);
3772 list_for_each_entry(ses, head, set_list) {
3773 if (ses->start_segno == start_segno) {
3775 adjust_sit_entry_set(ses, head);
3780 ses = grab_sit_entry_set();
3782 ses->start_segno = start_segno;
3784 list_add(&ses->set_list, head);
3787 static void add_sits_in_set(struct f2fs_sb_info *sbi)
3789 struct f2fs_sm_info *sm_info = SM_I(sbi);
3790 struct list_head *set_list = &sm_info->sit_entry_set;
3791 unsigned long *bitmap = SIT_I(sbi)->dirty_sentries_bitmap;
3794 for_each_set_bit(segno, bitmap, MAIN_SEGS(sbi))
3795 add_sit_entry(segno, set_list);
3798 static void remove_sits_in_journal(struct f2fs_sb_info *sbi)
3800 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
3801 struct f2fs_journal *journal = curseg->journal;
3804 down_write(&curseg->journal_rwsem);
3805 for (i = 0; i < sits_in_cursum(journal); i++) {
3809 segno = le32_to_cpu(segno_in_journal(journal, i));
3810 dirtied = __mark_sit_entry_dirty(sbi, segno);
3813 add_sit_entry(segno, &SM_I(sbi)->sit_entry_set);
3815 update_sits_in_cursum(journal, -i);
3816 up_write(&curseg->journal_rwsem);
3820 * CP calls this function, which flushes SIT entries including sit_journal,
3821 * and moves prefree segs to free segs.
3823 void f2fs_flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc)
3825 struct sit_info *sit_i = SIT_I(sbi);
3826 unsigned long *bitmap = sit_i->dirty_sentries_bitmap;
3827 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
3828 struct f2fs_journal *journal = curseg->journal;
3829 struct sit_entry_set *ses, *tmp;
3830 struct list_head *head = &SM_I(sbi)->sit_entry_set;
3831 bool to_journal = !is_sbi_flag_set(sbi, SBI_IS_RESIZEFS);
3832 struct seg_entry *se;
3834 down_write(&sit_i->sentry_lock);
3836 if (!sit_i->dirty_sentries)
3840 * add and account sit entries of dirty bitmap in sit entry
3843 add_sits_in_set(sbi);
3846 * if there are no enough space in journal to store dirty sit
3847 * entries, remove all entries from journal and add and account
3848 * them in sit entry set.
3850 if (!__has_cursum_space(journal, sit_i->dirty_sentries, SIT_JOURNAL) ||
3852 remove_sits_in_journal(sbi);
3855 * there are two steps to flush sit entries:
3856 * #1, flush sit entries to journal in current cold data summary block.
3857 * #2, flush sit entries to sit page.
3859 list_for_each_entry_safe(ses, tmp, head, set_list) {
3860 struct page *page = NULL;
3861 struct f2fs_sit_block *raw_sit = NULL;
3862 unsigned int start_segno = ses->start_segno;
3863 unsigned int end = min(start_segno + SIT_ENTRY_PER_BLOCK,
3864 (unsigned long)MAIN_SEGS(sbi));
3865 unsigned int segno = start_segno;
3868 !__has_cursum_space(journal, ses->entry_cnt, SIT_JOURNAL))
3872 down_write(&curseg->journal_rwsem);
3874 page = get_next_sit_page(sbi, start_segno);
3875 raw_sit = page_address(page);
3878 /* flush dirty sit entries in region of current sit set */
3879 for_each_set_bit_from(segno, bitmap, end) {
3880 int offset, sit_offset;
3882 se = get_seg_entry(sbi, segno);
3883 #ifdef CONFIG_F2FS_CHECK_FS
3884 if (memcmp(se->cur_valid_map, se->cur_valid_map_mir,
3885 SIT_VBLOCK_MAP_SIZE))
3886 f2fs_bug_on(sbi, 1);
3889 /* add discard candidates */
3890 if (!(cpc->reason & CP_DISCARD)) {
3891 cpc->trim_start = segno;
3892 add_discard_addrs(sbi, cpc, false);
3896 offset = f2fs_lookup_journal_in_cursum(journal,
3897 SIT_JOURNAL, segno, 1);
3898 f2fs_bug_on(sbi, offset < 0);
3899 segno_in_journal(journal, offset) =
3901 seg_info_to_raw_sit(se,
3902 &sit_in_journal(journal, offset));
3903 check_block_count(sbi, segno,
3904 &sit_in_journal(journal, offset));
3906 sit_offset = SIT_ENTRY_OFFSET(sit_i, segno);
3907 seg_info_to_raw_sit(se,
3908 &raw_sit->entries[sit_offset]);
3909 check_block_count(sbi, segno,
3910 &raw_sit->entries[sit_offset]);
3913 __clear_bit(segno, bitmap);
3914 sit_i->dirty_sentries--;
3919 up_write(&curseg->journal_rwsem);
3921 f2fs_put_page(page, 1);
3923 f2fs_bug_on(sbi, ses->entry_cnt);
3924 release_sit_entry_set(ses);
3927 f2fs_bug_on(sbi, !list_empty(head));
3928 f2fs_bug_on(sbi, sit_i->dirty_sentries);
3930 if (cpc->reason & CP_DISCARD) {
3931 __u64 trim_start = cpc->trim_start;
3933 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++)
3934 add_discard_addrs(sbi, cpc, false);
3936 cpc->trim_start = trim_start;
3938 up_write(&sit_i->sentry_lock);
3940 set_prefree_as_free_segments(sbi);
3943 static int build_sit_info(struct f2fs_sb_info *sbi)
3945 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
3946 struct sit_info *sit_i;
3947 unsigned int sit_segs, start;
3949 unsigned int bitmap_size;
3951 /* allocate memory for SIT information */
3952 sit_i = f2fs_kzalloc(sbi, sizeof(struct sit_info), GFP_KERNEL);
3956 SM_I(sbi)->sit_info = sit_i;
3959 f2fs_kvzalloc(sbi, array_size(sizeof(struct seg_entry),
3962 if (!sit_i->sentries)
3965 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
3966 sit_i->dirty_sentries_bitmap = f2fs_kvzalloc(sbi, bitmap_size,
3968 if (!sit_i->dirty_sentries_bitmap)
3971 for (start = 0; start < MAIN_SEGS(sbi); start++) {
3972 sit_i->sentries[start].cur_valid_map
3973 = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
3974 sit_i->sentries[start].ckpt_valid_map
3975 = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
3976 if (!sit_i->sentries[start].cur_valid_map ||
3977 !sit_i->sentries[start].ckpt_valid_map)
3980 #ifdef CONFIG_F2FS_CHECK_FS
3981 sit_i->sentries[start].cur_valid_map_mir
3982 = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
3983 if (!sit_i->sentries[start].cur_valid_map_mir)
3987 sit_i->sentries[start].discard_map
3988 = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE,
3990 if (!sit_i->sentries[start].discard_map)
3994 sit_i->tmp_map = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
3995 if (!sit_i->tmp_map)
3998 if (__is_large_section(sbi)) {
3999 sit_i->sec_entries =
4000 f2fs_kvzalloc(sbi, array_size(sizeof(struct sec_entry),
4003 if (!sit_i->sec_entries)
4007 /* get information related with SIT */
4008 sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1;
4010 /* setup SIT bitmap from ckeckpoint pack */
4011 bitmap_size = __bitmap_size(sbi, SIT_BITMAP);
4012 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP);
4014 sit_i->sit_bitmap = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
4015 if (!sit_i->sit_bitmap)
4018 #ifdef CONFIG_F2FS_CHECK_FS
4019 sit_i->sit_bitmap_mir = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
4020 if (!sit_i->sit_bitmap_mir)
4024 /* init SIT information */
4025 sit_i->s_ops = &default_salloc_ops;
4027 sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr);
4028 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg;
4029 sit_i->written_valid_blocks = 0;
4030 sit_i->bitmap_size = bitmap_size;
4031 sit_i->dirty_sentries = 0;
4032 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK;
4033 sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time);
4034 sit_i->mounted_time = ktime_get_real_seconds();
4035 init_rwsem(&sit_i->sentry_lock);
4039 static int build_free_segmap(struct f2fs_sb_info *sbi)
4041 struct free_segmap_info *free_i;
4042 unsigned int bitmap_size, sec_bitmap_size;
4044 /* allocate memory for free segmap information */
4045 free_i = f2fs_kzalloc(sbi, sizeof(struct free_segmap_info), GFP_KERNEL);
4049 SM_I(sbi)->free_info = free_i;
4051 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
4052 free_i->free_segmap = f2fs_kvmalloc(sbi, bitmap_size, GFP_KERNEL);
4053 if (!free_i->free_segmap)
4056 sec_bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
4057 free_i->free_secmap = f2fs_kvmalloc(sbi, sec_bitmap_size, GFP_KERNEL);
4058 if (!free_i->free_secmap)
4061 /* set all segments as dirty temporarily */
4062 memset(free_i->free_segmap, 0xff, bitmap_size);
4063 memset(free_i->free_secmap, 0xff, sec_bitmap_size);
4065 /* init free segmap information */
4066 free_i->start_segno = GET_SEGNO_FROM_SEG0(sbi, MAIN_BLKADDR(sbi));
4067 free_i->free_segments = 0;
4068 free_i->free_sections = 0;
4069 spin_lock_init(&free_i->segmap_lock);
4073 static int build_curseg(struct f2fs_sb_info *sbi)
4075 struct curseg_info *array;
4078 array = f2fs_kzalloc(sbi, array_size(NR_CURSEG_TYPE, sizeof(*array)),
4083 SM_I(sbi)->curseg_array = array;
4085 for (i = 0; i < NR_CURSEG_TYPE; i++) {
4086 mutex_init(&array[i].curseg_mutex);
4087 array[i].sum_blk = f2fs_kzalloc(sbi, PAGE_SIZE, GFP_KERNEL);
4088 if (!array[i].sum_blk)
4090 init_rwsem(&array[i].journal_rwsem);
4091 array[i].journal = f2fs_kzalloc(sbi,
4092 sizeof(struct f2fs_journal), GFP_KERNEL);
4093 if (!array[i].journal)
4095 array[i].segno = NULL_SEGNO;
4096 array[i].next_blkoff = 0;
4098 return restore_curseg_summaries(sbi);
4101 static int build_sit_entries(struct f2fs_sb_info *sbi)
4103 struct sit_info *sit_i = SIT_I(sbi);
4104 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
4105 struct f2fs_journal *journal = curseg->journal;
4106 struct seg_entry *se;
4107 struct f2fs_sit_entry sit;
4108 int sit_blk_cnt = SIT_BLK_CNT(sbi);
4109 unsigned int i, start, end;
4110 unsigned int readed, start_blk = 0;
4112 block_t total_node_blocks = 0;
4115 readed = f2fs_ra_meta_pages(sbi, start_blk, BIO_MAX_PAGES,
4118 start = start_blk * sit_i->sents_per_block;
4119 end = (start_blk + readed) * sit_i->sents_per_block;
4121 for (; start < end && start < MAIN_SEGS(sbi); start++) {
4122 struct f2fs_sit_block *sit_blk;
4125 se = &sit_i->sentries[start];
4126 page = get_current_sit_page(sbi, start);
4128 return PTR_ERR(page);
4129 sit_blk = (struct f2fs_sit_block *)page_address(page);
4130 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)];
4131 f2fs_put_page(page, 1);
4133 err = check_block_count(sbi, start, &sit);
4136 seg_info_from_raw_sit(se, &sit);
4137 if (IS_NODESEG(se->type))
4138 total_node_blocks += se->valid_blocks;
4140 /* build discard map only one time */
4141 if (is_set_ckpt_flags(sbi, CP_TRIMMED_FLAG)) {
4142 memset(se->discard_map, 0xff,
4143 SIT_VBLOCK_MAP_SIZE);
4145 memcpy(se->discard_map,
4147 SIT_VBLOCK_MAP_SIZE);
4148 sbi->discard_blks +=
4149 sbi->blocks_per_seg -
4153 if (__is_large_section(sbi))
4154 get_sec_entry(sbi, start)->valid_blocks +=
4157 start_blk += readed;
4158 } while (start_blk < sit_blk_cnt);
4160 down_read(&curseg->journal_rwsem);
4161 for (i = 0; i < sits_in_cursum(journal); i++) {
4162 unsigned int old_valid_blocks;
4164 start = le32_to_cpu(segno_in_journal(journal, i));
4165 if (start >= MAIN_SEGS(sbi)) {
4166 f2fs_err(sbi, "Wrong journal entry on segno %u",
4168 err = -EFSCORRUPTED;
4172 se = &sit_i->sentries[start];
4173 sit = sit_in_journal(journal, i);
4175 old_valid_blocks = se->valid_blocks;
4176 if (IS_NODESEG(se->type))
4177 total_node_blocks -= old_valid_blocks;
4179 err = check_block_count(sbi, start, &sit);
4182 seg_info_from_raw_sit(se, &sit);
4183 if (IS_NODESEG(se->type))
4184 total_node_blocks += se->valid_blocks;
4186 if (is_set_ckpt_flags(sbi, CP_TRIMMED_FLAG)) {
4187 memset(se->discard_map, 0xff, SIT_VBLOCK_MAP_SIZE);
4189 memcpy(se->discard_map, se->cur_valid_map,
4190 SIT_VBLOCK_MAP_SIZE);
4191 sbi->discard_blks += old_valid_blocks;
4192 sbi->discard_blks -= se->valid_blocks;
4195 if (__is_large_section(sbi)) {
4196 get_sec_entry(sbi, start)->valid_blocks +=
4198 get_sec_entry(sbi, start)->valid_blocks -=
4202 up_read(&curseg->journal_rwsem);
4204 if (!err && total_node_blocks != valid_node_count(sbi)) {
4205 f2fs_err(sbi, "SIT is corrupted node# %u vs %u",
4206 total_node_blocks, valid_node_count(sbi));
4207 err = -EFSCORRUPTED;
4213 static void init_free_segmap(struct f2fs_sb_info *sbi)
4218 for (start = 0; start < MAIN_SEGS(sbi); start++) {
4219 struct seg_entry *sentry = get_seg_entry(sbi, start);
4220 if (!sentry->valid_blocks)
4221 __set_free(sbi, start);
4223 SIT_I(sbi)->written_valid_blocks +=
4224 sentry->valid_blocks;
4227 /* set use the current segments */
4228 for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) {
4229 struct curseg_info *curseg_t = CURSEG_I(sbi, type);
4230 __set_test_and_inuse(sbi, curseg_t->segno);
4234 static void init_dirty_segmap(struct f2fs_sb_info *sbi)
4236 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4237 struct free_segmap_info *free_i = FREE_I(sbi);
4238 unsigned int segno = 0, offset = 0;
4239 unsigned short valid_blocks;
4242 /* find dirty segment based on free segmap */
4243 segno = find_next_inuse(free_i, MAIN_SEGS(sbi), offset);
4244 if (segno >= MAIN_SEGS(sbi))
4247 valid_blocks = get_valid_blocks(sbi, segno, false);
4248 if (valid_blocks == sbi->blocks_per_seg || !valid_blocks)
4250 if (valid_blocks > sbi->blocks_per_seg) {
4251 f2fs_bug_on(sbi, 1);
4254 mutex_lock(&dirty_i->seglist_lock);
4255 __locate_dirty_segment(sbi, segno, DIRTY);
4256 mutex_unlock(&dirty_i->seglist_lock);
4260 static int init_victim_secmap(struct f2fs_sb_info *sbi)
4262 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4263 unsigned int bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
4265 dirty_i->victim_secmap = f2fs_kvzalloc(sbi, bitmap_size, GFP_KERNEL);
4266 if (!dirty_i->victim_secmap)
4271 static int build_dirty_segmap(struct f2fs_sb_info *sbi)
4273 struct dirty_seglist_info *dirty_i;
4274 unsigned int bitmap_size, i;
4276 /* allocate memory for dirty segments list information */
4277 dirty_i = f2fs_kzalloc(sbi, sizeof(struct dirty_seglist_info),
4282 SM_I(sbi)->dirty_info = dirty_i;
4283 mutex_init(&dirty_i->seglist_lock);
4285 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
4287 for (i = 0; i < NR_DIRTY_TYPE; i++) {
4288 dirty_i->dirty_segmap[i] = f2fs_kvzalloc(sbi, bitmap_size,
4290 if (!dirty_i->dirty_segmap[i])
4294 init_dirty_segmap(sbi);
4295 return init_victim_secmap(sbi);
4298 static int sanity_check_curseg(struct f2fs_sb_info *sbi)
4303 * In LFS/SSR curseg, .next_blkoff should point to an unused blkaddr;
4304 * In LFS curseg, all blkaddr after .next_blkoff should be unused.
4306 for (i = 0; i < NO_CHECK_TYPE; i++) {
4307 struct curseg_info *curseg = CURSEG_I(sbi, i);
4308 struct seg_entry *se = get_seg_entry(sbi, curseg->segno);
4309 unsigned int blkofs = curseg->next_blkoff;
4311 if (f2fs_test_bit(blkofs, se->cur_valid_map))
4314 if (curseg->alloc_type == SSR)
4317 for (blkofs += 1; blkofs < sbi->blocks_per_seg; blkofs++) {
4318 if (!f2fs_test_bit(blkofs, se->cur_valid_map))
4322 "Current segment's next free block offset is inconsistent with bitmap, logtype:%u, segno:%u, type:%u, next_blkoff:%u, blkofs:%u",
4323 i, curseg->segno, curseg->alloc_type,
4324 curseg->next_blkoff, blkofs);
4325 return -EFSCORRUPTED;
4332 * Update min, max modified time for cost-benefit GC algorithm
4334 static void init_min_max_mtime(struct f2fs_sb_info *sbi)
4336 struct sit_info *sit_i = SIT_I(sbi);
4339 down_write(&sit_i->sentry_lock);
4341 sit_i->min_mtime = ULLONG_MAX;
4343 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
4345 unsigned long long mtime = 0;
4347 for (i = 0; i < sbi->segs_per_sec; i++)
4348 mtime += get_seg_entry(sbi, segno + i)->mtime;
4350 mtime = div_u64(mtime, sbi->segs_per_sec);
4352 if (sit_i->min_mtime > mtime)
4353 sit_i->min_mtime = mtime;
4355 sit_i->max_mtime = get_mtime(sbi, false);
4356 up_write(&sit_i->sentry_lock);
4359 int f2fs_build_segment_manager(struct f2fs_sb_info *sbi)
4361 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
4362 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
4363 struct f2fs_sm_info *sm_info;
4366 sm_info = f2fs_kzalloc(sbi, sizeof(struct f2fs_sm_info), GFP_KERNEL);
4371 sbi->sm_info = sm_info;
4372 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr);
4373 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr);
4374 sm_info->segment_count = le32_to_cpu(raw_super->segment_count);
4375 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count);
4376 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count);
4377 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main);
4378 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr);
4379 sm_info->rec_prefree_segments = sm_info->main_segments *
4380 DEF_RECLAIM_PREFREE_SEGMENTS / 100;
4381 if (sm_info->rec_prefree_segments > DEF_MAX_RECLAIM_PREFREE_SEGMENTS)
4382 sm_info->rec_prefree_segments = DEF_MAX_RECLAIM_PREFREE_SEGMENTS;
4384 if (!test_opt(sbi, LFS))
4385 sm_info->ipu_policy = 1 << F2FS_IPU_FSYNC;
4386 sm_info->min_ipu_util = DEF_MIN_IPU_UTIL;
4387 sm_info->min_fsync_blocks = DEF_MIN_FSYNC_BLOCKS;
4388 sm_info->min_seq_blocks = sbi->blocks_per_seg * sbi->segs_per_sec;
4389 sm_info->min_hot_blocks = DEF_MIN_HOT_BLOCKS;
4390 sm_info->min_ssr_sections = reserved_sections(sbi);
4392 INIT_LIST_HEAD(&sm_info->sit_entry_set);
4394 init_rwsem(&sm_info->curseg_lock);
4396 if (!f2fs_readonly(sbi->sb)) {
4397 err = f2fs_create_flush_cmd_control(sbi);
4402 err = create_discard_cmd_control(sbi);
4406 err = build_sit_info(sbi);
4409 err = build_free_segmap(sbi);
4412 err = build_curseg(sbi);
4416 /* reinit free segmap based on SIT */
4417 err = build_sit_entries(sbi);
4421 init_free_segmap(sbi);
4422 err = build_dirty_segmap(sbi);
4426 err = sanity_check_curseg(sbi);
4430 init_min_max_mtime(sbi);
4434 static void discard_dirty_segmap(struct f2fs_sb_info *sbi,
4435 enum dirty_type dirty_type)
4437 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4439 mutex_lock(&dirty_i->seglist_lock);
4440 kvfree(dirty_i->dirty_segmap[dirty_type]);
4441 dirty_i->nr_dirty[dirty_type] = 0;
4442 mutex_unlock(&dirty_i->seglist_lock);
4445 static void destroy_victim_secmap(struct f2fs_sb_info *sbi)
4447 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4448 kvfree(dirty_i->victim_secmap);
4451 static void destroy_dirty_segmap(struct f2fs_sb_info *sbi)
4453 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4459 /* discard pre-free/dirty segments list */
4460 for (i = 0; i < NR_DIRTY_TYPE; i++)
4461 discard_dirty_segmap(sbi, i);
4463 destroy_victim_secmap(sbi);
4464 SM_I(sbi)->dirty_info = NULL;
4468 static void destroy_curseg(struct f2fs_sb_info *sbi)
4470 struct curseg_info *array = SM_I(sbi)->curseg_array;
4475 SM_I(sbi)->curseg_array = NULL;
4476 for (i = 0; i < NR_CURSEG_TYPE; i++) {
4477 kvfree(array[i].sum_blk);
4478 kvfree(array[i].journal);
4483 static void destroy_free_segmap(struct f2fs_sb_info *sbi)
4485 struct free_segmap_info *free_i = SM_I(sbi)->free_info;
4488 SM_I(sbi)->free_info = NULL;
4489 kvfree(free_i->free_segmap);
4490 kvfree(free_i->free_secmap);
4494 static void destroy_sit_info(struct f2fs_sb_info *sbi)
4496 struct sit_info *sit_i = SIT_I(sbi);
4502 if (sit_i->sentries) {
4503 for (start = 0; start < MAIN_SEGS(sbi); start++) {
4504 kvfree(sit_i->sentries[start].cur_valid_map);
4505 #ifdef CONFIG_F2FS_CHECK_FS
4506 kvfree(sit_i->sentries[start].cur_valid_map_mir);
4508 kvfree(sit_i->sentries[start].ckpt_valid_map);
4509 kvfree(sit_i->sentries[start].discard_map);
4512 kvfree(sit_i->tmp_map);
4514 kvfree(sit_i->sentries);
4515 kvfree(sit_i->sec_entries);
4516 kvfree(sit_i->dirty_sentries_bitmap);
4518 SM_I(sbi)->sit_info = NULL;
4519 kvfree(sit_i->sit_bitmap);
4520 #ifdef CONFIG_F2FS_CHECK_FS
4521 kvfree(sit_i->sit_bitmap_mir);
4526 void f2fs_destroy_segment_manager(struct f2fs_sb_info *sbi)
4528 struct f2fs_sm_info *sm_info = SM_I(sbi);
4532 f2fs_destroy_flush_cmd_control(sbi, true);
4533 destroy_discard_cmd_control(sbi);
4534 destroy_dirty_segmap(sbi);
4535 destroy_curseg(sbi);
4536 destroy_free_segmap(sbi);
4537 destroy_sit_info(sbi);
4538 sbi->sm_info = NULL;
4542 int __init f2fs_create_segment_manager_caches(void)
4544 discard_entry_slab = f2fs_kmem_cache_create("discard_entry",
4545 sizeof(struct discard_entry));
4546 if (!discard_entry_slab)
4549 discard_cmd_slab = f2fs_kmem_cache_create("discard_cmd",
4550 sizeof(struct discard_cmd));
4551 if (!discard_cmd_slab)
4552 goto destroy_discard_entry;
4554 sit_entry_set_slab = f2fs_kmem_cache_create("sit_entry_set",
4555 sizeof(struct sit_entry_set));
4556 if (!sit_entry_set_slab)
4557 goto destroy_discard_cmd;
4559 inmem_entry_slab = f2fs_kmem_cache_create("inmem_page_entry",
4560 sizeof(struct inmem_pages));
4561 if (!inmem_entry_slab)
4562 goto destroy_sit_entry_set;
4565 destroy_sit_entry_set:
4566 kmem_cache_destroy(sit_entry_set_slab);
4567 destroy_discard_cmd:
4568 kmem_cache_destroy(discard_cmd_slab);
4569 destroy_discard_entry:
4570 kmem_cache_destroy(discard_entry_slab);
4575 void f2fs_destroy_segment_manager_caches(void)
4577 kmem_cache_destroy(sit_entry_set_slab);
4578 kmem_cache_destroy(discard_cmd_slab);
4579 kmem_cache_destroy(discard_entry_slab);
4580 kmem_cache_destroy(inmem_entry_slab);