gc.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703
  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. /* SSR allocates in a segment unit */
  130. if (p->alloc_mode == SSR)
  131. return 1 << sbi->log_blocks_per_seg;
  132. if (p->gc_mode == GC_GREEDY)
  133. return (1 << sbi->log_blocks_per_seg) * p->ofs_unit;
  134. else if (p->gc_mode == GC_CB)
  135. return UINT_MAX;
  136. else /* No other gc_mode */
  137. return 0;
  138. }
  139. static unsigned int check_bg_victims(struct f2fs_sb_info *sbi)
  140. {
  141. struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
  142. unsigned int hint = 0;
  143. unsigned int secno;
  144. /*
  145. * If the gc_type is FG_GC, we can select victim segments
  146. * selected by background GC before.
  147. * Those segments guarantee they have small valid blocks.
  148. */
  149. next:
  150. secno = find_next_bit(dirty_i->victim_secmap, TOTAL_SECS(sbi), hint++);
  151. if (secno < TOTAL_SECS(sbi)) {
  152. if (sec_usage_check(sbi, secno))
  153. goto next;
  154. clear_bit(secno, dirty_i->victim_secmap);
  155. return secno * sbi->segs_per_sec;
  156. }
  157. return NULL_SEGNO;
  158. }
  159. static unsigned int get_cb_cost(struct f2fs_sb_info *sbi, unsigned int segno)
  160. {
  161. struct sit_info *sit_i = SIT_I(sbi);
  162. unsigned int secno = GET_SECNO(sbi, segno);
  163. unsigned int start = secno * sbi->segs_per_sec;
  164. unsigned long long mtime = 0;
  165. unsigned int vblocks;
  166. unsigned char age = 0;
  167. unsigned char u;
  168. unsigned int i;
  169. for (i = 0; i < sbi->segs_per_sec; i++)
  170. mtime += get_seg_entry(sbi, start + i)->mtime;
  171. vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  172. mtime = div_u64(mtime, sbi->segs_per_sec);
  173. vblocks = div_u64(vblocks, sbi->segs_per_sec);
  174. u = (vblocks * 100) >> sbi->log_blocks_per_seg;
  175. /* Handle if the system time is changed by user */
  176. if (mtime < sit_i->min_mtime)
  177. sit_i->min_mtime = mtime;
  178. if (mtime > sit_i->max_mtime)
  179. sit_i->max_mtime = mtime;
  180. if (sit_i->max_mtime != sit_i->min_mtime)
  181. age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime),
  182. sit_i->max_mtime - sit_i->min_mtime);
  183. return UINT_MAX - ((100 * (100 - u) * age) / (100 + u));
  184. }
  185. static unsigned int get_gc_cost(struct f2fs_sb_info *sbi, unsigned int segno,
  186. struct victim_sel_policy *p)
  187. {
  188. if (p->alloc_mode == SSR)
  189. return get_seg_entry(sbi, segno)->ckpt_valid_blocks;
  190. /* alloc_mode == LFS */
  191. if (p->gc_mode == GC_GREEDY)
  192. return get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  193. else
  194. return get_cb_cost(sbi, segno);
  195. }
  196. /*
  197. * This function is called from two paths.
  198. * One is garbage collection and the other is SSR segment selection.
  199. * When it is called during GC, it just gets a victim segment
  200. * and it does not remove it from dirty seglist.
  201. * When it is called from SSR segment selection, it finds a segment
  202. * which has minimum valid blocks and removes it from dirty seglist.
  203. */
  204. static int get_victim_by_default(struct f2fs_sb_info *sbi,
  205. unsigned int *result, int gc_type, int type, char alloc_mode)
  206. {
  207. struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
  208. struct victim_sel_policy p;
  209. unsigned int secno;
  210. int nsearched = 0;
  211. p.alloc_mode = alloc_mode;
  212. select_policy(sbi, gc_type, type, &p);
  213. p.min_segno = NULL_SEGNO;
  214. p.min_cost = get_max_cost(sbi, &p);
  215. mutex_lock(&dirty_i->seglist_lock);
  216. if (p.alloc_mode == LFS && gc_type == FG_GC) {
  217. p.min_segno = check_bg_victims(sbi);
  218. if (p.min_segno != NULL_SEGNO)
  219. goto got_it;
  220. }
  221. while (1) {
  222. unsigned long cost;
  223. unsigned int segno;
  224. segno = find_next_bit(p.dirty_segmap,
  225. TOTAL_SEGS(sbi), p.offset);
  226. if (segno >= TOTAL_SEGS(sbi)) {
  227. if (sbi->last_victim[p.gc_mode]) {
  228. sbi->last_victim[p.gc_mode] = 0;
  229. p.offset = 0;
  230. continue;
  231. }
  232. break;
  233. }
  234. p.offset = ((segno / p.ofs_unit) * p.ofs_unit) + p.ofs_unit;
  235. secno = GET_SECNO(sbi, segno);
  236. if (sec_usage_check(sbi, secno))
  237. continue;
  238. if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
  239. continue;
  240. cost = get_gc_cost(sbi, segno, &p);
  241. if (p.min_cost > cost) {
  242. p.min_segno = segno;
  243. p.min_cost = cost;
  244. }
  245. if (cost == get_max_cost(sbi, &p))
  246. continue;
  247. if (nsearched++ >= MAX_VICTIM_SEARCH) {
  248. sbi->last_victim[p.gc_mode] = segno;
  249. break;
  250. }
  251. }
  252. got_it:
  253. if (p.min_segno != NULL_SEGNO) {
  254. if (p.alloc_mode == LFS) {
  255. secno = GET_SECNO(sbi, p.min_segno);
  256. if (gc_type == FG_GC)
  257. sbi->cur_victim_sec = secno;
  258. else
  259. set_bit(secno, dirty_i->victim_secmap);
  260. }
  261. *result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
  262. }
  263. mutex_unlock(&dirty_i->seglist_lock);
  264. return (p.min_segno == NULL_SEGNO) ? 0 : 1;
  265. }
  266. static const struct victim_selection default_v_ops = {
  267. .get_victim = get_victim_by_default,
  268. };
  269. static struct inode *find_gc_inode(nid_t ino, struct list_head *ilist)
  270. {
  271. struct list_head *this;
  272. struct inode_entry *ie;
  273. list_for_each(this, ilist) {
  274. ie = list_entry(this, struct inode_entry, list);
  275. if (ie->inode->i_ino == ino)
  276. return ie->inode;
  277. }
  278. return NULL;
  279. }
  280. static void add_gc_inode(struct inode *inode, struct list_head *ilist)
  281. {
  282. struct list_head *this;
  283. struct inode_entry *new_ie, *ie;
  284. list_for_each(this, ilist) {
  285. ie = list_entry(this, struct inode_entry, list);
  286. if (ie->inode == inode) {
  287. iput(inode);
  288. return;
  289. }
  290. }
  291. repeat:
  292. new_ie = kmem_cache_alloc(winode_slab, GFP_NOFS);
  293. if (!new_ie) {
  294. cond_resched();
  295. goto repeat;
  296. }
  297. new_ie->inode = inode;
  298. list_add_tail(&new_ie->list, ilist);
  299. }
  300. static void put_gc_inode(struct list_head *ilist)
  301. {
  302. struct inode_entry *ie, *next_ie;
  303. list_for_each_entry_safe(ie, next_ie, ilist, list) {
  304. iput(ie->inode);
  305. list_del(&ie->list);
  306. kmem_cache_free(winode_slab, ie);
  307. }
  308. }
  309. static int check_valid_map(struct f2fs_sb_info *sbi,
  310. unsigned int segno, int offset)
  311. {
  312. struct sit_info *sit_i = SIT_I(sbi);
  313. struct seg_entry *sentry;
  314. int ret;
  315. mutex_lock(&sit_i->sentry_lock);
  316. sentry = get_seg_entry(sbi, segno);
  317. ret = f2fs_test_bit(offset, sentry->cur_valid_map);
  318. mutex_unlock(&sit_i->sentry_lock);
  319. return ret;
  320. }
  321. /*
  322. * This function compares node address got in summary with that in NAT.
  323. * On validity, copy that node with cold status, otherwise (invalid node)
  324. * ignore that.
  325. */
  326. static void gc_node_segment(struct f2fs_sb_info *sbi,
  327. struct f2fs_summary *sum, unsigned int segno, int gc_type)
  328. {
  329. bool initial = true;
  330. struct f2fs_summary *entry;
  331. int off;
  332. next_step:
  333. entry = sum;
  334. for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
  335. nid_t nid = le32_to_cpu(entry->nid);
  336. struct page *node_page;
  337. /* stop BG_GC if there is not enough free sections. */
  338. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
  339. return;
  340. if (check_valid_map(sbi, segno, off) == 0)
  341. continue;
  342. if (initial) {
  343. ra_node_page(sbi, nid);
  344. continue;
  345. }
  346. node_page = get_node_page(sbi, nid);
  347. if (IS_ERR(node_page))
  348. continue;
  349. /* set page dirty and write it */
  350. if (!PageWriteback(node_page))
  351. set_page_dirty(node_page);
  352. f2fs_put_page(node_page, 1);
  353. stat_inc_node_blk_count(sbi, 1);
  354. }
  355. if (initial) {
  356. initial = false;
  357. goto next_step;
  358. }
  359. if (gc_type == FG_GC) {
  360. struct writeback_control wbc = {
  361. .sync_mode = WB_SYNC_ALL,
  362. .nr_to_write = LONG_MAX,
  363. .for_reclaim = 0,
  364. };
  365. sync_node_pages(sbi, 0, &wbc);
  366. }
  367. }
  368. /*
  369. * Calculate start block index indicating the given node offset.
  370. * Be careful, caller should give this node offset only indicating direct node
  371. * blocks. If any node offsets, which point the other types of node blocks such
  372. * as indirect or double indirect node blocks, are given, it must be a caller's
  373. * bug.
  374. */
  375. block_t start_bidx_of_node(unsigned int node_ofs)
  376. {
  377. unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
  378. unsigned int bidx;
  379. if (node_ofs == 0)
  380. return 0;
  381. if (node_ofs <= 2) {
  382. bidx = node_ofs - 1;
  383. } else if (node_ofs <= indirect_blks) {
  384. int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
  385. bidx = node_ofs - 2 - dec;
  386. } else {
  387. int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
  388. bidx = node_ofs - 5 - dec;
  389. }
  390. return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE;
  391. }
  392. static int check_dnode(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
  393. struct node_info *dni, block_t blkaddr, unsigned int *nofs)
  394. {
  395. struct page *node_page;
  396. nid_t nid;
  397. unsigned int ofs_in_node;
  398. block_t source_blkaddr;
  399. nid = le32_to_cpu(sum->nid);
  400. ofs_in_node = le16_to_cpu(sum->ofs_in_node);
  401. node_page = get_node_page(sbi, nid);
  402. if (IS_ERR(node_page))
  403. return 0;
  404. get_node_info(sbi, nid, dni);
  405. if (sum->version != dni->version) {
  406. f2fs_put_page(node_page, 1);
  407. return 0;
  408. }
  409. *nofs = ofs_of_node(node_page);
  410. source_blkaddr = datablock_addr(node_page, ofs_in_node);
  411. f2fs_put_page(node_page, 1);
  412. if (source_blkaddr != blkaddr)
  413. return 0;
  414. return 1;
  415. }
  416. static void move_data_page(struct inode *inode, struct page *page, int gc_type)
  417. {
  418. if (page->mapping != inode->i_mapping)
  419. goto out;
  420. if (inode != page->mapping->host)
  421. goto out;
  422. if (PageWriteback(page))
  423. goto out;
  424. if (gc_type == BG_GC) {
  425. set_page_dirty(page);
  426. set_cold_data(page);
  427. } else {
  428. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  429. mutex_lock_op(sbi, DATA_WRITE);
  430. if (clear_page_dirty_for_io(page) &&
  431. S_ISDIR(inode->i_mode)) {
  432. dec_page_count(sbi, F2FS_DIRTY_DENTS);
  433. inode_dec_dirty_dents(inode);
  434. }
  435. set_cold_data(page);
  436. do_write_data_page(page);
  437. mutex_unlock_op(sbi, DATA_WRITE);
  438. clear_cold_data(page);
  439. }
  440. out:
  441. f2fs_put_page(page, 1);
  442. }
  443. /*
  444. * This function tries to get parent node of victim data block, and identifies
  445. * data block validity. If the block is valid, copy that with cold status and
  446. * modify parent node.
  447. * If the parent node is not valid or the data block address is different,
  448. * the victim data block is ignored.
  449. */
  450. static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
  451. struct list_head *ilist, unsigned int segno, int gc_type)
  452. {
  453. struct super_block *sb = sbi->sb;
  454. struct f2fs_summary *entry;
  455. block_t start_addr;
  456. int off;
  457. int phase = 0;
  458. start_addr = START_BLOCK(sbi, segno);
  459. next_step:
  460. entry = sum;
  461. for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
  462. struct page *data_page;
  463. struct inode *inode;
  464. struct node_info dni; /* dnode info for the data */
  465. unsigned int ofs_in_node, nofs;
  466. block_t start_bidx;
  467. /* stop BG_GC if there is not enough free sections. */
  468. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
  469. return;
  470. if (check_valid_map(sbi, segno, off) == 0)
  471. continue;
  472. if (phase == 0) {
  473. ra_node_page(sbi, le32_to_cpu(entry->nid));
  474. continue;
  475. }
  476. /* Get an inode by ino with checking validity */
  477. if (check_dnode(sbi, entry, &dni, start_addr + off, &nofs) == 0)
  478. continue;
  479. if (phase == 1) {
  480. ra_node_page(sbi, dni.ino);
  481. continue;
  482. }
  483. start_bidx = start_bidx_of_node(nofs);
  484. ofs_in_node = le16_to_cpu(entry->ofs_in_node);
  485. if (phase == 2) {
  486. inode = f2fs_iget(sb, dni.ino);
  487. if (IS_ERR(inode))
  488. continue;
  489. data_page = find_data_page(inode,
  490. start_bidx + ofs_in_node);
  491. if (IS_ERR(data_page))
  492. goto next_iput;
  493. f2fs_put_page(data_page, 0);
  494. add_gc_inode(inode, ilist);
  495. } else {
  496. inode = find_gc_inode(dni.ino, ilist);
  497. if (inode) {
  498. data_page = get_lock_data_page(inode,
  499. start_bidx + ofs_in_node);
  500. if (IS_ERR(data_page))
  501. continue;
  502. move_data_page(inode, data_page, gc_type);
  503. stat_inc_data_blk_count(sbi, 1);
  504. }
  505. }
  506. continue;
  507. next_iput:
  508. iput(inode);
  509. }
  510. if (++phase < 4)
  511. goto next_step;
  512. if (gc_type == FG_GC)
  513. f2fs_submit_bio(sbi, DATA, true);
  514. }
  515. static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
  516. int gc_type, int type)
  517. {
  518. struct sit_info *sit_i = SIT_I(sbi);
  519. int ret;
  520. mutex_lock(&sit_i->sentry_lock);
  521. ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type, type, LFS);
  522. mutex_unlock(&sit_i->sentry_lock);
  523. return ret;
  524. }
  525. static void do_garbage_collect(struct f2fs_sb_info *sbi, unsigned int segno,
  526. struct list_head *ilist, int gc_type)
  527. {
  528. struct page *sum_page;
  529. struct f2fs_summary_block *sum;
  530. /* read segment summary of victim */
  531. sum_page = get_sum_page(sbi, segno);
  532. if (IS_ERR(sum_page))
  533. return;
  534. /*
  535. * CP needs to lock sum_page. In this time, we don't need
  536. * to lock this page, because this summary page is not gone anywhere.
  537. * Also, this page is not gonna be updated before GC is done.
  538. */
  539. unlock_page(sum_page);
  540. sum = page_address(sum_page);
  541. switch (GET_SUM_TYPE((&sum->footer))) {
  542. case SUM_TYPE_NODE:
  543. gc_node_segment(sbi, sum->entries, segno, gc_type);
  544. break;
  545. case SUM_TYPE_DATA:
  546. gc_data_segment(sbi, sum->entries, ilist, segno, gc_type);
  547. break;
  548. }
  549. stat_inc_seg_count(sbi, GET_SUM_TYPE((&sum->footer)));
  550. stat_inc_call_count(sbi->stat_info);
  551. f2fs_put_page(sum_page, 0);
  552. }
  553. int f2fs_gc(struct f2fs_sb_info *sbi)
  554. {
  555. struct list_head ilist;
  556. unsigned int segno, i;
  557. int gc_type = BG_GC;
  558. int nfree = 0;
  559. int ret = -1;
  560. INIT_LIST_HEAD(&ilist);
  561. gc_more:
  562. if (!(sbi->sb->s_flags & MS_ACTIVE))
  563. goto stop;
  564. if (gc_type == BG_GC && has_not_enough_free_secs(sbi, nfree))
  565. gc_type = FG_GC;
  566. if (!__get_victim(sbi, &segno, gc_type, NO_CHECK_TYPE))
  567. goto stop;
  568. ret = 0;
  569. for (i = 0; i < sbi->segs_per_sec; i++)
  570. do_garbage_collect(sbi, segno + i, &ilist, gc_type);
  571. if (gc_type == FG_GC) {
  572. sbi->cur_victim_sec = NULL_SEGNO;
  573. nfree++;
  574. WARN_ON(get_valid_blocks(sbi, segno, sbi->segs_per_sec));
  575. }
  576. if (has_not_enough_free_secs(sbi, nfree))
  577. goto gc_more;
  578. if (gc_type == FG_GC)
  579. write_checkpoint(sbi, false);
  580. stop:
  581. mutex_unlock(&sbi->gc_mutex);
  582. put_gc_inode(&ilist);
  583. return ret;
  584. }
  585. void build_gc_manager(struct f2fs_sb_info *sbi)
  586. {
  587. DIRTY_I(sbi)->v_ops = &default_v_ops;
  588. }
  589. int __init create_gc_caches(void)
  590. {
  591. winode_slab = f2fs_kmem_cache_create("f2fs_gc_inodes",
  592. sizeof(struct inode_entry), NULL);
  593. if (!winode_slab)
  594. return -ENOMEM;
  595. return 0;
  596. }
  597. void destroy_gc_caches(void)
  598. {
  599. kmem_cache_destroy(winode_slab);
  600. }