f2fs: remove unneeded pointer conversion
[linux-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>
7bc09003
JK
19
20#include "f2fs.h"
21#include "node.h"
22#include "segment.h"
23#include "gc.h"
8e46b3ed 24#include <trace/events/f2fs.h>
7bc09003 25
7bc09003
JK
26static int gc_thread_func(void *data)
27{
28 struct f2fs_sb_info *sbi = data;
b59d0bae 29 struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
7bc09003
JK
30 wait_queue_head_t *wq = &sbi->gc_thread->gc_wait_queue_head;
31 long wait_ms;
32
b59d0bae 33 wait_ms = gc_th->min_sleep_time;
7bc09003
JK
34
35 do {
36 if (try_to_freeze())
37 continue;
38 else
39 wait_event_interruptible_timeout(*wq,
40 kthread_should_stop(),
41 msecs_to_jiffies(wait_ms));
42 if (kthread_should_stop())
43 break;
44
d6212a5f 45 if (sbi->sb->s_writers.frozen >= SB_FREEZE_WRITE) {
88dd8934 46 increase_sleep_time(gc_th, &wait_ms);
d6212a5f
CL
47 continue;
48 }
49
7bc09003
JK
50 /*
51 * [GC triggering condition]
52 * 0. GC is not conducted currently.
53 * 1. There are enough dirty segments.
54 * 2. IO subsystem is idle by checking the # of writeback pages.
55 * 3. IO subsystem is idle by checking the # of requests in
56 * bdev's request list.
57 *
e1c42045 58 * Note) We have to avoid triggering GCs frequently.
7bc09003
JK
59 * Because it is possible that some segments can be
60 * invalidated soon after by user update or deletion.
61 * So, I'd like to wait some time to collect dirty segments.
62 */
63 if (!mutex_trylock(&sbi->gc_mutex))
64 continue;
65
66 if (!is_idle(sbi)) {
88dd8934 67 increase_sleep_time(gc_th, &wait_ms);
7bc09003
JK
68 mutex_unlock(&sbi->gc_mutex);
69 continue;
70 }
71
72 if (has_enough_invalid_blocks(sbi))
88dd8934 73 decrease_sleep_time(gc_th, &wait_ms);
7bc09003 74 else
88dd8934 75 increase_sleep_time(gc_th, &wait_ms);
7bc09003 76
dcdfff65 77 stat_inc_bggc_count(sbi);
7bc09003 78
43727527 79 /* if return value is not zero, no victim was selected */
6aefd93b 80 if (f2fs_gc(sbi, test_opt(sbi, FORCE_FG_GC)))
b59d0bae 81 wait_ms = gc_th->no_gc_sleep_time;
81eb8d6e 82
84e4214f
JK
83 trace_f2fs_background_gc(sbi->sb, wait_ms,
84 prefree_segments(sbi), free_segments(sbi));
85
4660f9c0
JK
86 /* balancing f2fs's metadata periodically */
87 f2fs_balance_fs_bg(sbi);
81eb8d6e 88
7bc09003
JK
89 } while (!kthread_should_stop());
90 return 0;
91}
92
93int start_gc_thread(struct f2fs_sb_info *sbi)
94{
1042d60f 95 struct f2fs_gc_kthread *gc_th;
ec7b1f2d 96 dev_t dev = sbi->sb->s_bdev->bd_dev;
7a267f8d 97 int err = 0;
7bc09003
JK
98
99 gc_th = kmalloc(sizeof(struct f2fs_gc_kthread), GFP_KERNEL);
7a267f8d
NJ
100 if (!gc_th) {
101 err = -ENOMEM;
102 goto out;
103 }
7bc09003 104
b59d0bae
NJ
105 gc_th->min_sleep_time = DEF_GC_THREAD_MIN_SLEEP_TIME;
106 gc_th->max_sleep_time = DEF_GC_THREAD_MAX_SLEEP_TIME;
107 gc_th->no_gc_sleep_time = DEF_GC_THREAD_NOGC_SLEEP_TIME;
108
d2dc095f
NJ
109 gc_th->gc_idle = 0;
110
7bc09003
JK
111 sbi->gc_thread = gc_th;
112 init_waitqueue_head(&sbi->gc_thread->gc_wait_queue_head);
113 sbi->gc_thread->f2fs_gc_task = kthread_run(gc_thread_func, sbi,
ec7b1f2d 114 "f2fs_gc-%u:%u", MAJOR(dev), MINOR(dev));
7bc09003 115 if (IS_ERR(gc_th->f2fs_gc_task)) {
7a267f8d 116 err = PTR_ERR(gc_th->f2fs_gc_task);
7bc09003 117 kfree(gc_th);
25718423 118 sbi->gc_thread = NULL;
7bc09003 119 }
7a267f8d
NJ
120out:
121 return err;
7bc09003
JK
122}
123
124void stop_gc_thread(struct f2fs_sb_info *sbi)
125{
126 struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
127 if (!gc_th)
128 return;
129 kthread_stop(gc_th->f2fs_gc_task);
130 kfree(gc_th);
131 sbi->gc_thread = NULL;
132}
133
d2dc095f 134static int select_gc_type(struct f2fs_gc_kthread *gc_th, int gc_type)
7bc09003 135{
d2dc095f
NJ
136 int gc_mode = (gc_type == BG_GC) ? GC_CB : GC_GREEDY;
137
138 if (gc_th && gc_th->gc_idle) {
139 if (gc_th->gc_idle == 1)
140 gc_mode = GC_CB;
141 else if (gc_th->gc_idle == 2)
142 gc_mode = GC_GREEDY;
143 }
144 return gc_mode;
7bc09003
JK
145}
146
147static void select_policy(struct f2fs_sb_info *sbi, int gc_type,
148 int type, struct victim_sel_policy *p)
149{
150 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
151
4ebefc44 152 if (p->alloc_mode == SSR) {
7bc09003
JK
153 p->gc_mode = GC_GREEDY;
154 p->dirty_segmap = dirty_i->dirty_segmap[type];
a26b7c8a 155 p->max_search = dirty_i->nr_dirty[type];
7bc09003
JK
156 p->ofs_unit = 1;
157 } else {
d2dc095f 158 p->gc_mode = select_gc_type(sbi->gc_thread, gc_type);
7bc09003 159 p->dirty_segmap = dirty_i->dirty_segmap[DIRTY];
a26b7c8a 160 p->max_search = dirty_i->nr_dirty[DIRTY];
7bc09003
JK
161 p->ofs_unit = sbi->segs_per_sec;
162 }
a26b7c8a 163
b1c57c1c
JK
164 if (p->max_search > sbi->max_victim_search)
165 p->max_search = sbi->max_victim_search;
a26b7c8a 166
7bc09003
JK
167 p->offset = sbi->last_victim[p->gc_mode];
168}
169
170static unsigned int get_max_cost(struct f2fs_sb_info *sbi,
171 struct victim_sel_policy *p)
172{
b7250d2d
JK
173 /* SSR allocates in a segment unit */
174 if (p->alloc_mode == SSR)
3519e3f9 175 return sbi->blocks_per_seg;
7bc09003 176 if (p->gc_mode == GC_GREEDY)
3519e3f9 177 return sbi->blocks_per_seg * p->ofs_unit;
7bc09003
JK
178 else if (p->gc_mode == GC_CB)
179 return UINT_MAX;
180 else /* No other gc_mode */
181 return 0;
182}
183
184static unsigned int check_bg_victims(struct f2fs_sb_info *sbi)
185{
186 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5ec4e49f 187 unsigned int secno;
7bc09003
JK
188
189 /*
190 * If the gc_type is FG_GC, we can select victim segments
191 * selected by background GC before.
192 * Those segments guarantee they have small valid blocks.
193 */
7cd8558b 194 for_each_set_bit(secno, dirty_i->victim_secmap, MAIN_SECS(sbi)) {
5ec4e49f 195 if (sec_usage_check(sbi, secno))
b65ee148 196 continue;
5ec4e49f
JK
197 clear_bit(secno, dirty_i->victim_secmap);
198 return secno * sbi->segs_per_sec;
7bc09003
JK
199 }
200 return NULL_SEGNO;
201}
202
203static unsigned int get_cb_cost(struct f2fs_sb_info *sbi, unsigned int segno)
204{
205 struct sit_info *sit_i = SIT_I(sbi);
206 unsigned int secno = GET_SECNO(sbi, segno);
207 unsigned int start = secno * sbi->segs_per_sec;
208 unsigned long long mtime = 0;
209 unsigned int vblocks;
210 unsigned char age = 0;
211 unsigned char u;
212 unsigned int i;
213
214 for (i = 0; i < sbi->segs_per_sec; i++)
215 mtime += get_seg_entry(sbi, start + i)->mtime;
216 vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
217
218 mtime = div_u64(mtime, sbi->segs_per_sec);
219 vblocks = div_u64(vblocks, sbi->segs_per_sec);
220
221 u = (vblocks * 100) >> sbi->log_blocks_per_seg;
222
e1c42045 223 /* Handle if the system time has changed by the user */
7bc09003
JK
224 if (mtime < sit_i->min_mtime)
225 sit_i->min_mtime = mtime;
226 if (mtime > sit_i->max_mtime)
227 sit_i->max_mtime = mtime;
228 if (sit_i->max_mtime != sit_i->min_mtime)
229 age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime),
230 sit_i->max_mtime - sit_i->min_mtime);
231
232 return UINT_MAX - ((100 * (100 - u) * age) / (100 + u));
233}
234
a57e564d
JX
235static inline unsigned int get_gc_cost(struct f2fs_sb_info *sbi,
236 unsigned int segno, struct victim_sel_policy *p)
7bc09003
JK
237{
238 if (p->alloc_mode == SSR)
239 return get_seg_entry(sbi, segno)->ckpt_valid_blocks;
240
241 /* alloc_mode == LFS */
242 if (p->gc_mode == GC_GREEDY)
243 return get_valid_blocks(sbi, segno, sbi->segs_per_sec);
244 else
245 return get_cb_cost(sbi, segno);
246}
247
688159b6
FL
248static unsigned int count_bits(const unsigned long *addr,
249 unsigned int offset, unsigned int len)
250{
251 unsigned int end = offset + len, sum = 0;
252
253 while (offset < end) {
254 if (test_bit(offset++, addr))
255 ++sum;
256 }
257 return sum;
258}
259
0a8165d7 260/*
111d2495 261 * This function is called from two paths.
7bc09003
JK
262 * One is garbage collection and the other is SSR segment selection.
263 * When it is called during GC, it just gets a victim segment
264 * and it does not remove it from dirty seglist.
265 * When it is called from SSR segment selection, it finds a segment
266 * which has minimum valid blocks and removes it from dirty seglist.
267 */
268static int get_victim_by_default(struct f2fs_sb_info *sbi,
269 unsigned int *result, int gc_type, int type, char alloc_mode)
270{
271 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
272 struct victim_sel_policy p;
b2b3460a 273 unsigned int secno, max_cost;
a43f7ec3 274 unsigned int last_segment = MAIN_SEGS(sbi);
688159b6 275 unsigned int nsearched = 0;
7bc09003 276
210f41bc
CY
277 mutex_lock(&dirty_i->seglist_lock);
278
7bc09003
JK
279 p.alloc_mode = alloc_mode;
280 select_policy(sbi, gc_type, type, &p);
281
282 p.min_segno = NULL_SEGNO;
b2b3460a 283 p.min_cost = max_cost = get_max_cost(sbi, &p);
7bc09003 284
3342bb30
CY
285 if (p.max_search == 0)
286 goto out;
287
7bc09003
JK
288 if (p.alloc_mode == LFS && gc_type == FG_GC) {
289 p.min_segno = check_bg_victims(sbi);
290 if (p.min_segno != NULL_SEGNO)
291 goto got_it;
292 }
293
294 while (1) {
295 unsigned long cost;
5ec4e49f 296 unsigned int segno;
7bc09003 297
a43f7ec3
CY
298 segno = find_next_bit(p.dirty_segmap, last_segment, p.offset);
299 if (segno >= last_segment) {
7bc09003 300 if (sbi->last_victim[p.gc_mode]) {
a43f7ec3 301 last_segment = sbi->last_victim[p.gc_mode];
7bc09003
JK
302 sbi->last_victim[p.gc_mode] = 0;
303 p.offset = 0;
304 continue;
305 }
306 break;
307 }
a57e564d
JX
308
309 p.offset = segno + p.ofs_unit;
688159b6 310 if (p.ofs_unit > 1) {
a57e564d 311 p.offset -= segno % p.ofs_unit;
688159b6
FL
312 nsearched += count_bits(p.dirty_segmap,
313 p.offset - p.ofs_unit,
314 p.ofs_unit);
315 } else {
316 nsearched++;
317 }
318
a57e564d 319
5ec4e49f 320 secno = GET_SECNO(sbi, segno);
7bc09003 321
5ec4e49f 322 if (sec_usage_check(sbi, secno))
688159b6 323 goto next;
5ec4e49f 324 if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
688159b6 325 goto next;
7bc09003
JK
326
327 cost = get_gc_cost(sbi, segno, &p);
328
329 if (p.min_cost > cost) {
330 p.min_segno = segno;
331 p.min_cost = cost;
a57e564d 332 }
688159b6
FL
333next:
334 if (nsearched >= p.max_search) {
7bc09003
JK
335 sbi->last_victim[p.gc_mode] = segno;
336 break;
337 }
338 }
7bc09003 339 if (p.min_segno != NULL_SEGNO) {
b2b3460a 340got_it:
7bc09003 341 if (p.alloc_mode == LFS) {
5ec4e49f
JK
342 secno = GET_SECNO(sbi, p.min_segno);
343 if (gc_type == FG_GC)
344 sbi->cur_victim_sec = secno;
345 else
346 set_bit(secno, dirty_i->victim_secmap);
7bc09003 347 }
5ec4e49f 348 *result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
8e46b3ed
NJ
349
350 trace_f2fs_get_victim(sbi->sb, type, gc_type, &p,
351 sbi->cur_victim_sec,
352 prefree_segments(sbi), free_segments(sbi));
7bc09003 353 }
3342bb30 354out:
7bc09003
JK
355 mutex_unlock(&dirty_i->seglist_lock);
356
357 return (p.min_segno == NULL_SEGNO) ? 0 : 1;
358}
359
360static const struct victim_selection default_v_ops = {
361 .get_victim = get_victim_by_default,
362};
363
7dda2af8 364static struct inode *find_gc_inode(struct gc_inode_list *gc_list, nid_t ino)
7bc09003 365{
7bc09003
JK
366 struct inode_entry *ie;
367
7dda2af8
CL
368 ie = radix_tree_lookup(&gc_list->iroot, ino);
369 if (ie)
370 return ie->inode;
7bc09003
JK
371 return NULL;
372}
373
7dda2af8 374static void add_gc_inode(struct gc_inode_list *gc_list, struct inode *inode)
7bc09003 375{
6cc4af56
GZ
376 struct inode_entry *new_ie;
377
7dda2af8 378 if (inode == find_gc_inode(gc_list, inode->i_ino)) {
6cc4af56
GZ
379 iput(inode);
380 return;
7bc09003 381 }
06292073 382 new_ie = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
7bc09003 383 new_ie->inode = inode;
f28e5034
CY
384
385 f2fs_radix_tree_insert(&gc_list->iroot, inode->i_ino, new_ie);
7dda2af8 386 list_add_tail(&new_ie->list, &gc_list->ilist);
7bc09003
JK
387}
388
7dda2af8 389static void put_gc_inode(struct gc_inode_list *gc_list)
7bc09003
JK
390{
391 struct inode_entry *ie, *next_ie;
7dda2af8
CL
392 list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
393 radix_tree_delete(&gc_list->iroot, ie->inode->i_ino);
7bc09003
JK
394 iput(ie->inode);
395 list_del(&ie->list);
06292073 396 kmem_cache_free(inode_entry_slab, ie);
7bc09003
JK
397 }
398}
399
400static int check_valid_map(struct f2fs_sb_info *sbi,
401 unsigned int segno, int offset)
402{
403 struct sit_info *sit_i = SIT_I(sbi);
404 struct seg_entry *sentry;
405 int ret;
406
407 mutex_lock(&sit_i->sentry_lock);
408 sentry = get_seg_entry(sbi, segno);
409 ret = f2fs_test_bit(offset, sentry->cur_valid_map);
410 mutex_unlock(&sit_i->sentry_lock);
43727527 411 return ret;
7bc09003
JK
412}
413
0a8165d7 414/*
7bc09003
JK
415 * This function compares node address got in summary with that in NAT.
416 * On validity, copy that node with cold status, otherwise (invalid node)
417 * ignore that.
418 */
718e53fa 419static void gc_node_segment(struct f2fs_sb_info *sbi,
7bc09003
JK
420 struct f2fs_summary *sum, unsigned int segno, int gc_type)
421{
422 bool initial = true;
423 struct f2fs_summary *entry;
26d58599 424 block_t start_addr;
7bc09003
JK
425 int off;
426
26d58599
JK
427 start_addr = START_BLOCK(sbi, segno);
428
7bc09003
JK
429next_step:
430 entry = sum;
c718379b 431
7bc09003
JK
432 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
433 nid_t nid = le32_to_cpu(entry->nid);
434 struct page *node_page;
26d58599 435 struct node_info ni;
7bc09003 436
43727527
JK
437 /* stop BG_GC if there is not enough free sections. */
438 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
718e53fa 439 return;
7bc09003 440
43727527 441 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
442 continue;
443
444 if (initial) {
445 ra_node_page(sbi, nid);
446 continue;
447 }
448 node_page = get_node_page(sbi, nid);
449 if (IS_ERR(node_page))
450 continue;
451
9a01b56b
HY
452 /* block may become invalid during get_node_page */
453 if (check_valid_map(sbi, segno, off) == 0) {
454 f2fs_put_page(node_page, 1);
455 continue;
26d58599
JK
456 }
457
458 get_node_info(sbi, nid, &ni);
459 if (ni.blk_addr != start_addr + off) {
460 f2fs_put_page(node_page, 1);
461 continue;
9a01b56b
HY
462 }
463
7bc09003 464 /* set page dirty and write it */
4ebefc44 465 if (gc_type == FG_GC) {
fec1d657 466 f2fs_wait_on_page_writeback(node_page, NODE, true);
7bc09003 467 set_page_dirty(node_page);
4ebefc44
JK
468 } else {
469 if (!PageWriteback(node_page))
470 set_page_dirty(node_page);
471 }
7bc09003 472 f2fs_put_page(node_page, 1);
e1235983 473 stat_inc_node_blk_count(sbi, 1, gc_type);
7bc09003 474 }
c718379b 475
7bc09003
JK
476 if (initial) {
477 initial = false;
478 goto next_step;
479 }
7bc09003
JK
480}
481
0a8165d7 482/*
9af45ef5
JK
483 * Calculate start block index indicating the given node offset.
484 * Be careful, caller should give this node offset only indicating direct node
485 * blocks. If any node offsets, which point the other types of node blocks such
486 * as indirect or double indirect node blocks, are given, it must be a caller's
487 * bug.
7bc09003 488 */
81ca7350 489block_t start_bidx_of_node(unsigned int node_ofs, struct inode *inode)
7bc09003 490{
ce19a5d4
JK
491 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
492 unsigned int bidx;
7bc09003 493
ce19a5d4
JK
494 if (node_ofs == 0)
495 return 0;
7bc09003 496
ce19a5d4 497 if (node_ofs <= 2) {
7bc09003
JK
498 bidx = node_ofs - 1;
499 } else if (node_ofs <= indirect_blks) {
ce19a5d4 500 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
501 bidx = node_ofs - 2 - dec;
502 } else {
ce19a5d4 503 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
504 bidx = node_ofs - 5 - dec;
505 }
81ca7350 506 return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE(inode);
7bc09003
JK
507}
508
c1079892 509static bool is_alive(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
7bc09003
JK
510 struct node_info *dni, block_t blkaddr, unsigned int *nofs)
511{
512 struct page *node_page;
513 nid_t nid;
514 unsigned int ofs_in_node;
515 block_t source_blkaddr;
516
517 nid = le32_to_cpu(sum->nid);
518 ofs_in_node = le16_to_cpu(sum->ofs_in_node);
519
520 node_page = get_node_page(sbi, nid);
521 if (IS_ERR(node_page))
c1079892 522 return false;
7bc09003
JK
523
524 get_node_info(sbi, nid, dni);
525
526 if (sum->version != dni->version) {
527 f2fs_put_page(node_page, 1);
c1079892 528 return false;
7bc09003
JK
529 }
530
531 *nofs = ofs_of_node(node_page);
532 source_blkaddr = datablock_addr(node_page, ofs_in_node);
533 f2fs_put_page(node_page, 1);
534
535 if (source_blkaddr != blkaddr)
c1079892
NK
536 return false;
537 return true;
7bc09003
JK
538}
539
4375a336
JK
540static void move_encrypted_block(struct inode *inode, block_t bidx)
541{
542 struct f2fs_io_info fio = {
543 .sbi = F2FS_I_SB(inode),
544 .type = DATA,
545 .rw = READ_SYNC,
546 .encrypted_page = NULL,
547 };
548 struct dnode_of_data dn;
549 struct f2fs_summary sum;
550 struct node_info ni;
551 struct page *page;
552 int err;
553
554 /* do not read out */
a56c7c6f 555 page = f2fs_grab_cache_page(inode->i_mapping, bidx, false);
4375a336
JK
556 if (!page)
557 return;
558
559 set_new_dnode(&dn, inode, NULL, NULL, 0);
560 err = get_dnode_of_data(&dn, bidx, LOOKUP_NODE);
561 if (err)
562 goto out;
563
08b39fbd
CY
564 if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
565 ClearPageUptodate(page);
4375a336 566 goto put_out;
08b39fbd
CY
567 }
568
569 /*
570 * don't cache encrypted data into meta inode until previous dirty
571 * data were writebacked to avoid racing between GC and flush.
572 */
fec1d657 573 f2fs_wait_on_page_writeback(page, DATA, true);
4375a336
JK
574
575 get_node_info(fio.sbi, dn.nid, &ni);
576 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
577
578 /* read page */
579 fio.page = page;
580 fio.blk_addr = dn.data_blkaddr;
581
1b77c416
JK
582 fio.encrypted_page = pagecache_get_page(META_MAPPING(fio.sbi),
583 fio.blk_addr,
584 FGP_LOCK|FGP_CREAT,
585 GFP_NOFS);
4375a336
JK
586 if (!fio.encrypted_page)
587 goto put_out;
588
548aedac
JK
589 err = f2fs_submit_page_bio(&fio);
590 if (err)
591 goto put_page_out;
592
593 /* write page */
594 lock_page(fio.encrypted_page);
595
596 if (unlikely(!PageUptodate(fio.encrypted_page)))
597 goto put_page_out;
598 if (unlikely(fio.encrypted_page->mapping != META_MAPPING(fio.sbi)))
599 goto put_page_out;
600
6282adbf 601 set_page_dirty(fio.encrypted_page);
fec1d657 602 f2fs_wait_on_page_writeback(fio.encrypted_page, DATA, true);
6282adbf
JK
603 if (clear_page_dirty_for_io(fio.encrypted_page))
604 dec_page_count(fio.sbi, F2FS_DIRTY_META);
605
548aedac 606 set_page_writeback(fio.encrypted_page);
4375a336
JK
607
608 /* allocate block address */
fec1d657 609 f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
4375a336
JK
610 allocate_data_block(fio.sbi, NULL, fio.blk_addr,
611 &fio.blk_addr, &sum, CURSEG_COLD_DATA);
4375a336
JK
612 fio.rw = WRITE_SYNC;
613 f2fs_submit_page_mbio(&fio);
614
548aedac 615 dn.data_blkaddr = fio.blk_addr;
4375a336
JK
616 set_data_blkaddr(&dn);
617 f2fs_update_extent_cache(&dn);
618 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
619 if (page->index == 0)
620 set_inode_flag(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
548aedac 621put_page_out:
4375a336
JK
622 f2fs_put_page(fio.encrypted_page, 1);
623put_out:
624 f2fs_put_dnode(&dn);
625out:
626 f2fs_put_page(page, 1);
627}
628
c879f90d 629static void move_data_page(struct inode *inode, block_t bidx, int gc_type)
7bc09003 630{
c879f90d
JK
631 struct page *page;
632
a56c7c6f 633 page = get_lock_data_page(inode, bidx, true);
c879f90d
JK
634 if (IS_ERR(page))
635 return;
63a0b7cb 636
7bc09003 637 if (gc_type == BG_GC) {
4ebefc44
JK
638 if (PageWriteback(page))
639 goto out;
7bc09003
JK
640 set_page_dirty(page);
641 set_cold_data(page);
642 } else {
c879f90d
JK
643 struct f2fs_io_info fio = {
644 .sbi = F2FS_I_SB(inode),
645 .type = DATA,
646 .rw = WRITE_SYNC,
647 .page = page,
4375a336 648 .encrypted_page = NULL,
c879f90d 649 };
6282adbf 650 set_page_dirty(page);
fec1d657 651 f2fs_wait_on_page_writeback(page, DATA, true);
1fe54f9d 652 if (clear_page_dirty_for_io(page))
a7ffdbe2 653 inode_dec_dirty_pages(inode);
7bc09003 654 set_cold_data(page);
05ca3632 655 do_write_data_page(&fio);
7bc09003
JK
656 clear_cold_data(page);
657 }
658out:
659 f2fs_put_page(page, 1);
660}
661
0a8165d7 662/*
7bc09003
JK
663 * This function tries to get parent node of victim data block, and identifies
664 * data block validity. If the block is valid, copy that with cold status and
665 * modify parent node.
666 * If the parent node is not valid or the data block address is different,
667 * the victim data block is ignored.
668 */
718e53fa 669static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
7dda2af8 670 struct gc_inode_list *gc_list, unsigned int segno, int gc_type)
7bc09003
JK
671{
672 struct super_block *sb = sbi->sb;
673 struct f2fs_summary *entry;
674 block_t start_addr;
43727527 675 int off;
7bc09003
JK
676 int phase = 0;
677
678 start_addr = START_BLOCK(sbi, segno);
679
680next_step:
681 entry = sum;
c718379b 682
7bc09003
JK
683 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
684 struct page *data_page;
685 struct inode *inode;
686 struct node_info dni; /* dnode info for the data */
687 unsigned int ofs_in_node, nofs;
688 block_t start_bidx;
689
43727527
JK
690 /* stop BG_GC if there is not enough free sections. */
691 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
718e53fa 692 return;
7bc09003 693
43727527 694 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
695 continue;
696
697 if (phase == 0) {
698 ra_node_page(sbi, le32_to_cpu(entry->nid));
699 continue;
700 }
701
702 /* Get an inode by ino with checking validity */
c1079892 703 if (!is_alive(sbi, entry, &dni, start_addr + off, &nofs))
7bc09003
JK
704 continue;
705
706 if (phase == 1) {
707 ra_node_page(sbi, dni.ino);
708 continue;
709 }
710
7bc09003
JK
711 ofs_in_node = le16_to_cpu(entry->ofs_in_node);
712
713 if (phase == 2) {
d4686d56 714 inode = f2fs_iget(sb, dni.ino);
b73e5282 715 if (IS_ERR(inode) || is_bad_inode(inode))
7bc09003
JK
716 continue;
717
4375a336
JK
718 /* if encrypted inode, let's go phase 3 */
719 if (f2fs_encrypted_inode(inode) &&
720 S_ISREG(inode->i_mode)) {
721 add_gc_inode(gc_list, inode);
722 continue;
723 }
724
81ca7350 725 start_bidx = start_bidx_of_node(nofs, inode);
43f3eae1 726 data_page = get_read_data_page(inode,
a56c7c6f 727 start_bidx + ofs_in_node, READA, true);
31a32688
CL
728 if (IS_ERR(data_page)) {
729 iput(inode);
730 continue;
731 }
7bc09003
JK
732
733 f2fs_put_page(data_page, 0);
7dda2af8 734 add_gc_inode(gc_list, inode);
31a32688
CL
735 continue;
736 }
737
738 /* phase 3 */
7dda2af8 739 inode = find_gc_inode(gc_list, dni.ino);
31a32688 740 if (inode) {
81ca7350 741 start_bidx = start_bidx_of_node(nofs, inode)
c879f90d 742 + ofs_in_node;
4375a336
JK
743 if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
744 move_encrypted_block(inode, start_bidx);
745 else
746 move_data_page(inode, start_bidx, gc_type);
e1235983 747 stat_inc_data_blk_count(sbi, 1, gc_type);
7bc09003 748 }
7bc09003 749 }
c718379b 750
7bc09003
JK
751 if (++phase < 4)
752 goto next_step;
7bc09003
JK
753}
754
755static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
8a2d0ace 756 int gc_type)
7bc09003
JK
757{
758 struct sit_info *sit_i = SIT_I(sbi);
759 int ret;
8a2d0ace 760
7bc09003 761 mutex_lock(&sit_i->sentry_lock);
8a2d0ace
GZ
762 ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type,
763 NO_CHECK_TYPE, LFS);
7bc09003
JK
764 mutex_unlock(&sit_i->sentry_lock);
765 return ret;
766}
767
718e53fa
CY
768static int do_garbage_collect(struct f2fs_sb_info *sbi,
769 unsigned int start_segno,
7dda2af8 770 struct gc_inode_list *gc_list, int gc_type)
7bc09003
JK
771{
772 struct page *sum_page;
773 struct f2fs_summary_block *sum;
c718379b 774 struct blk_plug plug;
718e53fa
CY
775 unsigned int segno = start_segno;
776 unsigned int end_segno = start_segno + sbi->segs_per_sec;
777 int seg_freed = 0;
778 unsigned char type = IS_DATASEG(get_seg_entry(sbi, segno)->type) ?
779 SUM_TYPE_DATA : SUM_TYPE_NODE;
7bc09003 780
718e53fa
CY
781 /* readahead multi ssa blocks those have contiguous address */
782 if (sbi->segs_per_sec > 1)
783 ra_meta_pages(sbi, GET_SUM_BLOCK(sbi, segno),
784 sbi->segs_per_sec, META_SSA, true);
785
786 /* reference all summary page */
787 while (segno < end_segno) {
788 sum_page = get_sum_page(sbi, segno++);
789 unlock_page(sum_page);
790 }
7bc09003 791
c718379b
JK
792 blk_start_plug(&plug);
793
718e53fa
CY
794 for (segno = start_segno; segno < end_segno; segno++) {
795 /* find segment summary of victim */
796 sum_page = find_get_page(META_MAPPING(sbi),
797 GET_SUM_BLOCK(sbi, segno));
798 f2fs_bug_on(sbi, !PageUptodate(sum_page));
799 f2fs_put_page(sum_page, 0);
7bc09003 800
718e53fa
CY
801 sum = page_address(sum_page);
802 f2fs_bug_on(sbi, type != GET_SUM_TYPE((&sum->footer)));
803
804 /*
805 * this is to avoid deadlock:
806 * - lock_page(sum_page) - f2fs_replace_block
807 * - check_valid_map() - mutex_lock(sentry_lock)
808 * - mutex_lock(sentry_lock) - change_curseg()
809 * - lock_page(sum_page)
810 */
811
812 if (type == SUM_TYPE_NODE)
813 gc_node_segment(sbi, sum->entries, segno, gc_type);
814 else
815 gc_data_segment(sbi, sum->entries, gc_list, segno,
816 gc_type);
817
818 stat_inc_seg_count(sbi, type, gc_type);
819 stat_inc_call_count(sbi->stat_info);
820
821 f2fs_put_page(sum_page, 0);
822 }
823
824 if (gc_type == FG_GC) {
825 if (type == SUM_TYPE_NODE) {
826 struct writeback_control wbc = {
827 .sync_mode = WB_SYNC_ALL,
828 .nr_to_write = LONG_MAX,
829 .for_reclaim = 0,
830 };
831 sync_node_pages(sbi, 0, &wbc);
832 } else {
833 f2fs_submit_merged_bio(sbi, DATA, WRITE);
834 }
7bc09003 835 }
c718379b 836
718e53fa 837 blk_finish_plug(&plug);
7bc09003 838
718e53fa
CY
839 if (gc_type == FG_GC) {
840 while (start_segno < end_segno)
841 if (get_valid_blocks(sbi, start_segno++, 1) == 0)
842 seg_freed++;
843 }
844 return seg_freed;
7bc09003
JK
845}
846
d530d4d8 847int f2fs_gc(struct f2fs_sb_info *sbi, bool sync)
7bc09003 848{
718e53fa 849 unsigned int segno;
d530d4d8 850 int gc_type = sync ? FG_GC : BG_GC;
718e53fa 851 int sec_freed = 0, seg_freed;
d530d4d8 852 int ret = -EINVAL;
d5053a34 853 struct cp_control cpc;
7dda2af8
CL
854 struct gc_inode_list gc_list = {
855 .ilist = LIST_HEAD_INIT(gc_list.ilist),
769ec6e5 856 .iroot = RADIX_TREE_INIT(GFP_NOFS),
7dda2af8 857 };
d5053a34 858
119ee914 859 cpc.reason = __get_cp_reason(sbi);
7bc09003 860gc_more:
ab126cfc
JK
861 segno = NULL_SEGNO;
862
6bacf52f 863 if (unlikely(!(sbi->sb->s_flags & MS_ACTIVE)))
408e9375 864 goto stop;
6d5a1495
CY
865 if (unlikely(f2fs_cp_error(sbi))) {
866 ret = -EIO;
203681f6 867 goto stop;
6d5a1495 868 }
7bc09003 869
45fe8492 870 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, sec_freed)) {
408e9375 871 gc_type = FG_GC;
6e17bfbc
JK
872 /*
873 * If there is no victim and no prefree segment but still not
874 * enough free sections, we should flush dent/node blocks and do
875 * garbage collections.
876 */
798c1b16
JK
877 if (__get_victim(sbi, &segno, gc_type) || prefree_segments(sbi))
878 write_checkpoint(sbi, &cpc);
6e17bfbc
JK
879 else if (has_not_enough_free_secs(sbi, 0))
880 write_checkpoint(sbi, &cpc);
d64f8047 881 }
7bc09003 882
798c1b16 883 if (segno == NULL_SEGNO && !__get_victim(sbi, &segno, gc_type))
408e9375 884 goto stop;
43727527 885 ret = 0;
7bc09003 886
718e53fa 887 seg_freed = do_garbage_collect(sbi, segno, &gc_list, gc_type);
45fe8492 888
718e53fa 889 if (gc_type == FG_GC && seg_freed == sbi->segs_per_sec)
45fe8492 890 sec_freed++;
43727527 891
5ee5293c 892 if (gc_type == FG_GC)
5ec4e49f 893 sbi->cur_victim_sec = NULL_SEGNO;
43727527 894
d530d4d8
CY
895 if (!sync) {
896 if (has_not_enough_free_secs(sbi, sec_freed))
897 goto gc_more;
43727527 898
d530d4d8
CY
899 if (gc_type == FG_GC)
900 write_checkpoint(sbi, &cpc);
901 }
408e9375 902stop:
7bc09003
JK
903 mutex_unlock(&sbi->gc_mutex);
904
7dda2af8 905 put_gc_inode(&gc_list);
d530d4d8
CY
906
907 if (sync)
908 ret = sec_freed ? 0 : -EAGAIN;
43727527 909 return ret;
7bc09003
JK
910}
911
912void build_gc_manager(struct f2fs_sb_info *sbi)
913{
914 DIRTY_I(sbi)->v_ops = &default_v_ops;
915}