gc.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695
  1. /*
  2. * fs/f2fs/gc.c
  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. #include <linux/fs.h>
  12. #include <linux/module.h>
  13. #include <linux/backing-dev.h>
  14. #include <linux/proc_fs.h>
  15. #include <linux/init.h>
  16. #include <linux/f2fs_fs.h>
  17. #include <linux/kthread.h>
  18. #include <linux/delay.h>
  19. #include <linux/freezer.h>
  20. #include <linux/blkdev.h>
  21. #include "f2fs.h"
  22. #include "node.h"
  23. #include "segment.h"
  24. #include "gc.h"
  25. static struct kmem_cache *winode_slab;
  26. static int gc_thread_func(void *data)
  27. {
  28. struct f2fs_sb_info *sbi = data;
  29. wait_queue_head_t *wq = &sbi->gc_thread->gc_wait_queue_head;
  30. long wait_ms;
  31. wait_ms = GC_THREAD_MIN_SLEEP_TIME;
  32. do {
  33. if (try_to_freeze())
  34. continue;
  35. else
  36. wait_event_interruptible_timeout(*wq,
  37. kthread_should_stop(),
  38. msecs_to_jiffies(wait_ms));
  39. if (kthread_should_stop())
  40. break;
  41. if (sbi->sb->s_writers.frozen >= SB_FREEZE_WRITE) {
  42. wait_ms = GC_THREAD_MAX_SLEEP_TIME;
  43. continue;
  44. }
  45. /*
  46. * [GC triggering condition]
  47. * 0. GC is not conducted currently.
  48. * 1. There are enough dirty segments.
  49. * 2. IO subsystem is idle by checking the # of writeback pages.
  50. * 3. IO subsystem is idle by checking the # of requests in
  51. * bdev's request list.
  52. *
  53. * Note) We have to avoid triggering GCs too much frequently.
  54. * Because it is possible that some segments can be
  55. * invalidated soon after by user update or deletion.
  56. * So, I'd like to wait some time to collect dirty segments.
  57. */
  58. if (!mutex_trylock(&sbi->gc_mutex))
  59. continue;
  60. if (!is_idle(sbi)) {
  61. wait_ms = increase_sleep_time(wait_ms);
  62. mutex_unlock(&sbi->gc_mutex);
  63. continue;
  64. }
  65. if (has_enough_invalid_blocks(sbi))
  66. wait_ms = decrease_sleep_time(wait_ms);
  67. else
  68. wait_ms = increase_sleep_time(wait_ms);
  69. sbi->bg_gc++;
  70. /* if return value is not zero, no victim was selected */
  71. if (f2fs_gc(sbi))
  72. wait_ms = GC_THREAD_NOGC_SLEEP_TIME;
  73. else if (wait_ms == GC_THREAD_NOGC_SLEEP_TIME)
  74. wait_ms = GC_THREAD_MAX_SLEEP_TIME;
  75. } while (!kthread_should_stop());
  76. return 0;
  77. }
  78. int start_gc_thread(struct f2fs_sb_info *sbi)
  79. {
  80. struct f2fs_gc_kthread *gc_th;
  81. dev_t dev = sbi->sb->s_bdev->bd_dev;
  82. if (!test_opt(sbi, BG_GC))
  83. return 0;
  84. gc_th = kmalloc(sizeof(struct f2fs_gc_kthread), GFP_KERNEL);
  85. if (!gc_th)
  86. return -ENOMEM;
  87. sbi->gc_thread = gc_th;
  88. init_waitqueue_head(&sbi->gc_thread->gc_wait_queue_head);
  89. sbi->gc_thread->f2fs_gc_task = kthread_run(gc_thread_func, sbi,
  90. "f2fs_gc-%u:%u", MAJOR(dev), MINOR(dev));
  91. if (IS_ERR(gc_th->f2fs_gc_task)) {
  92. kfree(gc_th);
  93. sbi->gc_thread = NULL;
  94. return -ENOMEM;
  95. }
  96. return 0;
  97. }
  98. void stop_gc_thread(struct f2fs_sb_info *sbi)
  99. {
  100. struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
  101. if (!gc_th)
  102. return;
  103. kthread_stop(gc_th->f2fs_gc_task);
  104. kfree(gc_th);
  105. sbi->gc_thread = NULL;
  106. }
  107. static int select_gc_type(int gc_type)
  108. {
  109. return (gc_type == BG_GC) ? GC_CB : GC_GREEDY;
  110. }
  111. static void select_policy(struct f2fs_sb_info *sbi, int gc_type,
  112. int type, struct victim_sel_policy *p)
  113. {
  114. struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
  115. if (p->alloc_mode) {
  116. p->gc_mode = GC_GREEDY;
  117. p->dirty_segmap = dirty_i->dirty_segmap[type];
  118. p->ofs_unit = 1;
  119. } else {
  120. p->gc_mode = select_gc_type(gc_type);
  121. p->dirty_segmap = dirty_i->dirty_segmap[DIRTY];
  122. p->ofs_unit = sbi->segs_per_sec;
  123. }
  124. p->offset = sbi->last_victim[p->gc_mode];
  125. }
  126. static unsigned int get_max_cost(struct f2fs_sb_info *sbi,
  127. struct victim_sel_policy *p)
  128. {
  129. if (p->gc_mode == GC_GREEDY)
  130. return (1 << sbi->log_blocks_per_seg) * p->ofs_unit;
  131. else if (p->gc_mode == GC_CB)
  132. return UINT_MAX;
  133. else /* No other gc_mode */
  134. return 0;
  135. }
  136. static unsigned int check_bg_victims(struct f2fs_sb_info *sbi)
  137. {
  138. struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
  139. unsigned int segno;
  140. /*
  141. * If the gc_type is FG_GC, we can select victim segments
  142. * selected by background GC before.
  143. * Those segments guarantee they have small valid blocks.
  144. */
  145. segno = find_next_bit(dirty_i->victim_segmap[BG_GC],
  146. TOTAL_SEGS(sbi), 0);
  147. if (segno < TOTAL_SEGS(sbi)) {
  148. clear_bit(segno, dirty_i->victim_segmap[BG_GC]);
  149. return segno;
  150. }
  151. return NULL_SEGNO;
  152. }
  153. static unsigned int get_cb_cost(struct f2fs_sb_info *sbi, unsigned int segno)
  154. {
  155. struct sit_info *sit_i = SIT_I(sbi);
  156. unsigned int secno = GET_SECNO(sbi, segno);
  157. unsigned int start = secno * sbi->segs_per_sec;
  158. unsigned long long mtime = 0;
  159. unsigned int vblocks;
  160. unsigned char age = 0;
  161. unsigned char u;
  162. unsigned int i;
  163. for (i = 0; i < sbi->segs_per_sec; i++)
  164. mtime += get_seg_entry(sbi, start + i)->mtime;
  165. vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  166. mtime = div_u64(mtime, sbi->segs_per_sec);
  167. vblocks = div_u64(vblocks, sbi->segs_per_sec);
  168. u = (vblocks * 100) >> sbi->log_blocks_per_seg;
  169. /* Handle if the system time is changed by user */
  170. if (mtime < sit_i->min_mtime)
  171. sit_i->min_mtime = mtime;
  172. if (mtime > sit_i->max_mtime)
  173. sit_i->max_mtime = mtime;
  174. if (sit_i->max_mtime != sit_i->min_mtime)
  175. age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime),
  176. sit_i->max_mtime - sit_i->min_mtime);
  177. return UINT_MAX - ((100 * (100 - u) * age) / (100 + u));
  178. }
  179. static unsigned int get_gc_cost(struct f2fs_sb_info *sbi, unsigned int segno,
  180. struct victim_sel_policy *p)
  181. {
  182. if (p->alloc_mode == SSR)
  183. return get_seg_entry(sbi, segno)->ckpt_valid_blocks;
  184. /* alloc_mode == LFS */
  185. if (p->gc_mode == GC_GREEDY)
  186. return get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  187. else
  188. return get_cb_cost(sbi, segno);
  189. }
  190. /*
  191. * This function is called from two pathes.
  192. * One is garbage collection and the other is SSR segment selection.
  193. * When it is called during GC, it just gets a victim segment
  194. * and it does not remove it from dirty seglist.
  195. * When it is called from SSR segment selection, it finds a segment
  196. * which has minimum valid blocks and removes it from dirty seglist.
  197. */
  198. static int get_victim_by_default(struct f2fs_sb_info *sbi,
  199. unsigned int *result, int gc_type, int type, char alloc_mode)
  200. {
  201. struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
  202. struct victim_sel_policy p;
  203. unsigned int segno;
  204. int nsearched = 0;
  205. p.alloc_mode = alloc_mode;
  206. select_policy(sbi, gc_type, type, &p);
  207. p.min_segno = NULL_SEGNO;
  208. p.min_cost = get_max_cost(sbi, &p);
  209. mutex_lock(&dirty_i->seglist_lock);
  210. if (p.alloc_mode == LFS && gc_type == FG_GC) {
  211. p.min_segno = check_bg_victims(sbi);
  212. if (p.min_segno != NULL_SEGNO)
  213. goto got_it;
  214. }
  215. while (1) {
  216. unsigned long cost;
  217. segno = find_next_bit(p.dirty_segmap,
  218. TOTAL_SEGS(sbi), p.offset);
  219. if (segno >= TOTAL_SEGS(sbi)) {
  220. if (sbi->last_victim[p.gc_mode]) {
  221. sbi->last_victim[p.gc_mode] = 0;
  222. p.offset = 0;
  223. continue;
  224. }
  225. break;
  226. }
  227. p.offset = ((segno / p.ofs_unit) * p.ofs_unit) + p.ofs_unit;
  228. if (test_bit(segno, dirty_i->victim_segmap[FG_GC]))
  229. continue;
  230. if (gc_type == BG_GC &&
  231. test_bit(segno, dirty_i->victim_segmap[BG_GC]))
  232. continue;
  233. if (IS_CURSEC(sbi, GET_SECNO(sbi, segno)))
  234. continue;
  235. cost = get_gc_cost(sbi, segno, &p);
  236. if (p.min_cost > cost) {
  237. p.min_segno = segno;
  238. p.min_cost = cost;
  239. }
  240. if (cost == get_max_cost(sbi, &p))
  241. continue;
  242. if (nsearched++ >= MAX_VICTIM_SEARCH) {
  243. sbi->last_victim[p.gc_mode] = segno;
  244. break;
  245. }
  246. }
  247. got_it:
  248. if (p.min_segno != NULL_SEGNO) {
  249. *result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
  250. if (p.alloc_mode == LFS) {
  251. int i;
  252. for (i = 0; i < p.ofs_unit; i++)
  253. set_bit(*result + i,
  254. dirty_i->victim_segmap[gc_type]);
  255. }
  256. }
  257. mutex_unlock(&dirty_i->seglist_lock);
  258. return (p.min_segno == NULL_SEGNO) ? 0 : 1;
  259. }
  260. static const struct victim_selection default_v_ops = {
  261. .get_victim = get_victim_by_default,
  262. };
  263. static struct inode *find_gc_inode(nid_t ino, struct list_head *ilist)
  264. {
  265. struct list_head *this;
  266. struct inode_entry *ie;
  267. list_for_each(this, ilist) {
  268. ie = list_entry(this, struct inode_entry, list);
  269. if (ie->inode->i_ino == ino)
  270. return ie->inode;
  271. }
  272. return NULL;
  273. }
  274. static void add_gc_inode(struct inode *inode, struct list_head *ilist)
  275. {
  276. struct list_head *this;
  277. struct inode_entry *new_ie, *ie;
  278. list_for_each(this, ilist) {
  279. ie = list_entry(this, struct inode_entry, list);
  280. if (ie->inode == inode) {
  281. iput(inode);
  282. return;
  283. }
  284. }
  285. repeat:
  286. new_ie = kmem_cache_alloc(winode_slab, GFP_NOFS);
  287. if (!new_ie) {
  288. cond_resched();
  289. goto repeat;
  290. }
  291. new_ie->inode = inode;
  292. list_add_tail(&new_ie->list, ilist);
  293. }
  294. static void put_gc_inode(struct list_head *ilist)
  295. {
  296. struct inode_entry *ie, *next_ie;
  297. list_for_each_entry_safe(ie, next_ie, ilist, list) {
  298. iput(ie->inode);
  299. list_del(&ie->list);
  300. kmem_cache_free(winode_slab, ie);
  301. }
  302. }
  303. static int check_valid_map(struct f2fs_sb_info *sbi,
  304. unsigned int segno, int offset)
  305. {
  306. struct sit_info *sit_i = SIT_I(sbi);
  307. struct seg_entry *sentry;
  308. int ret;
  309. mutex_lock(&sit_i->sentry_lock);
  310. sentry = get_seg_entry(sbi, segno);
  311. ret = f2fs_test_bit(offset, sentry->cur_valid_map);
  312. mutex_unlock(&sit_i->sentry_lock);
  313. return ret;
  314. }
  315. /*
  316. * This function compares node address got in summary with that in NAT.
  317. * On validity, copy that node with cold status, otherwise (invalid node)
  318. * ignore that.
  319. */
  320. static void gc_node_segment(struct f2fs_sb_info *sbi,
  321. struct f2fs_summary *sum, unsigned int segno, int gc_type)
  322. {
  323. bool initial = true;
  324. struct f2fs_summary *entry;
  325. int off;
  326. next_step:
  327. entry = sum;
  328. for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
  329. nid_t nid = le32_to_cpu(entry->nid);
  330. struct page *node_page;
  331. /* stop BG_GC if there is not enough free sections. */
  332. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
  333. return;
  334. if (check_valid_map(sbi, segno, off) == 0)
  335. continue;
  336. if (initial) {
  337. ra_node_page(sbi, nid);
  338. continue;
  339. }
  340. node_page = get_node_page(sbi, nid);
  341. if (IS_ERR(node_page))
  342. continue;
  343. /* set page dirty and write it */
  344. if (!PageWriteback(node_page))
  345. set_page_dirty(node_page);
  346. f2fs_put_page(node_page, 1);
  347. stat_inc_node_blk_count(sbi, 1);
  348. }
  349. if (initial) {
  350. initial = false;
  351. goto next_step;
  352. }
  353. if (gc_type == FG_GC) {
  354. struct writeback_control wbc = {
  355. .sync_mode = WB_SYNC_ALL,
  356. .nr_to_write = LONG_MAX,
  357. .for_reclaim = 0,
  358. };
  359. sync_node_pages(sbi, 0, &wbc);
  360. }
  361. }
  362. /*
  363. * Calculate start block index indicating the given node offset.
  364. * Be careful, caller should give this node offset only indicating direct node
  365. * blocks. If any node offsets, which point the other types of node blocks such
  366. * as indirect or double indirect node blocks, are given, it must be a caller's
  367. * bug.
  368. */
  369. block_t start_bidx_of_node(unsigned int node_ofs)
  370. {
  371. unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
  372. unsigned int bidx;
  373. if (node_ofs == 0)
  374. return 0;
  375. if (node_ofs <= 2) {
  376. bidx = node_ofs - 1;
  377. } else if (node_ofs <= indirect_blks) {
  378. int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
  379. bidx = node_ofs - 2 - dec;
  380. } else {
  381. int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
  382. bidx = node_ofs - 5 - dec;
  383. }
  384. return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE;
  385. }
  386. static int check_dnode(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
  387. struct node_info *dni, block_t blkaddr, unsigned int *nofs)
  388. {
  389. struct page *node_page;
  390. nid_t nid;
  391. unsigned int ofs_in_node;
  392. block_t source_blkaddr;
  393. nid = le32_to_cpu(sum->nid);
  394. ofs_in_node = le16_to_cpu(sum->ofs_in_node);
  395. node_page = get_node_page(sbi, nid);
  396. if (IS_ERR(node_page))
  397. return 0;
  398. get_node_info(sbi, nid, dni);
  399. if (sum->version != dni->version) {
  400. f2fs_put_page(node_page, 1);
  401. return 0;
  402. }
  403. *nofs = ofs_of_node(node_page);
  404. source_blkaddr = datablock_addr(node_page, ofs_in_node);
  405. f2fs_put_page(node_page, 1);
  406. if (source_blkaddr != blkaddr)
  407. return 0;
  408. return 1;
  409. }
  410. static void move_data_page(struct inode *inode, struct page *page, int gc_type)
  411. {
  412. if (page->mapping != inode->i_mapping)
  413. goto out;
  414. if (inode != page->mapping->host)
  415. goto out;
  416. if (PageWriteback(page))
  417. goto out;
  418. if (gc_type == BG_GC) {
  419. set_page_dirty(page);
  420. set_cold_data(page);
  421. } else {
  422. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  423. mutex_lock_op(sbi, DATA_WRITE);
  424. if (clear_page_dirty_for_io(page) &&
  425. S_ISDIR(inode->i_mode)) {
  426. dec_page_count(sbi, F2FS_DIRTY_DENTS);
  427. inode_dec_dirty_dents(inode);
  428. }
  429. set_cold_data(page);
  430. do_write_data_page(page);
  431. mutex_unlock_op(sbi, DATA_WRITE);
  432. clear_cold_data(page);
  433. }
  434. out:
  435. f2fs_put_page(page, 1);
  436. }
  437. /*
  438. * This function tries to get parent node of victim data block, and identifies
  439. * data block validity. If the block is valid, copy that with cold status and
  440. * modify parent node.
  441. * If the parent node is not valid or the data block address is different,
  442. * the victim data block is ignored.
  443. */
  444. static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
  445. struct list_head *ilist, unsigned int segno, int gc_type)
  446. {
  447. struct super_block *sb = sbi->sb;
  448. struct f2fs_summary *entry;
  449. block_t start_addr;
  450. int off;
  451. int phase = 0;
  452. start_addr = START_BLOCK(sbi, segno);
  453. next_step:
  454. entry = sum;
  455. for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
  456. struct page *data_page;
  457. struct inode *inode;
  458. struct node_info dni; /* dnode info for the data */
  459. unsigned int ofs_in_node, nofs;
  460. block_t start_bidx;
  461. /* stop BG_GC if there is not enough free sections. */
  462. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
  463. return;
  464. if (check_valid_map(sbi, segno, off) == 0)
  465. continue;
  466. if (phase == 0) {
  467. ra_node_page(sbi, le32_to_cpu(entry->nid));
  468. continue;
  469. }
  470. /* Get an inode by ino with checking validity */
  471. if (check_dnode(sbi, entry, &dni, start_addr + off, &nofs) == 0)
  472. continue;
  473. if (phase == 1) {
  474. ra_node_page(sbi, dni.ino);
  475. continue;
  476. }
  477. start_bidx = start_bidx_of_node(nofs);
  478. ofs_in_node = le16_to_cpu(entry->ofs_in_node);
  479. if (phase == 2) {
  480. inode = f2fs_iget(sb, dni.ino);
  481. if (IS_ERR(inode))
  482. continue;
  483. data_page = find_data_page(inode,
  484. start_bidx + ofs_in_node);
  485. if (IS_ERR(data_page))
  486. goto next_iput;
  487. f2fs_put_page(data_page, 0);
  488. add_gc_inode(inode, ilist);
  489. } else {
  490. inode = find_gc_inode(dni.ino, ilist);
  491. if (inode) {
  492. data_page = get_lock_data_page(inode,
  493. start_bidx + ofs_in_node);
  494. if (IS_ERR(data_page))
  495. continue;
  496. move_data_page(inode, data_page, gc_type);
  497. stat_inc_data_blk_count(sbi, 1);
  498. }
  499. }
  500. continue;
  501. next_iput:
  502. iput(inode);
  503. }
  504. if (++phase < 4)
  505. goto next_step;
  506. if (gc_type == FG_GC)
  507. f2fs_submit_bio(sbi, DATA, true);
  508. }
  509. static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
  510. int gc_type, int type)
  511. {
  512. struct sit_info *sit_i = SIT_I(sbi);
  513. int ret;
  514. mutex_lock(&sit_i->sentry_lock);
  515. ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type, type, LFS);
  516. mutex_unlock(&sit_i->sentry_lock);
  517. return ret;
  518. }
  519. static void do_garbage_collect(struct f2fs_sb_info *sbi, unsigned int segno,
  520. struct list_head *ilist, int gc_type)
  521. {
  522. struct page *sum_page;
  523. struct f2fs_summary_block *sum;
  524. /* read segment summary of victim */
  525. sum_page = get_sum_page(sbi, segno);
  526. if (IS_ERR(sum_page))
  527. return;
  528. /*
  529. * CP needs to lock sum_page. In this time, we don't need
  530. * to lock this page, because this summary page is not gone anywhere.
  531. * Also, this page is not gonna be updated before GC is done.
  532. */
  533. unlock_page(sum_page);
  534. sum = page_address(sum_page);
  535. switch (GET_SUM_TYPE((&sum->footer))) {
  536. case SUM_TYPE_NODE:
  537. gc_node_segment(sbi, sum->entries, segno, gc_type);
  538. break;
  539. case SUM_TYPE_DATA:
  540. gc_data_segment(sbi, sum->entries, ilist, segno, gc_type);
  541. break;
  542. }
  543. stat_inc_seg_count(sbi, GET_SUM_TYPE((&sum->footer)));
  544. stat_inc_call_count(sbi->stat_info);
  545. f2fs_put_page(sum_page, 0);
  546. }
  547. int f2fs_gc(struct f2fs_sb_info *sbi)
  548. {
  549. struct list_head ilist;
  550. unsigned int segno, i;
  551. int gc_type = BG_GC;
  552. int nfree = 0;
  553. int ret = -1;
  554. INIT_LIST_HEAD(&ilist);
  555. gc_more:
  556. if (!(sbi->sb->s_flags & MS_ACTIVE))
  557. goto stop;
  558. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, nfree))
  559. gc_type = FG_GC;
  560. if (!__get_victim(sbi, &segno, gc_type, NO_CHECK_TYPE))
  561. goto stop;
  562. ret = 0;
  563. for (i = 0; i < sbi->segs_per_sec; i++)
  564. do_garbage_collect(sbi, segno + i, &ilist, gc_type);
  565. if (gc_type == FG_GC &&
  566. get_valid_blocks(sbi, segno, sbi->segs_per_sec) == 0)
  567. nfree++;
  568. if (has_not_enough_free_secs(sbi, nfree))
  569. goto gc_more;
  570. if (gc_type == FG_GC)
  571. write_checkpoint(sbi, false);
  572. stop:
  573. mutex_unlock(&sbi->gc_mutex);
  574. put_gc_inode(&ilist);
  575. return ret;
  576. }
  577. void build_gc_manager(struct f2fs_sb_info *sbi)
  578. {
  579. DIRTY_I(sbi)->v_ops = &default_v_ops;
  580. }
  581. int __init create_gc_caches(void)
  582. {
  583. winode_slab = f2fs_kmem_cache_create("f2fs_gc_inodes",
  584. sizeof(struct inode_entry), NULL);
  585. if (!winode_slab)
  586. return -ENOMEM;
  587. return 0;
  588. }
  589. void destroy_gc_caches(void)
  590. {
  591. kmem_cache_destroy(winode_slab);
  592. }