1d29fbcdbSNishad Kamdar /* SPDX-License-Identifier: GPL-2.0 */
20a8165d7SJaegeuk Kim /*
37bc09003SJaegeuk Kim * fs/f2fs/gc.h
47bc09003SJaegeuk Kim *
57bc09003SJaegeuk Kim * Copyright (c) 2012 Samsung Electronics Co., Ltd.
67bc09003SJaegeuk Kim * http://www.samsung.com/
77bc09003SJaegeuk Kim */
87bc09003SJaegeuk Kim #define GC_THREAD_MIN_WB_PAGES 1 /*
97bc09003SJaegeuk Kim * a threshold to determine
107bc09003SJaegeuk Kim * whether IO subsystem is idle
117bc09003SJaegeuk Kim * or not
127bc09003SJaegeuk Kim */
13d9872a69SJaegeuk Kim #define DEF_GC_THREAD_URGENT_SLEEP_TIME 500 /* 500 ms */
14b59d0baeSNamjae Jeon #define DEF_GC_THREAD_MIN_SLEEP_TIME 30000 /* milliseconds */
15b59d0baeSNamjae Jeon #define DEF_GC_THREAD_MAX_SLEEP_TIME 60000
16b59d0baeSNamjae Jeon #define DEF_GC_THREAD_NOGC_SLEEP_TIME 300000 /* wait 5 min */
17093749e2SChao Yu
18093749e2SChao Yu /* choose candidates from sections which has age of more than 7 days */
19093749e2SChao Yu #define DEF_GC_THREAD_AGE_THRESHOLD (60 * 60 * 24 * 7)
20093749e2SChao Yu #define DEF_GC_THREAD_CANDIDATE_RATIO 20 /* select 20% oldest sections as candidates */
21093749e2SChao Yu #define DEF_GC_THREAD_MAX_CANDIDATE_COUNT 10 /* select at most 10 sections as candidates */
22093749e2SChao Yu #define DEF_GC_THREAD_AGE_WEIGHT 60 /* age weight */
23093749e2SChao Yu #define DEFAULT_ACCURACY_CLASS 10000 /* accuracy class */
24093749e2SChao Yu
257bc09003SJaegeuk Kim #define LIMIT_INVALID_BLOCK 40 /* percentage over total user space */
267bc09003SJaegeuk Kim #define LIMIT_FREE_BLOCK 40 /* percentage over invalid + free space */
277bc09003SJaegeuk Kim
281ad71a27SJaegeuk Kim #define DEF_GC_FAILED_PINNED_FILES 2048
291ad71a27SJaegeuk Kim
307bc09003SJaegeuk Kim /* Search max. number of dirty segments to select a victim segment */
31b1c57c1cSJaegeuk Kim #define DEF_MAX_VICTIM_SEARCH 4096 /* covers 8GB */
327bc09003SJaegeuk Kim
33*d11cef14SYonggil Song #define NR_GC_CHECKPOINT_SECS (3) /* data/node/dentry sections */
34*d11cef14SYonggil Song
357bc09003SJaegeuk Kim struct f2fs_gc_kthread {
367bc09003SJaegeuk Kim struct task_struct *f2fs_gc_task;
377bc09003SJaegeuk Kim wait_queue_head_t gc_wait_queue_head;
38b59d0baeSNamjae Jeon
39b59d0baeSNamjae Jeon /* for gc sleep time */
40d9872a69SJaegeuk Kim unsigned int urgent_sleep_time;
41b59d0baeSNamjae Jeon unsigned int min_sleep_time;
42b59d0baeSNamjae Jeon unsigned int max_sleep_time;
43b59d0baeSNamjae Jeon unsigned int no_gc_sleep_time;
44d2dc095fSNamjae Jeon
45d2dc095fSNamjae Jeon /* for changing gc mode */
4645c98f5aSYangtao Li bool gc_wake;
475911d2d1SChao Yu
485911d2d1SChao Yu /* for GC_MERGE mount option */
495911d2d1SChao Yu wait_queue_head_t fggc_wq; /*
505911d2d1SChao Yu * caller of f2fs_balance_fs()
515911d2d1SChao Yu * will wait on this wait queue.
525911d2d1SChao Yu */
537bc09003SJaegeuk Kim };
547bc09003SJaegeuk Kim
557dda2af8SChangman Lee struct gc_inode_list {
567dda2af8SChangman Lee struct list_head ilist;
577dda2af8SChangman Lee struct radix_tree_root iroot;
587dda2af8SChangman Lee };
597dda2af8SChangman Lee
60093749e2SChao Yu struct victim_entry {
61093749e2SChao Yu struct rb_node rb_node; /* rb node located in rb-tree */
62093749e2SChao Yu unsigned long long mtime; /* mtime of section */
63093749e2SChao Yu unsigned int segno; /* segment No. */
64093749e2SChao Yu struct list_head list;
65093749e2SChao Yu };
66093749e2SChao Yu
670a8165d7SJaegeuk Kim /*
687bc09003SJaegeuk Kim * inline functions
697bc09003SJaegeuk Kim */
70de881df9SAravind Ramesh
71de881df9SAravind Ramesh /*
72de881df9SAravind Ramesh * On a Zoned device zone-capacity can be less than zone-size and if
73de881df9SAravind Ramesh * zone-capacity is not aligned to f2fs segment size(2MB), then the segment
74de881df9SAravind Ramesh * starting just before zone-capacity has some blocks spanning across the
75de881df9SAravind Ramesh * zone-capacity, these blocks are not usable.
76de881df9SAravind Ramesh * Such spanning segments can be in free list so calculate the sum of usable
77de881df9SAravind Ramesh * blocks in currently free segments including normal and spanning segments.
78de881df9SAravind Ramesh */
free_segs_blk_count_zoned(struct f2fs_sb_info * sbi)79de881df9SAravind Ramesh static inline block_t free_segs_blk_count_zoned(struct f2fs_sb_info *sbi)
80de881df9SAravind Ramesh {
81de881df9SAravind Ramesh block_t free_seg_blks = 0;
82de881df9SAravind Ramesh struct free_segmap_info *free_i = FREE_I(sbi);
83de881df9SAravind Ramesh int j;
84de881df9SAravind Ramesh
85de881df9SAravind Ramesh spin_lock(&free_i->segmap_lock);
86de881df9SAravind Ramesh for (j = 0; j < MAIN_SEGS(sbi); j++)
87de881df9SAravind Ramesh if (!test_bit(j, free_i->free_segmap))
88de881df9SAravind Ramesh free_seg_blks += f2fs_usable_blks_in_seg(sbi, j);
89de881df9SAravind Ramesh spin_unlock(&free_i->segmap_lock);
90de881df9SAravind Ramesh
91de881df9SAravind Ramesh return free_seg_blks;
92de881df9SAravind Ramesh }
93de881df9SAravind Ramesh
free_segs_blk_count(struct f2fs_sb_info * sbi)94de881df9SAravind Ramesh static inline block_t free_segs_blk_count(struct f2fs_sb_info *sbi)
95de881df9SAravind Ramesh {
96de881df9SAravind Ramesh if (f2fs_sb_has_blkzoned(sbi))
97de881df9SAravind Ramesh return free_segs_blk_count_zoned(sbi);
98de881df9SAravind Ramesh
99de881df9SAravind Ramesh return free_segments(sbi) << sbi->log_blocks_per_seg;
100de881df9SAravind Ramesh }
101de881df9SAravind Ramesh
free_user_blocks(struct f2fs_sb_info * sbi)1027bc09003SJaegeuk Kim static inline block_t free_user_blocks(struct f2fs_sb_info *sbi)
1037bc09003SJaegeuk Kim {
104de881df9SAravind Ramesh block_t free_blks, ovp_blks;
105de881df9SAravind Ramesh
106de881df9SAravind Ramesh free_blks = free_segs_blk_count(sbi);
107de881df9SAravind Ramesh ovp_blks = overprovision_segments(sbi) << sbi->log_blocks_per_seg;
108de881df9SAravind Ramesh
109de881df9SAravind Ramesh if (free_blks < ovp_blks)
1107bc09003SJaegeuk Kim return 0;
111de881df9SAravind Ramesh
112de881df9SAravind Ramesh return free_blks - ovp_blks;
1137bc09003SJaegeuk Kim }
1147bc09003SJaegeuk Kim
limit_invalid_user_blocks(block_t user_block_count)11514de5fc3Sduguowei static inline block_t limit_invalid_user_blocks(block_t user_block_count)
1167bc09003SJaegeuk Kim {
11714de5fc3Sduguowei return (long)(user_block_count * LIMIT_INVALID_BLOCK) / 100;
1187bc09003SJaegeuk Kim }
1197bc09003SJaegeuk Kim
limit_free_user_blocks(block_t reclaimable_user_blocks)12014de5fc3Sduguowei static inline block_t limit_free_user_blocks(block_t reclaimable_user_blocks)
1217bc09003SJaegeuk Kim {
1227bc09003SJaegeuk Kim return (long)(reclaimable_user_blocks * LIMIT_FREE_BLOCK) / 100;
1237bc09003SJaegeuk Kim }
1247bc09003SJaegeuk Kim
increase_sleep_time(struct f2fs_gc_kthread * gc_th,unsigned int * wait)12588dd8934SChao Yu static inline void increase_sleep_time(struct f2fs_gc_kthread *gc_th,
126b8c502b8SChao Yu unsigned int *wait)
1277bc09003SJaegeuk Kim {
128b8c502b8SChao Yu unsigned int min_time = gc_th->min_sleep_time;
129b8c502b8SChao Yu unsigned int max_time = gc_th->max_sleep_time;
130b8c502b8SChao Yu
13188dd8934SChao Yu if (*wait == gc_th->no_gc_sleep_time)
13288dd8934SChao Yu return;
1336cb968d9SJaegeuk Kim
134b8c502b8SChao Yu if ((long long)*wait + (long long)min_time > (long long)max_time)
135b8c502b8SChao Yu *wait = max_time;
136b8c502b8SChao Yu else
137b8c502b8SChao Yu *wait += min_time;
1387bc09003SJaegeuk Kim }
1397bc09003SJaegeuk Kim
decrease_sleep_time(struct f2fs_gc_kthread * gc_th,unsigned int * wait)14088dd8934SChao Yu static inline void decrease_sleep_time(struct f2fs_gc_kthread *gc_th,
141b8c502b8SChao Yu unsigned int *wait)
1427bc09003SJaegeuk Kim {
143b8c502b8SChao Yu unsigned int min_time = gc_th->min_sleep_time;
144b8c502b8SChao Yu
14588dd8934SChao Yu if (*wait == gc_th->no_gc_sleep_time)
14688dd8934SChao Yu *wait = gc_th->max_sleep_time;
1476cb968d9SJaegeuk Kim
148b8c502b8SChao Yu if ((long long)*wait - (long long)min_time < (long long)min_time)
149b8c502b8SChao Yu *wait = min_time;
150b8c502b8SChao Yu else
151b8c502b8SChao Yu *wait -= min_time;
1527bc09003SJaegeuk Kim }
1537bc09003SJaegeuk Kim
has_enough_invalid_blocks(struct f2fs_sb_info * sbi)1547bc09003SJaegeuk Kim static inline bool has_enough_invalid_blocks(struct f2fs_sb_info *sbi)
1557bc09003SJaegeuk Kim {
15614de5fc3Sduguowei block_t user_block_count = sbi->user_block_count;
15714de5fc3Sduguowei block_t invalid_user_blocks = user_block_count -
1587bc09003SJaegeuk Kim written_block_count(sbi);
1597bc09003SJaegeuk Kim /*
160e1c42045Sarter97 * Background GC is triggered with the following conditions.
1617bc09003SJaegeuk Kim * 1. There are a number of invalid blocks.
1627bc09003SJaegeuk Kim * 2. There is not enough free space.
1637bc09003SJaegeuk Kim */
16414de5fc3Sduguowei return (invalid_user_blocks >
16514de5fc3Sduguowei limit_invalid_user_blocks(user_block_count) &&
16614de5fc3Sduguowei free_user_blocks(sbi) <
16714de5fc3Sduguowei limit_free_user_blocks(invalid_user_blocks));
1687bc09003SJaegeuk Kim }
169