f2fs: add sbi and page pointer in f2fs_io_info
[linux-2.6-block.git] / fs / f2fs / gc.c
CommitLineData
0a8165d7 1/*
7bc09003
JK
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>
7bc09003
JK
14#include <linux/init.h>
15#include <linux/f2fs_fs.h>
16#include <linux/kthread.h>
17#include <linux/delay.h>
18#include <linux/freezer.h>
19#include <linux/blkdev.h>
20
21#include "f2fs.h"
22#include "node.h"
23#include "segment.h"
24#include "gc.h"
8e46b3ed 25#include <trace/events/f2fs.h>
7bc09003 26
7bc09003
JK
27static int gc_thread_func(void *data)
28{
29 struct f2fs_sb_info *sbi = data;
b59d0bae 30 struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
7bc09003
JK
31 wait_queue_head_t *wq = &sbi->gc_thread->gc_wait_queue_head;
32 long wait_ms;
33
b59d0bae 34 wait_ms = gc_th->min_sleep_time;
7bc09003
JK
35
36 do {
37 if (try_to_freeze())
38 continue;
39 else
40 wait_event_interruptible_timeout(*wq,
41 kthread_should_stop(),
42 msecs_to_jiffies(wait_ms));
43 if (kthread_should_stop())
44 break;
45
d6212a5f 46 if (sbi->sb->s_writers.frozen >= SB_FREEZE_WRITE) {
88dd8934 47 increase_sleep_time(gc_th, &wait_ms);
d6212a5f
CL
48 continue;
49 }
50
7bc09003
JK
51 /*
52 * [GC triggering condition]
53 * 0. GC is not conducted currently.
54 * 1. There are enough dirty segments.
55 * 2. IO subsystem is idle by checking the # of writeback pages.
56 * 3. IO subsystem is idle by checking the # of requests in
57 * bdev's request list.
58 *
e1c42045 59 * Note) We have to avoid triggering GCs frequently.
7bc09003
JK
60 * Because it is possible that some segments can be
61 * invalidated soon after by user update or deletion.
62 * So, I'd like to wait some time to collect dirty segments.
63 */
64 if (!mutex_trylock(&sbi->gc_mutex))
65 continue;
66
67 if (!is_idle(sbi)) {
88dd8934 68 increase_sleep_time(gc_th, &wait_ms);
7bc09003
JK
69 mutex_unlock(&sbi->gc_mutex);
70 continue;
71 }
72
73 if (has_enough_invalid_blocks(sbi))
88dd8934 74 decrease_sleep_time(gc_th, &wait_ms);
7bc09003 75 else
88dd8934 76 increase_sleep_time(gc_th, &wait_ms);
7bc09003 77
dcdfff65 78 stat_inc_bggc_count(sbi);
7bc09003 79
43727527
JK
80 /* if return value is not zero, no victim was selected */
81 if (f2fs_gc(sbi))
b59d0bae 82 wait_ms = gc_th->no_gc_sleep_time;
81eb8d6e 83
4660f9c0
JK
84 /* balancing f2fs's metadata periodically */
85 f2fs_balance_fs_bg(sbi);
81eb8d6e 86
7bc09003
JK
87 } while (!kthread_should_stop());
88 return 0;
89}
90
91int start_gc_thread(struct f2fs_sb_info *sbi)
92{
1042d60f 93 struct f2fs_gc_kthread *gc_th;
ec7b1f2d 94 dev_t dev = sbi->sb->s_bdev->bd_dev;
7a267f8d 95 int err = 0;
7bc09003
JK
96
97 gc_th = kmalloc(sizeof(struct f2fs_gc_kthread), GFP_KERNEL);
7a267f8d
NJ
98 if (!gc_th) {
99 err = -ENOMEM;
100 goto out;
101 }
7bc09003 102
b59d0bae
NJ
103 gc_th->min_sleep_time = DEF_GC_THREAD_MIN_SLEEP_TIME;
104 gc_th->max_sleep_time = DEF_GC_THREAD_MAX_SLEEP_TIME;
105 gc_th->no_gc_sleep_time = DEF_GC_THREAD_NOGC_SLEEP_TIME;
106
d2dc095f
NJ
107 gc_th->gc_idle = 0;
108
7bc09003
JK
109 sbi->gc_thread = gc_th;
110 init_waitqueue_head(&sbi->gc_thread->gc_wait_queue_head);
111 sbi->gc_thread->f2fs_gc_task = kthread_run(gc_thread_func, sbi,
ec7b1f2d 112 "f2fs_gc-%u:%u", MAJOR(dev), MINOR(dev));
7bc09003 113 if (IS_ERR(gc_th->f2fs_gc_task)) {
7a267f8d 114 err = PTR_ERR(gc_th->f2fs_gc_task);
7bc09003 115 kfree(gc_th);
25718423 116 sbi->gc_thread = NULL;
7bc09003 117 }
7a267f8d
NJ
118out:
119 return err;
7bc09003
JK
120}
121
122void stop_gc_thread(struct f2fs_sb_info *sbi)
123{
124 struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
125 if (!gc_th)
126 return;
127 kthread_stop(gc_th->f2fs_gc_task);
128 kfree(gc_th);
129 sbi->gc_thread = NULL;
130}
131
d2dc095f 132static int select_gc_type(struct f2fs_gc_kthread *gc_th, int gc_type)
7bc09003 133{
d2dc095f
NJ
134 int gc_mode = (gc_type == BG_GC) ? GC_CB : GC_GREEDY;
135
136 if (gc_th && gc_th->gc_idle) {
137 if (gc_th->gc_idle == 1)
138 gc_mode = GC_CB;
139 else if (gc_th->gc_idle == 2)
140 gc_mode = GC_GREEDY;
141 }
142 return gc_mode;
7bc09003
JK
143}
144
145static void select_policy(struct f2fs_sb_info *sbi, int gc_type,
146 int type, struct victim_sel_policy *p)
147{
148 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
149
4ebefc44 150 if (p->alloc_mode == SSR) {
7bc09003
JK
151 p->gc_mode = GC_GREEDY;
152 p->dirty_segmap = dirty_i->dirty_segmap[type];
a26b7c8a 153 p->max_search = dirty_i->nr_dirty[type];
7bc09003
JK
154 p->ofs_unit = 1;
155 } else {
d2dc095f 156 p->gc_mode = select_gc_type(sbi->gc_thread, gc_type);
7bc09003 157 p->dirty_segmap = dirty_i->dirty_segmap[DIRTY];
a26b7c8a 158 p->max_search = dirty_i->nr_dirty[DIRTY];
7bc09003
JK
159 p->ofs_unit = sbi->segs_per_sec;
160 }
a26b7c8a 161
b1c57c1c
JK
162 if (p->max_search > sbi->max_victim_search)
163 p->max_search = sbi->max_victim_search;
a26b7c8a 164
7bc09003
JK
165 p->offset = sbi->last_victim[p->gc_mode];
166}
167
168static unsigned int get_max_cost(struct f2fs_sb_info *sbi,
169 struct victim_sel_policy *p)
170{
b7250d2d
JK
171 /* SSR allocates in a segment unit */
172 if (p->alloc_mode == SSR)
173 return 1 << sbi->log_blocks_per_seg;
7bc09003
JK
174 if (p->gc_mode == GC_GREEDY)
175 return (1 << sbi->log_blocks_per_seg) * p->ofs_unit;
176 else if (p->gc_mode == GC_CB)
177 return UINT_MAX;
178 else /* No other gc_mode */
179 return 0;
180}
181
182static unsigned int check_bg_victims(struct f2fs_sb_info *sbi)
183{
184 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5ec4e49f 185 unsigned int secno;
7bc09003
JK
186
187 /*
188 * If the gc_type is FG_GC, we can select victim segments
189 * selected by background GC before.
190 * Those segments guarantee they have small valid blocks.
191 */
7cd8558b 192 for_each_set_bit(secno, dirty_i->victim_secmap, MAIN_SECS(sbi)) {
5ec4e49f 193 if (sec_usage_check(sbi, secno))
b65ee148 194 continue;
5ec4e49f
JK
195 clear_bit(secno, dirty_i->victim_secmap);
196 return secno * sbi->segs_per_sec;
7bc09003
JK
197 }
198 return NULL_SEGNO;
199}
200
201static unsigned int get_cb_cost(struct f2fs_sb_info *sbi, unsigned int segno)
202{
203 struct sit_info *sit_i = SIT_I(sbi);
204 unsigned int secno = GET_SECNO(sbi, segno);
205 unsigned int start = secno * sbi->segs_per_sec;
206 unsigned long long mtime = 0;
207 unsigned int vblocks;
208 unsigned char age = 0;
209 unsigned char u;
210 unsigned int i;
211
212 for (i = 0; i < sbi->segs_per_sec; i++)
213 mtime += get_seg_entry(sbi, start + i)->mtime;
214 vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
215
216 mtime = div_u64(mtime, sbi->segs_per_sec);
217 vblocks = div_u64(vblocks, sbi->segs_per_sec);
218
219 u = (vblocks * 100) >> sbi->log_blocks_per_seg;
220
e1c42045 221 /* Handle if the system time has changed by the user */
7bc09003
JK
222 if (mtime < sit_i->min_mtime)
223 sit_i->min_mtime = mtime;
224 if (mtime > sit_i->max_mtime)
225 sit_i->max_mtime = mtime;
226 if (sit_i->max_mtime != sit_i->min_mtime)
227 age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime),
228 sit_i->max_mtime - sit_i->min_mtime);
229
230 return UINT_MAX - ((100 * (100 - u) * age) / (100 + u));
231}
232
a57e564d
JX
233static inline unsigned int get_gc_cost(struct f2fs_sb_info *sbi,
234 unsigned int segno, struct victim_sel_policy *p)
7bc09003
JK
235{
236 if (p->alloc_mode == SSR)
237 return get_seg_entry(sbi, segno)->ckpt_valid_blocks;
238
239 /* alloc_mode == LFS */
240 if (p->gc_mode == GC_GREEDY)
241 return get_valid_blocks(sbi, segno, sbi->segs_per_sec);
242 else
243 return get_cb_cost(sbi, segno);
244}
245
0a8165d7 246/*
111d2495 247 * This function is called from two paths.
7bc09003
JK
248 * One is garbage collection and the other is SSR segment selection.
249 * When it is called during GC, it just gets a victim segment
250 * and it does not remove it from dirty seglist.
251 * When it is called from SSR segment selection, it finds a segment
252 * which has minimum valid blocks and removes it from dirty seglist.
253 */
254static int get_victim_by_default(struct f2fs_sb_info *sbi,
255 unsigned int *result, int gc_type, int type, char alloc_mode)
256{
257 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
258 struct victim_sel_policy p;
b2b3460a 259 unsigned int secno, max_cost;
7bc09003
JK
260 int nsearched = 0;
261
210f41bc
CY
262 mutex_lock(&dirty_i->seglist_lock);
263
7bc09003
JK
264 p.alloc_mode = alloc_mode;
265 select_policy(sbi, gc_type, type, &p);
266
267 p.min_segno = NULL_SEGNO;
b2b3460a 268 p.min_cost = max_cost = get_max_cost(sbi, &p);
7bc09003 269
7bc09003
JK
270 if (p.alloc_mode == LFS && gc_type == FG_GC) {
271 p.min_segno = check_bg_victims(sbi);
272 if (p.min_segno != NULL_SEGNO)
273 goto got_it;
274 }
275
276 while (1) {
277 unsigned long cost;
5ec4e49f 278 unsigned int segno;
7bc09003 279
7cd8558b
JK
280 segno = find_next_bit(p.dirty_segmap, MAIN_SEGS(sbi), p.offset);
281 if (segno >= MAIN_SEGS(sbi)) {
7bc09003
JK
282 if (sbi->last_victim[p.gc_mode]) {
283 sbi->last_victim[p.gc_mode] = 0;
284 p.offset = 0;
285 continue;
286 }
287 break;
288 }
a57e564d
JX
289
290 p.offset = segno + p.ofs_unit;
291 if (p.ofs_unit > 1)
292 p.offset -= segno % p.ofs_unit;
293
5ec4e49f 294 secno = GET_SECNO(sbi, segno);
7bc09003 295
5ec4e49f 296 if (sec_usage_check(sbi, secno))
7bc09003 297 continue;
5ec4e49f 298 if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
7bc09003
JK
299 continue;
300
301 cost = get_gc_cost(sbi, segno, &p);
302
303 if (p.min_cost > cost) {
304 p.min_segno = segno;
305 p.min_cost = cost;
a57e564d 306 } else if (unlikely(cost == max_cost)) {
7bc09003 307 continue;
a57e564d 308 }
7bc09003 309
a26b7c8a 310 if (nsearched++ >= p.max_search) {
7bc09003
JK
311 sbi->last_victim[p.gc_mode] = segno;
312 break;
313 }
314 }
7bc09003 315 if (p.min_segno != NULL_SEGNO) {
b2b3460a 316got_it:
7bc09003 317 if (p.alloc_mode == LFS) {
5ec4e49f
JK
318 secno = GET_SECNO(sbi, p.min_segno);
319 if (gc_type == FG_GC)
320 sbi->cur_victim_sec = secno;
321 else
322 set_bit(secno, dirty_i->victim_secmap);
7bc09003 323 }
5ec4e49f 324 *result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
8e46b3ed
NJ
325
326 trace_f2fs_get_victim(sbi->sb, type, gc_type, &p,
327 sbi->cur_victim_sec,
328 prefree_segments(sbi), free_segments(sbi));
7bc09003
JK
329 }
330 mutex_unlock(&dirty_i->seglist_lock);
331
332 return (p.min_segno == NULL_SEGNO) ? 0 : 1;
333}
334
335static const struct victim_selection default_v_ops = {
336 .get_victim = get_victim_by_default,
337};
338
7dda2af8 339static struct inode *find_gc_inode(struct gc_inode_list *gc_list, nid_t ino)
7bc09003 340{
7bc09003
JK
341 struct inode_entry *ie;
342
7dda2af8
CL
343 ie = radix_tree_lookup(&gc_list->iroot, ino);
344 if (ie)
345 return ie->inode;
7bc09003
JK
346 return NULL;
347}
348
7dda2af8 349static void add_gc_inode(struct gc_inode_list *gc_list, struct inode *inode)
7bc09003 350{
6cc4af56
GZ
351 struct inode_entry *new_ie;
352
7dda2af8 353 if (inode == find_gc_inode(gc_list, inode->i_ino)) {
6cc4af56
GZ
354 iput(inode);
355 return;
7bc09003 356 }
06292073 357 new_ie = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
7bc09003 358 new_ie->inode = inode;
f28e5034
CY
359
360 f2fs_radix_tree_insert(&gc_list->iroot, inode->i_ino, new_ie);
7dda2af8 361 list_add_tail(&new_ie->list, &gc_list->ilist);
7bc09003
JK
362}
363
7dda2af8 364static void put_gc_inode(struct gc_inode_list *gc_list)
7bc09003
JK
365{
366 struct inode_entry *ie, *next_ie;
7dda2af8
CL
367 list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
368 radix_tree_delete(&gc_list->iroot, ie->inode->i_ino);
7bc09003
JK
369 iput(ie->inode);
370 list_del(&ie->list);
06292073 371 kmem_cache_free(inode_entry_slab, ie);
7bc09003
JK
372 }
373}
374
375static int check_valid_map(struct f2fs_sb_info *sbi,
376 unsigned int segno, int offset)
377{
378 struct sit_info *sit_i = SIT_I(sbi);
379 struct seg_entry *sentry;
380 int ret;
381
382 mutex_lock(&sit_i->sentry_lock);
383 sentry = get_seg_entry(sbi, segno);
384 ret = f2fs_test_bit(offset, sentry->cur_valid_map);
385 mutex_unlock(&sit_i->sentry_lock);
43727527 386 return ret;
7bc09003
JK
387}
388
0a8165d7 389/*
7bc09003
JK
390 * This function compares node address got in summary with that in NAT.
391 * On validity, copy that node with cold status, otherwise (invalid node)
392 * ignore that.
393 */
43727527 394static void gc_node_segment(struct f2fs_sb_info *sbi,
7bc09003
JK
395 struct f2fs_summary *sum, unsigned int segno, int gc_type)
396{
397 bool initial = true;
398 struct f2fs_summary *entry;
399 int off;
400
401next_step:
402 entry = sum;
c718379b 403
7bc09003
JK
404 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
405 nid_t nid = le32_to_cpu(entry->nid);
406 struct page *node_page;
7bc09003 407
43727527
JK
408 /* stop BG_GC if there is not enough free sections. */
409 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
410 return;
7bc09003 411
43727527 412 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
413 continue;
414
415 if (initial) {
416 ra_node_page(sbi, nid);
417 continue;
418 }
419 node_page = get_node_page(sbi, nid);
420 if (IS_ERR(node_page))
421 continue;
422
9a01b56b
HY
423 /* block may become invalid during get_node_page */
424 if (check_valid_map(sbi, segno, off) == 0) {
425 f2fs_put_page(node_page, 1);
426 continue;
427 }
428
7bc09003 429 /* set page dirty and write it */
4ebefc44 430 if (gc_type == FG_GC) {
5514f0aa 431 f2fs_wait_on_page_writeback(node_page, NODE);
7bc09003 432 set_page_dirty(node_page);
4ebefc44
JK
433 } else {
434 if (!PageWriteback(node_page))
435 set_page_dirty(node_page);
436 }
7bc09003 437 f2fs_put_page(node_page, 1);
e1235983 438 stat_inc_node_blk_count(sbi, 1, gc_type);
7bc09003 439 }
c718379b 440
7bc09003
JK
441 if (initial) {
442 initial = false;
443 goto next_step;
444 }
445
446 if (gc_type == FG_GC) {
447 struct writeback_control wbc = {
448 .sync_mode = WB_SYNC_ALL,
449 .nr_to_write = LONG_MAX,
450 .for_reclaim = 0,
451 };
452 sync_node_pages(sbi, 0, &wbc);
4ebefc44
JK
453
454 /*
455 * In the case of FG_GC, it'd be better to reclaim this victim
456 * completely.
457 */
458 if (get_valid_blocks(sbi, segno, 1) != 0)
459 goto next_step;
7bc09003 460 }
7bc09003
JK
461}
462
0a8165d7 463/*
9af45ef5
JK
464 * Calculate start block index indicating the given node offset.
465 * Be careful, caller should give this node offset only indicating direct node
466 * blocks. If any node offsets, which point the other types of node blocks such
467 * as indirect or double indirect node blocks, are given, it must be a caller's
468 * bug.
7bc09003 469 */
de93653f 470block_t start_bidx_of_node(unsigned int node_ofs, struct f2fs_inode_info *fi)
7bc09003 471{
ce19a5d4
JK
472 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
473 unsigned int bidx;
7bc09003 474
ce19a5d4
JK
475 if (node_ofs == 0)
476 return 0;
7bc09003 477
ce19a5d4 478 if (node_ofs <= 2) {
7bc09003
JK
479 bidx = node_ofs - 1;
480 } else if (node_ofs <= indirect_blks) {
ce19a5d4 481 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
482 bidx = node_ofs - 2 - dec;
483 } else {
ce19a5d4 484 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
485 bidx = node_ofs - 5 - dec;
486 }
de93653f 487 return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE(fi);
7bc09003
JK
488}
489
490static int check_dnode(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
491 struct node_info *dni, block_t blkaddr, unsigned int *nofs)
492{
493 struct page *node_page;
494 nid_t nid;
495 unsigned int ofs_in_node;
496 block_t source_blkaddr;
497
498 nid = le32_to_cpu(sum->nid);
499 ofs_in_node = le16_to_cpu(sum->ofs_in_node);
500
501 node_page = get_node_page(sbi, nid);
502 if (IS_ERR(node_page))
43727527 503 return 0;
7bc09003
JK
504
505 get_node_info(sbi, nid, dni);
506
507 if (sum->version != dni->version) {
508 f2fs_put_page(node_page, 1);
43727527 509 return 0;
7bc09003
JK
510 }
511
512 *nofs = ofs_of_node(node_page);
513 source_blkaddr = datablock_addr(node_page, ofs_in_node);
514 f2fs_put_page(node_page, 1);
515
516 if (source_blkaddr != blkaddr)
43727527
JK
517 return 0;
518 return 1;
7bc09003
JK
519}
520
521static void move_data_page(struct inode *inode, struct page *page, int gc_type)
522{
458e6197 523 struct f2fs_io_info fio = {
05ca3632 524 .sbi = F2FS_I_SB(inode),
458e6197
JK
525 .type = DATA,
526 .rw = WRITE_SYNC,
05ca3632 527 .page = page,
63a0b7cb
FL
528 };
529
7bc09003 530 if (gc_type == BG_GC) {
4ebefc44
JK
531 if (PageWriteback(page))
532 goto out;
7bc09003
JK
533 set_page_dirty(page);
534 set_cold_data(page);
535 } else {
5514f0aa 536 f2fs_wait_on_page_writeback(page, DATA);
4ebefc44 537
1fe54f9d 538 if (clear_page_dirty_for_io(page))
a7ffdbe2 539 inode_dec_dirty_pages(inode);
7bc09003 540 set_cold_data(page);
05ca3632 541 do_write_data_page(&fio);
7bc09003
JK
542 clear_cold_data(page);
543 }
544out:
545 f2fs_put_page(page, 1);
546}
547
0a8165d7 548/*
7bc09003
JK
549 * This function tries to get parent node of victim data block, and identifies
550 * data block validity. If the block is valid, copy that with cold status and
551 * modify parent node.
552 * If the parent node is not valid or the data block address is different,
553 * the victim data block is ignored.
554 */
43727527 555static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
7dda2af8 556 struct gc_inode_list *gc_list, unsigned int segno, int gc_type)
7bc09003
JK
557{
558 struct super_block *sb = sbi->sb;
559 struct f2fs_summary *entry;
560 block_t start_addr;
43727527 561 int off;
7bc09003
JK
562 int phase = 0;
563
564 start_addr = START_BLOCK(sbi, segno);
565
566next_step:
567 entry = sum;
c718379b 568
7bc09003
JK
569 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
570 struct page *data_page;
571 struct inode *inode;
572 struct node_info dni; /* dnode info for the data */
573 unsigned int ofs_in_node, nofs;
574 block_t start_bidx;
575
43727527
JK
576 /* stop BG_GC if there is not enough free sections. */
577 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
578 return;
7bc09003 579
43727527 580 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
581 continue;
582
583 if (phase == 0) {
584 ra_node_page(sbi, le32_to_cpu(entry->nid));
585 continue;
586 }
587
588 /* Get an inode by ino with checking validity */
43727527 589 if (check_dnode(sbi, entry, &dni, start_addr + off, &nofs) == 0)
7bc09003
JK
590 continue;
591
592 if (phase == 1) {
593 ra_node_page(sbi, dni.ino);
594 continue;
595 }
596
7bc09003
JK
597 ofs_in_node = le16_to_cpu(entry->ofs_in_node);
598
599 if (phase == 2) {
d4686d56 600 inode = f2fs_iget(sb, dni.ino);
b73e5282 601 if (IS_ERR(inode) || is_bad_inode(inode))
7bc09003
JK
602 continue;
603
de93653f
JK
604 start_bidx = start_bidx_of_node(nofs, F2FS_I(inode));
605
7bc09003 606 data_page = find_data_page(inode,
c718379b 607 start_bidx + ofs_in_node, false);
31a32688
CL
608 if (IS_ERR(data_page)) {
609 iput(inode);
610 continue;
611 }
7bc09003
JK
612
613 f2fs_put_page(data_page, 0);
7dda2af8 614 add_gc_inode(gc_list, inode);
31a32688
CL
615 continue;
616 }
617
618 /* phase 3 */
7dda2af8 619 inode = find_gc_inode(gc_list, dni.ino);
31a32688
CL
620 if (inode) {
621 start_bidx = start_bidx_of_node(nofs, F2FS_I(inode));
622 data_page = get_lock_data_page(inode,
7bc09003 623 start_bidx + ofs_in_node);
31a32688
CL
624 if (IS_ERR(data_page))
625 continue;
626 move_data_page(inode, data_page, gc_type);
e1235983 627 stat_inc_data_blk_count(sbi, 1, gc_type);
7bc09003 628 }
7bc09003 629 }
c718379b 630
7bc09003
JK
631 if (++phase < 4)
632 goto next_step;
43727527 633
4ebefc44 634 if (gc_type == FG_GC) {
458e6197 635 f2fs_submit_merged_bio(sbi, DATA, WRITE);
4ebefc44
JK
636
637 /*
638 * In the case of FG_GC, it'd be better to reclaim this victim
639 * completely.
640 */
641 if (get_valid_blocks(sbi, segno, 1) != 0) {
642 phase = 2;
643 goto next_step;
644 }
645 }
7bc09003
JK
646}
647
648static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
8a2d0ace 649 int gc_type)
7bc09003
JK
650{
651 struct sit_info *sit_i = SIT_I(sbi);
652 int ret;
8a2d0ace 653
7bc09003 654 mutex_lock(&sit_i->sentry_lock);
8a2d0ace
GZ
655 ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type,
656 NO_CHECK_TYPE, LFS);
7bc09003
JK
657 mutex_unlock(&sit_i->sentry_lock);
658 return ret;
659}
660
43727527 661static void do_garbage_collect(struct f2fs_sb_info *sbi, unsigned int segno,
7dda2af8 662 struct gc_inode_list *gc_list, int gc_type)
7bc09003
JK
663{
664 struct page *sum_page;
665 struct f2fs_summary_block *sum;
c718379b 666 struct blk_plug plug;
7bc09003
JK
667
668 /* read segment summary of victim */
669 sum_page = get_sum_page(sbi, segno);
7bc09003 670
c718379b
JK
671 blk_start_plug(&plug);
672
7bc09003
JK
673 sum = page_address(sum_page);
674
675 switch (GET_SUM_TYPE((&sum->footer))) {
676 case SUM_TYPE_NODE:
43727527 677 gc_node_segment(sbi, sum->entries, segno, gc_type);
7bc09003
JK
678 break;
679 case SUM_TYPE_DATA:
7dda2af8 680 gc_data_segment(sbi, sum->entries, gc_list, segno, gc_type);
7bc09003
JK
681 break;
682 }
c718379b
JK
683 blk_finish_plug(&plug);
684
e1235983 685 stat_inc_seg_count(sbi, GET_SUM_TYPE((&sum->footer)), gc_type);
7bc09003
JK
686 stat_inc_call_count(sbi->stat_info);
687
b7473754 688 f2fs_put_page(sum_page, 1);
7bc09003
JK
689}
690
408e9375 691int f2fs_gc(struct f2fs_sb_info *sbi)
7bc09003 692{
408e9375 693 unsigned int segno, i;
7bc09003 694 int gc_type = BG_GC;
43727527
JK
695 int nfree = 0;
696 int ret = -1;
d5053a34 697 struct cp_control cpc;
7dda2af8
CL
698 struct gc_inode_list gc_list = {
699 .ilist = LIST_HEAD_INIT(gc_list.ilist),
769ec6e5 700 .iroot = RADIX_TREE_INIT(GFP_NOFS),
7dda2af8 701 };
d5053a34 702
119ee914 703 cpc.reason = __get_cp_reason(sbi);
7bc09003 704gc_more:
6bacf52f 705 if (unlikely(!(sbi->sb->s_flags & MS_ACTIVE)))
408e9375 706 goto stop;
1e968fdf 707 if (unlikely(f2fs_cp_error(sbi)))
203681f6 708 goto stop;
7bc09003 709
d64f8047 710 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, nfree)) {
408e9375 711 gc_type = FG_GC;
75ab4cb8 712 write_checkpoint(sbi, &cpc);
d64f8047 713 }
7bc09003 714
8a2d0ace 715 if (!__get_victim(sbi, &segno, gc_type))
408e9375 716 goto stop;
43727527 717 ret = 0;
7bc09003 718
81c1a0f1
CY
719 /* readahead multi ssa blocks those have contiguous address */
720 if (sbi->segs_per_sec > 1)
721 ra_meta_pages(sbi, GET_SUM_BLOCK(sbi, segno), sbi->segs_per_sec,
722 META_SSA);
723
43727527 724 for (i = 0; i < sbi->segs_per_sec; i++)
7dda2af8 725 do_garbage_collect(sbi, segno + i, &gc_list, gc_type);
43727527 726
5ec4e49f
JK
727 if (gc_type == FG_GC) {
728 sbi->cur_victim_sec = NULL_SEGNO;
43727527 729 nfree++;
5ec4e49f
JK
730 WARN_ON(get_valid_blocks(sbi, segno, sbi->segs_per_sec));
731 }
43727527
JK
732
733 if (has_not_enough_free_secs(sbi, nfree))
734 goto gc_more;
735
736 if (gc_type == FG_GC)
75ab4cb8 737 write_checkpoint(sbi, &cpc);
408e9375 738stop:
7bc09003
JK
739 mutex_unlock(&sbi->gc_mutex);
740
7dda2af8 741 put_gc_inode(&gc_list);
43727527 742 return ret;
7bc09003
JK
743}
744
745void build_gc_manager(struct f2fs_sb_info *sbi)
746{
747 DIRTY_I(sbi)->v_ops = &default_v_ops;
748}