]> git.proxmox.com Git - mirror_ubuntu-hirsute-kernel.git/blob - fs/f2fs/gc.h
f2fs: reuse inode_entry_slab in gc procedure for using slab more effectively
[mirror_ubuntu-hirsute-kernel.git] / fs / f2fs / gc.h
1 /*
2 * fs/f2fs/gc.h
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 */
11 #define GC_THREAD_MIN_WB_PAGES 1 /*
12 * a threshold to determine
13 * whether IO subsystem is idle
14 * or not
15 */
16 #define DEF_GC_THREAD_MIN_SLEEP_TIME 30000 /* milliseconds */
17 #define DEF_GC_THREAD_MAX_SLEEP_TIME 60000
18 #define DEF_GC_THREAD_NOGC_SLEEP_TIME 300000 /* wait 5 min */
19 #define LIMIT_INVALID_BLOCK 40 /* percentage over total user space */
20 #define LIMIT_FREE_BLOCK 40 /* percentage over invalid + free space */
21
22 /* Search max. number of dirty segments to select a victim segment */
23 #define DEF_MAX_VICTIM_SEARCH 4096 /* covers 8GB */
24
25 struct f2fs_gc_kthread {
26 struct task_struct *f2fs_gc_task;
27 wait_queue_head_t gc_wait_queue_head;
28
29 /* for gc sleep time */
30 unsigned int min_sleep_time;
31 unsigned int max_sleep_time;
32 unsigned int no_gc_sleep_time;
33
34 /* for changing gc mode */
35 unsigned int gc_idle;
36 };
37
38 struct gc_inode_list {
39 struct list_head ilist;
40 struct radix_tree_root iroot;
41 };
42
43 extern struct kmem_cache *inode_entry_slab;
44
45 /*
46 * inline functions
47 */
48 static inline block_t free_user_blocks(struct f2fs_sb_info *sbi)
49 {
50 if (free_segments(sbi) < overprovision_segments(sbi))
51 return 0;
52 else
53 return (free_segments(sbi) - overprovision_segments(sbi))
54 << sbi->log_blocks_per_seg;
55 }
56
57 static inline block_t limit_invalid_user_blocks(struct f2fs_sb_info *sbi)
58 {
59 return (long)(sbi->user_block_count * LIMIT_INVALID_BLOCK) / 100;
60 }
61
62 static inline block_t limit_free_user_blocks(struct f2fs_sb_info *sbi)
63 {
64 block_t reclaimable_user_blocks = sbi->user_block_count -
65 written_block_count(sbi);
66 return (long)(reclaimable_user_blocks * LIMIT_FREE_BLOCK) / 100;
67 }
68
69 static inline long increase_sleep_time(struct f2fs_gc_kthread *gc_th, long wait)
70 {
71 if (wait == gc_th->no_gc_sleep_time)
72 return wait;
73
74 wait += gc_th->min_sleep_time;
75 if (wait > gc_th->max_sleep_time)
76 wait = gc_th->max_sleep_time;
77 return wait;
78 }
79
80 static inline long decrease_sleep_time(struct f2fs_gc_kthread *gc_th, long wait)
81 {
82 if (wait == gc_th->no_gc_sleep_time)
83 wait = gc_th->max_sleep_time;
84
85 wait -= gc_th->min_sleep_time;
86 if (wait <= gc_th->min_sleep_time)
87 wait = gc_th->min_sleep_time;
88 return wait;
89 }
90
91 static inline bool has_enough_invalid_blocks(struct f2fs_sb_info *sbi)
92 {
93 block_t invalid_user_blocks = sbi->user_block_count -
94 written_block_count(sbi);
95 /*
96 * Background GC is triggered with the following conditions.
97 * 1. There are a number of invalid blocks.
98 * 2. There is not enough free space.
99 */
100 if (invalid_user_blocks > limit_invalid_user_blocks(sbi) &&
101 free_user_blocks(sbi) < limit_free_user_blocks(sbi))
102 return true;
103 return false;
104 }
105
106 static inline int is_idle(struct f2fs_sb_info *sbi)
107 {
108 struct block_device *bdev = sbi->sb->s_bdev;
109 struct request_queue *q = bdev_get_queue(bdev);
110 struct request_list *rl = &q->root_rl;
111 return !(rl->count[BLK_RW_SYNC]) && !(rl->count[BLK_RW_ASYNC]);
112 }