gc.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /*
  3. * fs/f2fs/gc.h
  4. *
  5. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  6. * http://www.samsung.com/
  7. */
  8. #define GC_THREAD_MIN_WB_PAGES 1 /*
  9. * a threshold to determine
  10. * whether IO subsystem is idle
  11. * or not
  12. */
  13. #define DEF_GC_THREAD_URGENT_SLEEP_TIME 500 /* 500 ms */
  14. #define DEF_GC_THREAD_MIN_SLEEP_TIME 30000 /* milliseconds */
  15. #define DEF_GC_THREAD_MAX_SLEEP_TIME 60000
  16. #define DEF_GC_THREAD_NOGC_SLEEP_TIME 300000 /* wait 5 min */
  17. /* choose candidates from sections which has age of more than 7 days */
  18. #define DEF_GC_THREAD_AGE_THRESHOLD (60 * 60 * 24 * 7)
  19. #define DEF_GC_THREAD_CANDIDATE_RATIO 20 /* select 20% oldest sections as candidates */
  20. #define DEF_GC_THREAD_MAX_CANDIDATE_COUNT 10 /* select at most 10 sections as candidates */
  21. #define DEF_GC_THREAD_AGE_WEIGHT 60 /* age weight */
  22. #define DEFAULT_ACCURACY_CLASS 10000 /* accuracy class */
  23. #define LIMIT_INVALID_BLOCK 40 /* percentage over total user space */
  24. #define LIMIT_FREE_BLOCK 40 /* percentage over invalid + free space */
  25. #define DEF_GC_FAILED_PINNED_FILES 2048
  26. /* Search max. number of dirty segments to select a victim segment */
  27. #define DEF_MAX_VICTIM_SEARCH 4096 /* covers 8GB */
  28. #define NR_GC_CHECKPOINT_SECS (3) /* data/node/dentry sections */
  29. struct f2fs_gc_kthread {
  30. struct task_struct *f2fs_gc_task;
  31. wait_queue_head_t gc_wait_queue_head;
  32. /* for gc sleep time */
  33. unsigned int urgent_sleep_time;
  34. unsigned int min_sleep_time;
  35. unsigned int max_sleep_time;
  36. unsigned int no_gc_sleep_time;
  37. /* for changing gc mode */
  38. bool gc_wake;
  39. /* for GC_MERGE mount option */
  40. wait_queue_head_t fggc_wq; /*
  41. * caller of f2fs_balance_fs()
  42. * will wait on this wait queue.
  43. */
  44. };
  45. struct gc_inode_list {
  46. struct list_head ilist;
  47. struct radix_tree_root iroot;
  48. };
  49. struct victim_entry {
  50. struct rb_node rb_node; /* rb node located in rb-tree */
  51. unsigned long long mtime; /* mtime of section */
  52. unsigned int segno; /* segment No. */
  53. struct list_head list;
  54. };
  55. /*
  56. * inline functions
  57. */
  58. /*
  59. * On a Zoned device zone-capacity can be less than zone-size and if
  60. * zone-capacity is not aligned to f2fs segment size(2MB), then the segment
  61. * starting just before zone-capacity has some blocks spanning across the
  62. * zone-capacity, these blocks are not usable.
  63. * Such spanning segments can be in free list so calculate the sum of usable
  64. * blocks in currently free segments including normal and spanning segments.
  65. */
  66. static inline block_t free_segs_blk_count_zoned(struct f2fs_sb_info *sbi)
  67. {
  68. block_t free_seg_blks = 0;
  69. struct free_segmap_info *free_i = FREE_I(sbi);
  70. int j;
  71. spin_lock(&free_i->segmap_lock);
  72. for (j = 0; j < MAIN_SEGS(sbi); j++)
  73. if (!test_bit(j, free_i->free_segmap))
  74. free_seg_blks += f2fs_usable_blks_in_seg(sbi, j);
  75. spin_unlock(&free_i->segmap_lock);
  76. return free_seg_blks;
  77. }
  78. static inline block_t free_segs_blk_count(struct f2fs_sb_info *sbi)
  79. {
  80. if (f2fs_sb_has_blkzoned(sbi))
  81. return free_segs_blk_count_zoned(sbi);
  82. return free_segments(sbi) << sbi->log_blocks_per_seg;
  83. }
  84. static inline block_t free_user_blocks(struct f2fs_sb_info *sbi)
  85. {
  86. block_t free_blks, ovp_blks;
  87. free_blks = free_segs_blk_count(sbi);
  88. ovp_blks = overprovision_segments(sbi) << sbi->log_blocks_per_seg;
  89. if (free_blks < ovp_blks)
  90. return 0;
  91. return free_blks - ovp_blks;
  92. }
  93. static inline block_t limit_invalid_user_blocks(block_t user_block_count)
  94. {
  95. return (long)(user_block_count * LIMIT_INVALID_BLOCK) / 100;
  96. }
  97. static inline block_t limit_free_user_blocks(block_t reclaimable_user_blocks)
  98. {
  99. return (long)(reclaimable_user_blocks * LIMIT_FREE_BLOCK) / 100;
  100. }
  101. static inline void increase_sleep_time(struct f2fs_gc_kthread *gc_th,
  102. unsigned int *wait)
  103. {
  104. unsigned int min_time = gc_th->min_sleep_time;
  105. unsigned int max_time = gc_th->max_sleep_time;
  106. if (*wait == gc_th->no_gc_sleep_time)
  107. return;
  108. if ((long long)*wait + (long long)min_time > (long long)max_time)
  109. *wait = max_time;
  110. else
  111. *wait += min_time;
  112. }
  113. static inline void decrease_sleep_time(struct f2fs_gc_kthread *gc_th,
  114. unsigned int *wait)
  115. {
  116. unsigned int min_time = gc_th->min_sleep_time;
  117. if (*wait == gc_th->no_gc_sleep_time)
  118. *wait = gc_th->max_sleep_time;
  119. if ((long long)*wait - (long long)min_time < (long long)min_time)
  120. *wait = min_time;
  121. else
  122. *wait -= min_time;
  123. }
  124. static inline bool has_enough_invalid_blocks(struct f2fs_sb_info *sbi)
  125. {
  126. block_t user_block_count = sbi->user_block_count;
  127. block_t invalid_user_blocks = user_block_count -
  128. written_block_count(sbi);
  129. /*
  130. * Background GC is triggered with the following conditions.
  131. * 1. There are a number of invalid blocks.
  132. * 2. There is not enough free space.
  133. */
  134. return (invalid_user_blocks >
  135. limit_invalid_user_blocks(user_block_count) &&
  136. free_user_blocks(sbi) <
  137. limit_free_user_blocks(invalid_user_blocks));
  138. }