]> git.ipfire.org Git - people/ms/linux.git/blame - fs/f2fs/gc.c
f2fs: try to flush inode after merging inline data
[people/ms/linux.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;
4ce53776 273 unsigned int secno, max_cost, last_victim;
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
4ce53776 288 last_victim = sbi->last_victim[p.gc_mode];
7bc09003
JK
289 if (p.alloc_mode == LFS && gc_type == FG_GC) {
290 p.min_segno = check_bg_victims(sbi);
291 if (p.min_segno != NULL_SEGNO)
292 goto got_it;
293 }
294
295 while (1) {
296 unsigned long cost;
5ec4e49f 297 unsigned int segno;
7bc09003 298
a43f7ec3
CY
299 segno = find_next_bit(p.dirty_segmap, last_segment, p.offset);
300 if (segno >= last_segment) {
7bc09003 301 if (sbi->last_victim[p.gc_mode]) {
a43f7ec3 302 last_segment = sbi->last_victim[p.gc_mode];
7bc09003
JK
303 sbi->last_victim[p.gc_mode] = 0;
304 p.offset = 0;
305 continue;
306 }
307 break;
308 }
a57e564d
JX
309
310 p.offset = segno + p.ofs_unit;
688159b6 311 if (p.ofs_unit > 1) {
a57e564d 312 p.offset -= segno % p.ofs_unit;
688159b6
FL
313 nsearched += count_bits(p.dirty_segmap,
314 p.offset - p.ofs_unit,
315 p.ofs_unit);
316 } else {
317 nsearched++;
318 }
319
a57e564d 320
5ec4e49f 321 secno = GET_SECNO(sbi, segno);
7bc09003 322
5ec4e49f 323 if (sec_usage_check(sbi, secno))
688159b6 324 goto next;
5ec4e49f 325 if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
688159b6 326 goto next;
7bc09003
JK
327
328 cost = get_gc_cost(sbi, segno, &p);
329
330 if (p.min_cost > cost) {
331 p.min_segno = segno;
332 p.min_cost = cost;
a57e564d 333 }
688159b6
FL
334next:
335 if (nsearched >= p.max_search) {
4ce53776
JK
336 if (!sbi->last_victim[p.gc_mode] && segno <= last_victim)
337 sbi->last_victim[p.gc_mode] = last_victim + 1;
338 else
339 sbi->last_victim[p.gc_mode] = segno + 1;
7bc09003
JK
340 break;
341 }
342 }
7bc09003 343 if (p.min_segno != NULL_SEGNO) {
b2b3460a 344got_it:
7bc09003 345 if (p.alloc_mode == LFS) {
5ec4e49f
JK
346 secno = GET_SECNO(sbi, p.min_segno);
347 if (gc_type == FG_GC)
348 sbi->cur_victim_sec = secno;
349 else
350 set_bit(secno, dirty_i->victim_secmap);
7bc09003 351 }
5ec4e49f 352 *result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
8e46b3ed
NJ
353
354 trace_f2fs_get_victim(sbi->sb, type, gc_type, &p,
355 sbi->cur_victim_sec,
356 prefree_segments(sbi), free_segments(sbi));
7bc09003 357 }
3342bb30 358out:
7bc09003
JK
359 mutex_unlock(&dirty_i->seglist_lock);
360
361 return (p.min_segno == NULL_SEGNO) ? 0 : 1;
362}
363
364static const struct victim_selection default_v_ops = {
365 .get_victim = get_victim_by_default,
366};
367
7dda2af8 368static struct inode *find_gc_inode(struct gc_inode_list *gc_list, nid_t ino)
7bc09003 369{
7bc09003
JK
370 struct inode_entry *ie;
371
7dda2af8
CL
372 ie = radix_tree_lookup(&gc_list->iroot, ino);
373 if (ie)
374 return ie->inode;
7bc09003
JK
375 return NULL;
376}
377
7dda2af8 378static void add_gc_inode(struct gc_inode_list *gc_list, struct inode *inode)
7bc09003 379{
6cc4af56
GZ
380 struct inode_entry *new_ie;
381
7dda2af8 382 if (inode == find_gc_inode(gc_list, inode->i_ino)) {
6cc4af56
GZ
383 iput(inode);
384 return;
7bc09003 385 }
06292073 386 new_ie = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
7bc09003 387 new_ie->inode = inode;
f28e5034
CY
388
389 f2fs_radix_tree_insert(&gc_list->iroot, inode->i_ino, new_ie);
7dda2af8 390 list_add_tail(&new_ie->list, &gc_list->ilist);
7bc09003
JK
391}
392
7dda2af8 393static void put_gc_inode(struct gc_inode_list *gc_list)
7bc09003
JK
394{
395 struct inode_entry *ie, *next_ie;
7dda2af8
CL
396 list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
397 radix_tree_delete(&gc_list->iroot, ie->inode->i_ino);
7bc09003
JK
398 iput(ie->inode);
399 list_del(&ie->list);
06292073 400 kmem_cache_free(inode_entry_slab, ie);
7bc09003
JK
401 }
402}
403
404static int check_valid_map(struct f2fs_sb_info *sbi,
405 unsigned int segno, int offset)
406{
407 struct sit_info *sit_i = SIT_I(sbi);
408 struct seg_entry *sentry;
409 int ret;
410
411 mutex_lock(&sit_i->sentry_lock);
412 sentry = get_seg_entry(sbi, segno);
413 ret = f2fs_test_bit(offset, sentry->cur_valid_map);
414 mutex_unlock(&sit_i->sentry_lock);
43727527 415 return ret;
7bc09003
JK
416}
417
0a8165d7 418/*
7bc09003
JK
419 * This function compares node address got in summary with that in NAT.
420 * On validity, copy that node with cold status, otherwise (invalid node)
421 * ignore that.
422 */
718e53fa 423static void gc_node_segment(struct f2fs_sb_info *sbi,
7bc09003
JK
424 struct f2fs_summary *sum, unsigned int segno, int gc_type)
425{
426 bool initial = true;
427 struct f2fs_summary *entry;
26d58599 428 block_t start_addr;
7bc09003
JK
429 int off;
430
26d58599
JK
431 start_addr = START_BLOCK(sbi, segno);
432
7bc09003
JK
433next_step:
434 entry = sum;
c718379b 435
7bc09003
JK
436 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
437 nid_t nid = le32_to_cpu(entry->nid);
438 struct page *node_page;
26d58599 439 struct node_info ni;
7bc09003 440
43727527
JK
441 /* stop BG_GC if there is not enough free sections. */
442 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
718e53fa 443 return;
7bc09003 444
43727527 445 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
446 continue;
447
448 if (initial) {
449 ra_node_page(sbi, nid);
450 continue;
451 }
452 node_page = get_node_page(sbi, nid);
453 if (IS_ERR(node_page))
454 continue;
455
9a01b56b
HY
456 /* block may become invalid during get_node_page */
457 if (check_valid_map(sbi, segno, off) == 0) {
458 f2fs_put_page(node_page, 1);
459 continue;
26d58599
JK
460 }
461
462 get_node_info(sbi, nid, &ni);
463 if (ni.blk_addr != start_addr + off) {
464 f2fs_put_page(node_page, 1);
465 continue;
9a01b56b
HY
466 }
467
7bc09003 468 /* set page dirty and write it */
4ebefc44 469 if (gc_type == FG_GC) {
fec1d657 470 f2fs_wait_on_page_writeback(node_page, NODE, true);
7bc09003 471 set_page_dirty(node_page);
4ebefc44
JK
472 } else {
473 if (!PageWriteback(node_page))
474 set_page_dirty(node_page);
475 }
7bc09003 476 f2fs_put_page(node_page, 1);
e1235983 477 stat_inc_node_blk_count(sbi, 1, gc_type);
7bc09003 478 }
c718379b 479
7bc09003
JK
480 if (initial) {
481 initial = false;
482 goto next_step;
483 }
7bc09003
JK
484}
485
0a8165d7 486/*
9af45ef5
JK
487 * Calculate start block index indicating the given node offset.
488 * Be careful, caller should give this node offset only indicating direct node
489 * blocks. If any node offsets, which point the other types of node blocks such
490 * as indirect or double indirect node blocks, are given, it must be a caller's
491 * bug.
7bc09003 492 */
81ca7350 493block_t start_bidx_of_node(unsigned int node_ofs, struct inode *inode)
7bc09003 494{
ce19a5d4
JK
495 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
496 unsigned int bidx;
7bc09003 497
ce19a5d4
JK
498 if (node_ofs == 0)
499 return 0;
7bc09003 500
ce19a5d4 501 if (node_ofs <= 2) {
7bc09003
JK
502 bidx = node_ofs - 1;
503 } else if (node_ofs <= indirect_blks) {
ce19a5d4 504 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
505 bidx = node_ofs - 2 - dec;
506 } else {
ce19a5d4 507 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
7bc09003
JK
508 bidx = node_ofs - 5 - dec;
509 }
81ca7350 510 return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE(inode);
7bc09003
JK
511}
512
c1079892 513static bool is_alive(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
7bc09003
JK
514 struct node_info *dni, block_t blkaddr, unsigned int *nofs)
515{
516 struct page *node_page;
517 nid_t nid;
518 unsigned int ofs_in_node;
519 block_t source_blkaddr;
520
521 nid = le32_to_cpu(sum->nid);
522 ofs_in_node = le16_to_cpu(sum->ofs_in_node);
523
524 node_page = get_node_page(sbi, nid);
525 if (IS_ERR(node_page))
c1079892 526 return false;
7bc09003
JK
527
528 get_node_info(sbi, nid, dni);
529
530 if (sum->version != dni->version) {
531 f2fs_put_page(node_page, 1);
c1079892 532 return false;
7bc09003
JK
533 }
534
535 *nofs = ofs_of_node(node_page);
536 source_blkaddr = datablock_addr(node_page, ofs_in_node);
537 f2fs_put_page(node_page, 1);
538
539 if (source_blkaddr != blkaddr)
c1079892
NK
540 return false;
541 return true;
7bc09003
JK
542}
543
4375a336
JK
544static void move_encrypted_block(struct inode *inode, block_t bidx)
545{
546 struct f2fs_io_info fio = {
547 .sbi = F2FS_I_SB(inode),
548 .type = DATA,
549 .rw = READ_SYNC,
550 .encrypted_page = NULL,
551 };
552 struct dnode_of_data dn;
553 struct f2fs_summary sum;
554 struct node_info ni;
555 struct page *page;
556 int err;
557
558 /* do not read out */
a56c7c6f 559 page = f2fs_grab_cache_page(inode->i_mapping, bidx, false);
4375a336
JK
560 if (!page)
561 return;
562
563 set_new_dnode(&dn, inode, NULL, NULL, 0);
564 err = get_dnode_of_data(&dn, bidx, LOOKUP_NODE);
565 if (err)
566 goto out;
567
08b39fbd
CY
568 if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
569 ClearPageUptodate(page);
4375a336 570 goto put_out;
08b39fbd
CY
571 }
572
573 /*
574 * don't cache encrypted data into meta inode until previous dirty
575 * data were writebacked to avoid racing between GC and flush.
576 */
fec1d657 577 f2fs_wait_on_page_writeback(page, DATA, true);
4375a336
JK
578
579 get_node_info(fio.sbi, dn.nid, &ni);
580 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
581
582 /* read page */
583 fio.page = page;
584 fio.blk_addr = dn.data_blkaddr;
585
1b77c416
JK
586 fio.encrypted_page = pagecache_get_page(META_MAPPING(fio.sbi),
587 fio.blk_addr,
588 FGP_LOCK|FGP_CREAT,
589 GFP_NOFS);
4375a336
JK
590 if (!fio.encrypted_page)
591 goto put_out;
592
548aedac
JK
593 err = f2fs_submit_page_bio(&fio);
594 if (err)
595 goto put_page_out;
596
597 /* write page */
598 lock_page(fio.encrypted_page);
599
600 if (unlikely(!PageUptodate(fio.encrypted_page)))
601 goto put_page_out;
602 if (unlikely(fio.encrypted_page->mapping != META_MAPPING(fio.sbi)))
603 goto put_page_out;
604
6282adbf 605 set_page_dirty(fio.encrypted_page);
fec1d657 606 f2fs_wait_on_page_writeback(fio.encrypted_page, DATA, true);
6282adbf
JK
607 if (clear_page_dirty_for_io(fio.encrypted_page))
608 dec_page_count(fio.sbi, F2FS_DIRTY_META);
609
548aedac 610 set_page_writeback(fio.encrypted_page);
4375a336
JK
611
612 /* allocate block address */
fec1d657 613 f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
4375a336
JK
614 allocate_data_block(fio.sbi, NULL, fio.blk_addr,
615 &fio.blk_addr, &sum, CURSEG_COLD_DATA);
4375a336
JK
616 fio.rw = WRITE_SYNC;
617 f2fs_submit_page_mbio(&fio);
618
548aedac 619 dn.data_blkaddr = fio.blk_addr;
4375a336
JK
620 set_data_blkaddr(&dn);
621 f2fs_update_extent_cache(&dn);
622 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
623 if (page->index == 0)
624 set_inode_flag(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
548aedac 625put_page_out:
4375a336
JK
626 f2fs_put_page(fio.encrypted_page, 1);
627put_out:
628 f2fs_put_dnode(&dn);
629out:
630 f2fs_put_page(page, 1);
631}
632
c879f90d 633static void move_data_page(struct inode *inode, block_t bidx, int gc_type)
7bc09003 634{
c879f90d
JK
635 struct page *page;
636
a56c7c6f 637 page = get_lock_data_page(inode, bidx, true);
c879f90d
JK
638 if (IS_ERR(page))
639 return;
63a0b7cb 640
7bc09003 641 if (gc_type == BG_GC) {
4ebefc44
JK
642 if (PageWriteback(page))
643 goto out;
7bc09003
JK
644 set_page_dirty(page);
645 set_cold_data(page);
646 } else {
c879f90d
JK
647 struct f2fs_io_info fio = {
648 .sbi = F2FS_I_SB(inode),
649 .type = DATA,
650 .rw = WRITE_SYNC,
651 .page = page,
4375a336 652 .encrypted_page = NULL,
c879f90d 653 };
6282adbf 654 set_page_dirty(page);
fec1d657 655 f2fs_wait_on_page_writeback(page, DATA, true);
1fe54f9d 656 if (clear_page_dirty_for_io(page))
a7ffdbe2 657 inode_dec_dirty_pages(inode);
7bc09003 658 set_cold_data(page);
05ca3632 659 do_write_data_page(&fio);
7bc09003
JK
660 clear_cold_data(page);
661 }
662out:
663 f2fs_put_page(page, 1);
664}
665
0a8165d7 666/*
7bc09003
JK
667 * This function tries to get parent node of victim data block, and identifies
668 * data block validity. If the block is valid, copy that with cold status and
669 * modify parent node.
670 * If the parent node is not valid or the data block address is different,
671 * the victim data block is ignored.
672 */
718e53fa 673static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
7dda2af8 674 struct gc_inode_list *gc_list, unsigned int segno, int gc_type)
7bc09003
JK
675{
676 struct super_block *sb = sbi->sb;
677 struct f2fs_summary *entry;
678 block_t start_addr;
43727527 679 int off;
7bc09003
JK
680 int phase = 0;
681
682 start_addr = START_BLOCK(sbi, segno);
683
684next_step:
685 entry = sum;
c718379b 686
7bc09003
JK
687 for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
688 struct page *data_page;
689 struct inode *inode;
690 struct node_info dni; /* dnode info for the data */
691 unsigned int ofs_in_node, nofs;
692 block_t start_bidx;
693
43727527
JK
694 /* stop BG_GC if there is not enough free sections. */
695 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0))
718e53fa 696 return;
7bc09003 697
43727527 698 if (check_valid_map(sbi, segno, off) == 0)
7bc09003
JK
699 continue;
700
701 if (phase == 0) {
702 ra_node_page(sbi, le32_to_cpu(entry->nid));
703 continue;
704 }
705
706 /* Get an inode by ino with checking validity */
c1079892 707 if (!is_alive(sbi, entry, &dni, start_addr + off, &nofs))
7bc09003
JK
708 continue;
709
710 if (phase == 1) {
711 ra_node_page(sbi, dni.ino);
712 continue;
713 }
714
7bc09003
JK
715 ofs_in_node = le16_to_cpu(entry->ofs_in_node);
716
717 if (phase == 2) {
d4686d56 718 inode = f2fs_iget(sb, dni.ino);
b73e5282 719 if (IS_ERR(inode) || is_bad_inode(inode))
7bc09003
JK
720 continue;
721
4375a336
JK
722 /* if encrypted inode, let's go phase 3 */
723 if (f2fs_encrypted_inode(inode) &&
724 S_ISREG(inode->i_mode)) {
725 add_gc_inode(gc_list, inode);
726 continue;
727 }
728
81ca7350 729 start_bidx = start_bidx_of_node(nofs, inode);
43f3eae1 730 data_page = get_read_data_page(inode,
a56c7c6f 731 start_bidx + ofs_in_node, READA, true);
31a32688
CL
732 if (IS_ERR(data_page)) {
733 iput(inode);
734 continue;
735 }
7bc09003
JK
736
737 f2fs_put_page(data_page, 0);
7dda2af8 738 add_gc_inode(gc_list, inode);
31a32688
CL
739 continue;
740 }
741
742 /* phase 3 */
7dda2af8 743 inode = find_gc_inode(gc_list, dni.ino);
31a32688 744 if (inode) {
81ca7350 745 start_bidx = start_bidx_of_node(nofs, inode)
c879f90d 746 + ofs_in_node;
4375a336
JK
747 if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
748 move_encrypted_block(inode, start_bidx);
749 else
750 move_data_page(inode, start_bidx, gc_type);
e1235983 751 stat_inc_data_blk_count(sbi, 1, gc_type);
7bc09003 752 }
7bc09003 753 }
c718379b 754
7bc09003
JK
755 if (++phase < 4)
756 goto next_step;
7bc09003
JK
757}
758
759static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
8a2d0ace 760 int gc_type)
7bc09003
JK
761{
762 struct sit_info *sit_i = SIT_I(sbi);
763 int ret;
8a2d0ace 764
7bc09003 765 mutex_lock(&sit_i->sentry_lock);
8a2d0ace
GZ
766 ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type,
767 NO_CHECK_TYPE, LFS);
7bc09003
JK
768 mutex_unlock(&sit_i->sentry_lock);
769 return ret;
770}
771
718e53fa
CY
772static int do_garbage_collect(struct f2fs_sb_info *sbi,
773 unsigned int start_segno,
7dda2af8 774 struct gc_inode_list *gc_list, int gc_type)
7bc09003
JK
775{
776 struct page *sum_page;
777 struct f2fs_summary_block *sum;
c718379b 778 struct blk_plug plug;
718e53fa
CY
779 unsigned int segno = start_segno;
780 unsigned int end_segno = start_segno + sbi->segs_per_sec;
781 int seg_freed = 0;
782 unsigned char type = IS_DATASEG(get_seg_entry(sbi, segno)->type) ?
783 SUM_TYPE_DATA : SUM_TYPE_NODE;
7bc09003 784
718e53fa
CY
785 /* readahead multi ssa blocks those have contiguous address */
786 if (sbi->segs_per_sec > 1)
787 ra_meta_pages(sbi, GET_SUM_BLOCK(sbi, segno),
788 sbi->segs_per_sec, META_SSA, true);
789
790 /* reference all summary page */
791 while (segno < end_segno) {
792 sum_page = get_sum_page(sbi, segno++);
793 unlock_page(sum_page);
794 }
7bc09003 795
c718379b
JK
796 blk_start_plug(&plug);
797
718e53fa
CY
798 for (segno = start_segno; segno < end_segno; segno++) {
799 /* find segment summary of victim */
800 sum_page = find_get_page(META_MAPPING(sbi),
801 GET_SUM_BLOCK(sbi, segno));
802 f2fs_bug_on(sbi, !PageUptodate(sum_page));
803 f2fs_put_page(sum_page, 0);
7bc09003 804
718e53fa
CY
805 sum = page_address(sum_page);
806 f2fs_bug_on(sbi, type != GET_SUM_TYPE((&sum->footer)));
807
808 /*
809 * this is to avoid deadlock:
810 * - lock_page(sum_page) - f2fs_replace_block
811 * - check_valid_map() - mutex_lock(sentry_lock)
812 * - mutex_lock(sentry_lock) - change_curseg()
813 * - lock_page(sum_page)
814 */
815
816 if (type == SUM_TYPE_NODE)
817 gc_node_segment(sbi, sum->entries, segno, gc_type);
818 else
819 gc_data_segment(sbi, sum->entries, gc_list, segno,
820 gc_type);
821
822 stat_inc_seg_count(sbi, type, gc_type);
718e53fa
CY
823
824 f2fs_put_page(sum_page, 0);
825 }
826
827 if (gc_type == FG_GC) {
828 if (type == SUM_TYPE_NODE) {
829 struct writeback_control wbc = {
830 .sync_mode = WB_SYNC_ALL,
831 .nr_to_write = LONG_MAX,
832 .for_reclaim = 0,
833 };
834 sync_node_pages(sbi, 0, &wbc);
835 } else {
836 f2fs_submit_merged_bio(sbi, DATA, WRITE);
837 }
7bc09003 838 }
c718379b 839
718e53fa 840 blk_finish_plug(&plug);
7bc09003 841
718e53fa
CY
842 if (gc_type == FG_GC) {
843 while (start_segno < end_segno)
844 if (get_valid_blocks(sbi, start_segno++, 1) == 0)
845 seg_freed++;
846 }
17d899df
CY
847
848 stat_inc_call_count(sbi->stat_info);
849
718e53fa 850 return seg_freed;
7bc09003
JK
851}
852
d530d4d8 853int f2fs_gc(struct f2fs_sb_info *sbi, bool sync)
7bc09003 854{
718e53fa 855 unsigned int segno;
d530d4d8 856 int gc_type = sync ? FG_GC : BG_GC;
718e53fa 857 int sec_freed = 0, seg_freed;
d530d4d8 858 int ret = -EINVAL;
d5053a34 859 struct cp_control cpc;
7dda2af8
CL
860 struct gc_inode_list gc_list = {
861 .ilist = LIST_HEAD_INIT(gc_list.ilist),
769ec6e5 862 .iroot = RADIX_TREE_INIT(GFP_NOFS),
7dda2af8 863 };
d5053a34 864
119ee914 865 cpc.reason = __get_cp_reason(sbi);
7bc09003 866gc_more:
ab126cfc
JK
867 segno = NULL_SEGNO;
868
6bacf52f 869 if (unlikely(!(sbi->sb->s_flags & MS_ACTIVE)))
408e9375 870 goto stop;
6d5a1495
CY
871 if (unlikely(f2fs_cp_error(sbi))) {
872 ret = -EIO;
203681f6 873 goto stop;
6d5a1495 874 }
7bc09003 875
45fe8492 876 if (gc_type == BG_GC && has_not_enough_free_secs(sbi, sec_freed)) {
408e9375 877 gc_type = FG_GC;
6e17bfbc
JK
878 /*
879 * If there is no victim and no prefree segment but still not
880 * enough free sections, we should flush dent/node blocks and do
881 * garbage collections.
882 */
798c1b16
JK
883 if (__get_victim(sbi, &segno, gc_type) || prefree_segments(sbi))
884 write_checkpoint(sbi, &cpc);
6e17bfbc
JK
885 else if (has_not_enough_free_secs(sbi, 0))
886 write_checkpoint(sbi, &cpc);
d64f8047 887 }
7bc09003 888
798c1b16 889 if (segno == NULL_SEGNO && !__get_victim(sbi, &segno, gc_type))
408e9375 890 goto stop;
43727527 891 ret = 0;
7bc09003 892
718e53fa 893 seg_freed = do_garbage_collect(sbi, segno, &gc_list, gc_type);
45fe8492 894
718e53fa 895 if (gc_type == FG_GC && seg_freed == sbi->segs_per_sec)
45fe8492 896 sec_freed++;
43727527 897
5ee5293c 898 if (gc_type == FG_GC)
5ec4e49f 899 sbi->cur_victim_sec = NULL_SEGNO;
43727527 900
d530d4d8
CY
901 if (!sync) {
902 if (has_not_enough_free_secs(sbi, sec_freed))
903 goto gc_more;
43727527 904
d530d4d8
CY
905 if (gc_type == FG_GC)
906 write_checkpoint(sbi, &cpc);
907 }
408e9375 908stop:
7bc09003
JK
909 mutex_unlock(&sbi->gc_mutex);
910
7dda2af8 911 put_gc_inode(&gc_list);
d530d4d8
CY
912
913 if (sync)
914 ret = sec_freed ? 0 : -EAGAIN;
43727527 915 return ret;
7bc09003
JK
916}
917
918void build_gc_manager(struct f2fs_sb_info *sbi)
919{
920 DIRTY_I(sbi)->v_ops = &default_v_ops;
921}