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