gc.c 27.5 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 * fs/f2fs/gc.c
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#include <linux/fs.h>
#include <linux/module.h>
#include <linux/backing-dev.h>
#include <linux/init.h>
#include <linux/f2fs_fs.h>
#include <linux/kthread.h>
#include <linux/delay.h>
#include <linux/freezer.h>

#include "f2fs.h"
#include "node.h"
#include "segment.h"
#include "gc.h"
24
#include <trace/events/f2fs.h>
25 26 27 28

static int gc_thread_func(void *data)
{
	struct f2fs_sb_info *sbi = data;
29
	struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
30
	wait_queue_head_t *wq = &sbi->gc_thread->gc_wait_queue_head;
31
	unsigned int wait_ms;
32

33
	wait_ms = gc_th->min_sleep_time;
34

35
	set_freezable();
36
	do {
37
		wait_event_interruptible_timeout(*wq,
38 39
				kthread_should_stop() || freezing(current) ||
				gc_th->gc_wake,
40 41
				msecs_to_jiffies(wait_ms));

42 43 44 45
		/* give it a try one time */
		if (gc_th->gc_wake)
			gc_th->gc_wake = 0;

46 47 48 49 50
		if (try_to_freeze())
			continue;
		if (kthread_should_stop())
			break;

51
		if (sbi->sb->s_writers.frozen >= SB_FREEZE_WRITE) {
52
			increase_sleep_time(gc_th, &wait_ms);
53 54 55
			continue;
		}

56
#ifdef CONFIG_F2FS_FAULT_INJECTION
57 58
		if (time_to_inject(sbi, FAULT_CHECKPOINT)) {
			f2fs_show_injection_info(FAULT_CHECKPOINT);
59
			f2fs_stop_checkpoint(sbi, false);
60
		}
61 62
#endif

63 64 65
		if (!sb_start_write_trylock(sbi->sb))
			continue;

66 67 68 69 70 71 72 73
		/*
		 * [GC triggering condition]
		 * 0. GC is not conducted currently.
		 * 1. There are enough dirty segments.
		 * 2. IO subsystem is idle by checking the # of writeback pages.
		 * 3. IO subsystem is idle by checking the # of requests in
		 *    bdev's request list.
		 *
A
arter97 已提交
74
		 * Note) We have to avoid triggering GCs frequently.
75 76 77 78
		 * Because it is possible that some segments can be
		 * invalidated soon after by user update or deletion.
		 * So, I'd like to wait some time to collect dirty segments.
		 */
79 80
		if (gc_th->gc_urgent) {
			wait_ms = gc_th->urgent_sleep_time;
81
			mutex_lock(&sbi->gc_mutex);
82 83 84
			goto do_gc;
		}

85 86 87
		if (!mutex_trylock(&sbi->gc_mutex))
			goto next;

88
		if (!is_idle(sbi)) {
89
			increase_sleep_time(gc_th, &wait_ms);
90
			mutex_unlock(&sbi->gc_mutex);
91
			goto next;
92 93 94
		}

		if (has_enough_invalid_blocks(sbi))
95
			decrease_sleep_time(gc_th, &wait_ms);
96
		else
97
			increase_sleep_time(gc_th, &wait_ms);
98
do_gc:
99
		stat_inc_bggc_count(sbi);
100

101
		/* if return value is not zero, no victim was selected */
102
		if (f2fs_gc(sbi, test_opt(sbi, FORCE_FG_GC), true, NULL_SEGNO))
103
			wait_ms = gc_th->no_gc_sleep_time;
104

105 106 107
		trace_f2fs_background_gc(sbi->sb, wait_ms,
				prefree_segments(sbi), free_segments(sbi));

108 109
		/* balancing f2fs's metadata periodically */
		f2fs_balance_fs_bg(sbi);
110 111
next:
		sb_end_write(sbi->sb);
112

113 114 115 116 117 118
	} while (!kthread_should_stop());
	return 0;
}

int start_gc_thread(struct f2fs_sb_info *sbi)
{
N
Namjae Jeon 已提交
119
	struct f2fs_gc_kthread *gc_th;
120
	dev_t dev = sbi->sb->s_bdev->bd_dev;
121
	int err = 0;
122

123
	gc_th = f2fs_kmalloc(sbi, sizeof(struct f2fs_gc_kthread), GFP_KERNEL);
124 125 126 127
	if (!gc_th) {
		err = -ENOMEM;
		goto out;
	}
128

129
	gc_th->urgent_sleep_time = DEF_GC_THREAD_URGENT_SLEEP_TIME;
130 131 132 133
	gc_th->min_sleep_time = DEF_GC_THREAD_MIN_SLEEP_TIME;
	gc_th->max_sleep_time = DEF_GC_THREAD_MAX_SLEEP_TIME;
	gc_th->no_gc_sleep_time = DEF_GC_THREAD_NOGC_SLEEP_TIME;

134
	gc_th->gc_idle = 0;
135 136
	gc_th->gc_urgent = 0;
	gc_th->gc_wake= 0;
137

138 139 140
	sbi->gc_thread = gc_th;
	init_waitqueue_head(&sbi->gc_thread->gc_wait_queue_head);
	sbi->gc_thread->f2fs_gc_task = kthread_run(gc_thread_func, sbi,
141
			"f2fs_gc-%u:%u", MAJOR(dev), MINOR(dev));
142
	if (IS_ERR(gc_th->f2fs_gc_task)) {
143
		err = PTR_ERR(gc_th->f2fs_gc_task);
144
		kfree(gc_th);
145
		sbi->gc_thread = NULL;
146
	}
147 148
out:
	return err;
149 150 151 152 153 154 155 156 157 158 159 160
}

void stop_gc_thread(struct f2fs_sb_info *sbi)
{
	struct f2fs_gc_kthread *gc_th = sbi->gc_thread;
	if (!gc_th)
		return;
	kthread_stop(gc_th->f2fs_gc_task);
	kfree(gc_th);
	sbi->gc_thread = NULL;
}

161
static int select_gc_type(struct f2fs_gc_kthread *gc_th, int gc_type)
162
{
163 164
	int gc_mode = (gc_type == BG_GC) ? GC_CB : GC_GREEDY;

165 166 167 168
	if (!gc_th)
		return gc_mode;

	if (gc_th->gc_idle) {
169 170 171 172 173
		if (gc_th->gc_idle == 1)
			gc_mode = GC_CB;
		else if (gc_th->gc_idle == 2)
			gc_mode = GC_GREEDY;
	}
174 175
	if (gc_th->gc_urgent)
		gc_mode = GC_GREEDY;
176
	return gc_mode;
177 178 179 180 181 182 183
}

static void select_policy(struct f2fs_sb_info *sbi, int gc_type,
			int type, struct victim_sel_policy *p)
{
	struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);

184
	if (p->alloc_mode == SSR) {
185 186
		p->gc_mode = GC_GREEDY;
		p->dirty_segmap = dirty_i->dirty_segmap[type];
187
		p->max_search = dirty_i->nr_dirty[type];
188 189
		p->ofs_unit = 1;
	} else {
190
		p->gc_mode = select_gc_type(sbi->gc_thread, gc_type);
191
		p->dirty_segmap = dirty_i->dirty_segmap[DIRTY];
192
		p->max_search = dirty_i->nr_dirty[DIRTY];
193 194
		p->ofs_unit = sbi->segs_per_sec;
	}
195

196
	/* we need to check every dirty segments in the FG_GC case */
197 198 199
	if (gc_type != FG_GC &&
			(sbi->gc_thread && !sbi->gc_thread->gc_urgent) &&
			p->max_search > sbi->max_victim_search)
200
		p->max_search = sbi->max_victim_search;
201

202 203 204
	/* let's select beginning hot/small space first in no_heap mode*/
	if (test_opt(sbi, NOHEAP) &&
		(type == CURSEG_HOT_DATA || IS_NODESEG(type)))
205 206
		p->offset = 0;
	else
207
		p->offset = SIT_I(sbi)->last_victim[p->gc_mode];
208 209 210 211 212
}

static unsigned int get_max_cost(struct f2fs_sb_info *sbi,
				struct victim_sel_policy *p)
{
213 214
	/* SSR allocates in a segment unit */
	if (p->alloc_mode == SSR)
215
		return sbi->blocks_per_seg;
216
	if (p->gc_mode == GC_GREEDY)
217
		return 2 * sbi->blocks_per_seg * p->ofs_unit;
218 219 220 221 222 223 224 225 226
	else if (p->gc_mode == GC_CB)
		return UINT_MAX;
	else /* No other gc_mode */
		return 0;
}

static unsigned int check_bg_victims(struct f2fs_sb_info *sbi)
{
	struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
227
	unsigned int secno;
228 229 230 231 232 233

	/*
	 * If the gc_type is FG_GC, we can select victim segments
	 * selected by background GC before.
	 * Those segments guarantee they have small valid blocks.
	 */
234
	for_each_set_bit(secno, dirty_i->victim_secmap, MAIN_SECS(sbi)) {
235
		if (sec_usage_check(sbi, secno))
236
			continue;
237 238 239 240

		if (no_fggc_candidate(sbi, secno))
			continue;

241
		clear_bit(secno, dirty_i->victim_secmap);
242
		return GET_SEG_FROM_SEC(sbi, secno);
243 244 245 246 247 248 249
	}
	return NULL_SEGNO;
}

static unsigned int get_cb_cost(struct f2fs_sb_info *sbi, unsigned int segno)
{
	struct sit_info *sit_i = SIT_I(sbi);
250 251
	unsigned int secno = GET_SEC_FROM_SEG(sbi, segno);
	unsigned int start = GET_SEG_FROM_SEC(sbi, secno);
252 253 254 255 256 257 258 259
	unsigned long long mtime = 0;
	unsigned int vblocks;
	unsigned char age = 0;
	unsigned char u;
	unsigned int i;

	for (i = 0; i < sbi->segs_per_sec; i++)
		mtime += get_seg_entry(sbi, start + i)->mtime;
260
	vblocks = get_valid_blocks(sbi, segno, true);
261 262 263 264 265 266

	mtime = div_u64(mtime, sbi->segs_per_sec);
	vblocks = div_u64(vblocks, sbi->segs_per_sec);

	u = (vblocks * 100) >> sbi->log_blocks_per_seg;

A
arter97 已提交
267
	/* Handle if the system time has changed by the user */
268 269 270 271 272 273 274 275 276 277 278
	if (mtime < sit_i->min_mtime)
		sit_i->min_mtime = mtime;
	if (mtime > sit_i->max_mtime)
		sit_i->max_mtime = mtime;
	if (sit_i->max_mtime != sit_i->min_mtime)
		age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime),
				sit_i->max_mtime - sit_i->min_mtime);

	return UINT_MAX - ((100 * (100 - u) * age) / (100 + u));
}

279 280
static inline unsigned int get_gc_cost(struct f2fs_sb_info *sbi,
			unsigned int segno, struct victim_sel_policy *p)
281 282
{
	if (p->alloc_mode == SSR)
283
		return get_seg_entry(sbi, segno)->ckpt_valid_blocks;
284 285 286

	/* alloc_mode == LFS */
	if (p->gc_mode == GC_GREEDY)
287
		return get_valid_blocks(sbi, segno, true);
288 289 290 291
	else
		return get_cb_cost(sbi, segno);
}

292 293 294 295 296 297 298 299 300 301 302 303
static unsigned int count_bits(const unsigned long *addr,
				unsigned int offset, unsigned int len)
{
	unsigned int end = offset + len, sum = 0;

	while (offset < end) {
		if (test_bit(offset++, addr))
			++sum;
	}
	return sum;
}

J
Jaegeuk Kim 已提交
304
/*
M
Masanari Iida 已提交
305
 * This function is called from two paths.
306 307 308 309 310 311 312 313 314 315
 * One is garbage collection and the other is SSR segment selection.
 * When it is called during GC, it just gets a victim segment
 * and it does not remove it from dirty seglist.
 * When it is called from SSR segment selection, it finds a segment
 * which has minimum valid blocks and removes it from dirty seglist.
 */
static int get_victim_by_default(struct f2fs_sb_info *sbi,
		unsigned int *result, int gc_type, int type, char alloc_mode)
{
	struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
316
	struct sit_info *sm = SIT_I(sbi);
317
	struct victim_sel_policy p;
S
Sheng Yong 已提交
318
	unsigned int secno, last_victim;
319
	unsigned int last_segment = MAIN_SEGS(sbi);
320
	unsigned int nsearched = 0;
321

322 323
	mutex_lock(&dirty_i->seglist_lock);

324 325 326 327
	p.alloc_mode = alloc_mode;
	select_policy(sbi, gc_type, type, &p);

	p.min_segno = NULL_SEGNO;
S
Sheng Yong 已提交
328
	p.min_cost = get_max_cost(sbi, &p);
329

330 331 332 333 334 335 336 337
	if (*result != NULL_SEGNO) {
		if (IS_DATASEG(get_seg_entry(sbi, *result)->type) &&
			get_valid_blocks(sbi, *result, false) &&
			!sec_usage_check(sbi, GET_SEC_FROM_SEG(sbi, *result)))
			p.min_segno = *result;
		goto out;
	}

338 339 340
	if (p.max_search == 0)
		goto out;

341
	last_victim = sm->last_victim[p.gc_mode];
342 343 344 345 346 347 348 349
	if (p.alloc_mode == LFS && gc_type == FG_GC) {
		p.min_segno = check_bg_victims(sbi);
		if (p.min_segno != NULL_SEGNO)
			goto got_it;
	}

	while (1) {
		unsigned long cost;
350
		unsigned int segno;
351

352 353
		segno = find_next_bit(p.dirty_segmap, last_segment, p.offset);
		if (segno >= last_segment) {
354 355 356 357
			if (sm->last_victim[p.gc_mode]) {
				last_segment =
					sm->last_victim[p.gc_mode];
				sm->last_victim[p.gc_mode] = 0;
358 359 360 361 362
				p.offset = 0;
				continue;
			}
			break;
		}
363 364

		p.offset = segno + p.ofs_unit;
365
		if (p.ofs_unit > 1) {
366
			p.offset -= segno % p.ofs_unit;
367 368 369 370 371 372 373
			nsearched += count_bits(p.dirty_segmap,
						p.offset - p.ofs_unit,
						p.ofs_unit);
		} else {
			nsearched++;
		}

374
		secno = GET_SEC_FROM_SEG(sbi, segno);
375

376
		if (sec_usage_check(sbi, secno))
377
			goto next;
378
		if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
379
			goto next;
380 381 382
		if (gc_type == FG_GC && p.alloc_mode == LFS &&
					no_fggc_candidate(sbi, secno))
			goto next;
383 384 385 386 387 388

		cost = get_gc_cost(sbi, segno, &p);

		if (p.min_cost > cost) {
			p.min_segno = segno;
			p.min_cost = cost;
389
		}
390 391
next:
		if (nsearched >= p.max_search) {
392 393
			if (!sm->last_victim[p.gc_mode] && segno <= last_victim)
				sm->last_victim[p.gc_mode] = last_victim + 1;
394
			else
395 396
				sm->last_victim[p.gc_mode] = segno + 1;
			sm->last_victim[p.gc_mode] %= MAIN_SEGS(sbi);
397 398 399 400
			break;
		}
	}
	if (p.min_segno != NULL_SEGNO) {
401
got_it:
402
		if (p.alloc_mode == LFS) {
403
			secno = GET_SEC_FROM_SEG(sbi, p.min_segno);
404 405 406 407
			if (gc_type == FG_GC)
				sbi->cur_victim_sec = secno;
			else
				set_bit(secno, dirty_i->victim_secmap);
408
		}
409
		*result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
410 411 412 413

		trace_f2fs_get_victim(sbi->sb, type, gc_type, &p,
				sbi->cur_victim_sec,
				prefree_segments(sbi), free_segments(sbi));
414
	}
415
out:
416 417 418 419 420 421 422 423 424
	mutex_unlock(&dirty_i->seglist_lock);

	return (p.min_segno == NULL_SEGNO) ? 0 : 1;
}

static const struct victim_selection default_v_ops = {
	.get_victim = get_victim_by_default,
};

425
static struct inode *find_gc_inode(struct gc_inode_list *gc_list, nid_t ino)
426 427 428
{
	struct inode_entry *ie;

429 430 431
	ie = radix_tree_lookup(&gc_list->iroot, ino);
	if (ie)
		return ie->inode;
432 433 434
	return NULL;
}

435
static void add_gc_inode(struct gc_inode_list *gc_list, struct inode *inode)
436
{
437 438
	struct inode_entry *new_ie;

439
	if (inode == find_gc_inode(gc_list, inode->i_ino)) {
440 441
		iput(inode);
		return;
442
	}
443
	new_ie = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
444
	new_ie->inode = inode;
445 446

	f2fs_radix_tree_insert(&gc_list->iroot, inode->i_ino, new_ie);
447
	list_add_tail(&new_ie->list, &gc_list->ilist);
448 449
}

450
static void put_gc_inode(struct gc_inode_list *gc_list)
451 452
{
	struct inode_entry *ie, *next_ie;
453 454
	list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
		radix_tree_delete(&gc_list->iroot, ie->inode->i_ino);
455 456
		iput(ie->inode);
		list_del(&ie->list);
457
		kmem_cache_free(inode_entry_slab, ie);
458 459 460 461 462 463 464 465 466 467
	}
}

static int check_valid_map(struct f2fs_sb_info *sbi,
				unsigned int segno, int offset)
{
	struct sit_info *sit_i = SIT_I(sbi);
	struct seg_entry *sentry;
	int ret;

468
	down_read(&sit_i->sentry_lock);
469 470
	sentry = get_seg_entry(sbi, segno);
	ret = f2fs_test_bit(offset, sentry->cur_valid_map);
471
	up_read(&sit_i->sentry_lock);
472
	return ret;
473 474
}

J
Jaegeuk Kim 已提交
475
/*
476 477 478 479
 * This function compares node address got in summary with that in NAT.
 * On validity, copy that node with cold status, otherwise (invalid node)
 * ignore that.
 */
C
Chao Yu 已提交
480
static void gc_node_segment(struct f2fs_sb_info *sbi,
481 482 483
		struct f2fs_summary *sum, unsigned int segno, int gc_type)
{
	struct f2fs_summary *entry;
484
	block_t start_addr;
485
	int off;
486
	int phase = 0;
487

488 489
	start_addr = START_BLOCK(sbi, segno);

490 491
next_step:
	entry = sum;
492

493 494 495
	for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
		nid_t nid = le32_to_cpu(entry->nid);
		struct page *node_page;
496
		struct node_info ni;
497

498
		/* stop BG_GC if there is not enough free sections. */
499
		if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0, 0))
C
Chao Yu 已提交
500
			return;
501

502
		if (check_valid_map(sbi, segno, off) == 0)
503 504
			continue;

505 506 507 508 509 510 511
		if (phase == 0) {
			ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), 1,
							META_NAT, true);
			continue;
		}

		if (phase == 1) {
512 513 514
			ra_node_page(sbi, nid);
			continue;
		}
515 516

		/* phase == 2 */
517 518 519 520
		node_page = get_node_page(sbi, nid);
		if (IS_ERR(node_page))
			continue;

521 522 523 524
		/* block may become invalid during get_node_page */
		if (check_valid_map(sbi, segno, off) == 0) {
			f2fs_put_page(node_page, 1);
			continue;
525 526 527 528 529 530
		}

		get_node_info(sbi, nid, &ni);
		if (ni.blk_addr != start_addr + off) {
			f2fs_put_page(node_page, 1);
			continue;
531 532
		}

533
		move_node_page(node_page, gc_type);
534
		stat_inc_node_blk_count(sbi, 1, gc_type);
535
	}
536

537
	if (++phase < 3)
538 539 540
		goto next_step;
}

J
Jaegeuk Kim 已提交
541
/*
542 543 544 545 546
 * Calculate start block index indicating the given node offset.
 * Be careful, caller should give this node offset only indicating direct node
 * blocks. If any node offsets, which point the other types of node blocks such
 * as indirect or double indirect node blocks, are given, it must be a caller's
 * bug.
547
 */
548
block_t start_bidx_of_node(unsigned int node_ofs, struct inode *inode)
549
{
550 551
	unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
	unsigned int bidx;
552

553 554
	if (node_ofs == 0)
		return 0;
555

556
	if (node_ofs <= 2) {
557 558
		bidx = node_ofs - 1;
	} else if (node_ofs <= indirect_blks) {
559
		int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
560 561
		bidx = node_ofs - 2 - dec;
	} else {
562
		int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
563 564
		bidx = node_ofs - 5 - dec;
	}
565
	return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE(inode);
566 567
}

568
static bool is_alive(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
569 570 571 572 573 574 575 576 577 578 579 580
		struct node_info *dni, block_t blkaddr, unsigned int *nofs)
{
	struct page *node_page;
	nid_t nid;
	unsigned int ofs_in_node;
	block_t source_blkaddr;

	nid = le32_to_cpu(sum->nid);
	ofs_in_node = le16_to_cpu(sum->ofs_in_node);

	node_page = get_node_page(sbi, nid);
	if (IS_ERR(node_page))
581
		return false;
582 583 584 585

	get_node_info(sbi, nid, dni);

	if (sum->version != dni->version) {
586 587 588 589
		f2fs_msg(sbi->sb, KERN_WARNING,
				"%s: valid data with mismatched node version.",
				__func__);
		set_sbi_flag(sbi, SBI_NEED_FSCK);
590 591 592
	}

	*nofs = ofs_of_node(node_page);
593
	source_blkaddr = datablock_addr(NULL, node_page, ofs_in_node);
594 595 596
	f2fs_put_page(node_page, 1);

	if (source_blkaddr != blkaddr)
597 598
		return false;
	return true;
599 600
}

601 602 603 604 605 606
/*
 * Move data block via META_MAPPING while keeping locked data page.
 * This can be used to move blocks, aka LBAs, directly on disk.
 */
static void move_data_block(struct inode *inode, block_t bidx,
					unsigned int segno, int off)
607 608 609
{
	struct f2fs_io_info fio = {
		.sbi = F2FS_I_SB(inode),
C
Chao Yu 已提交
610
		.ino = inode->i_ino,
611
		.type = DATA,
J
Jaegeuk Kim 已提交
612
		.temp = COLD,
M
Mike Christie 已提交
613
		.op = REQ_OP_READ,
614
		.op_flags = 0,
615
		.encrypted_page = NULL,
616
		.in_list = false,
617 618 619 620 621
	};
	struct dnode_of_data dn;
	struct f2fs_summary sum;
	struct node_info ni;
	struct page *page;
622
	block_t newaddr;
623 624 625
	int err;

	/* do not read out */
626
	page = f2fs_grab_cache_page(inode->i_mapping, bidx, false);
627 628 629
	if (!page)
		return;

630 631 632
	if (!check_valid_map(F2FS_I_SB(inode), segno, off))
		goto out;

C
Chao Yu 已提交
633 634 635
	if (f2fs_is_atomic_file(inode))
		goto out;

636 637 638 639 640
	if (f2fs_is_pinned_file(inode)) {
		f2fs_pin_file_control(inode, true);
		goto out;
	}

641 642 643 644 645
	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, bidx, LOOKUP_NODE);
	if (err)
		goto out;

646 647
	if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
		ClearPageUptodate(page);
648
		goto put_out;
649 650 651 652 653 654
	}

	/*
	 * don't cache encrypted data into meta inode until previous dirty
	 * data were writebacked to avoid racing between GC and flush.
	 */
655
	f2fs_wait_on_page_writeback(page, DATA, true);
656 657 658 659 660 661

	get_node_info(fio.sbi, dn.nid, &ni);
	set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);

	/* read page */
	fio.page = page;
662
	fio.new_blkaddr = fio.old_blkaddr = dn.data_blkaddr;
663

664
	allocate_data_block(fio.sbi, NULL, fio.old_blkaddr, &newaddr,
665
					&sum, CURSEG_COLD_DATA, NULL, false);
666

C
Chao Yu 已提交
667 668
	fio.encrypted_page = f2fs_pagecache_get_page(META_MAPPING(fio.sbi),
				newaddr, FGP_LOCK | FGP_CREAT, GFP_NOFS);
669 670 671 672
	if (!fio.encrypted_page) {
		err = -ENOMEM;
		goto recover_block;
	}
673

674 675 676 677 678 679 680
	err = f2fs_submit_page_bio(&fio);
	if (err)
		goto put_page_out;

	/* write page */
	lock_page(fio.encrypted_page);

681
	if (unlikely(fio.encrypted_page->mapping != META_MAPPING(fio.sbi))) {
682
		err = -EIO;
683
		goto put_page_out;
684
	}
685
	if (unlikely(!PageUptodate(fio.encrypted_page))) {
686
		err = -EIO;
687
		goto put_page_out;
688
	}
689

690
	set_page_dirty(fio.encrypted_page);
691
	f2fs_wait_on_page_writeback(fio.encrypted_page, DATA, true);
692 693 694
	if (clear_page_dirty_for_io(fio.encrypted_page))
		dec_page_count(fio.sbi, F2FS_DIRTY_META);

695
	set_page_writeback(fio.encrypted_page);
J
Jaegeuk Kim 已提交
696
	ClearPageError(page);
697 698

	/* allocate block address */
699
	f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
700

M
Mike Christie 已提交
701
	fio.op = REQ_OP_WRITE;
702
	fio.op_flags = REQ_SYNC;
703
	fio.new_blkaddr = newaddr;
704 705 706 707 708 709
	err = f2fs_submit_page_write(&fio);
	if (err) {
		if (PageWriteback(fio.encrypted_page))
			end_page_writeback(fio.encrypted_page);
		goto put_page_out;
	}
710

C
Chao Yu 已提交
711 712
	f2fs_update_iostat(fio.sbi, FS_GC_DATA_IO, F2FS_BLKSIZE);

713
	f2fs_update_data_blkaddr(&dn, newaddr);
714
	set_inode_flag(inode, FI_APPEND_WRITE);
715
	if (page->index == 0)
716
		set_inode_flag(inode, FI_FIRST_BLOCK_WRITTEN);
717
put_page_out:
718
	f2fs_put_page(fio.encrypted_page, 1);
719 720 721 722
recover_block:
	if (err)
		__f2fs_replace_block(fio.sbi, &sum, newaddr, fio.old_blkaddr,
								true, true);
723 724 725 726 727 728
put_out:
	f2fs_put_dnode(&dn);
out:
	f2fs_put_page(page, 1);
}

729 730
static void move_data_page(struct inode *inode, block_t bidx, int gc_type,
							unsigned int segno, int off)
731
{
J
Jaegeuk Kim 已提交
732 733
	struct page *page;

734
	page = get_lock_data_page(inode, bidx, true);
J
Jaegeuk Kim 已提交
735 736
	if (IS_ERR(page))
		return;
737

738 739 740
	if (!check_valid_map(F2FS_I_SB(inode), segno, off))
		goto out;

C
Chao Yu 已提交
741 742
	if (f2fs_is_atomic_file(inode))
		goto out;
743 744 745 746 747
	if (f2fs_is_pinned_file(inode)) {
		if (gc_type == FG_GC)
			f2fs_pin_file_control(inode, true);
		goto out;
	}
C
Chao Yu 已提交
748

749
	if (gc_type == BG_GC) {
750 751
		if (PageWriteback(page))
			goto out;
752 753 754
		set_page_dirty(page);
		set_cold_data(page);
	} else {
J
Jaegeuk Kim 已提交
755 756
		struct f2fs_io_info fio = {
			.sbi = F2FS_I_SB(inode),
C
Chao Yu 已提交
757
			.ino = inode->i_ino,
J
Jaegeuk Kim 已提交
758
			.type = DATA,
J
Jaegeuk Kim 已提交
759
			.temp = COLD,
M
Mike Christie 已提交
760
			.op = REQ_OP_WRITE,
761
			.op_flags = REQ_SYNC,
762
			.old_blkaddr = NULL_ADDR,
J
Jaegeuk Kim 已提交
763
			.page = page,
764
			.encrypted_page = NULL,
765
			.need_lock = LOCK_REQ,
C
Chao Yu 已提交
766
			.io_type = FS_GC_DATA_IO,
J
Jaegeuk Kim 已提交
767
		};
768 769 770 771
		bool is_dirty = PageDirty(page);
		int err;

retry:
772
		set_page_dirty(page);
773
		f2fs_wait_on_page_writeback(page, DATA, true);
774
		if (clear_page_dirty_for_io(page)) {
775
			inode_dec_dirty_pages(inode);
776 777
			remove_dirty_inode(inode);
		}
778

779
		set_cold_data(page);
780 781 782 783 784 785

		err = do_write_data_page(&fio);
		if (err == -ENOMEM && is_dirty) {
			congestion_wait(BLK_RW_ASYNC, HZ/50);
			goto retry;
		}
786 787 788 789 790
	}
out:
	f2fs_put_page(page, 1);
}

J
Jaegeuk Kim 已提交
791
/*
792 793 794 795 796 797
 * This function tries to get parent node of victim data block, and identifies
 * data block validity. If the block is valid, copy that with cold status and
 * modify parent node.
 * If the parent node is not valid or the data block address is different,
 * the victim data block is ignored.
 */
C
Chao Yu 已提交
798
static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
799
		struct gc_inode_list *gc_list, unsigned int segno, int gc_type)
800 801 802 803
{
	struct super_block *sb = sbi->sb;
	struct f2fs_summary *entry;
	block_t start_addr;
804
	int off;
805 806 807 808 809 810
	int phase = 0;

	start_addr = START_BLOCK(sbi, segno);

next_step:
	entry = sum;
811

812 813 814 815 816 817
	for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
		struct page *data_page;
		struct inode *inode;
		struct node_info dni; /* dnode info for the data */
		unsigned int ofs_in_node, nofs;
		block_t start_bidx;
818
		nid_t nid = le32_to_cpu(entry->nid);
819

820
		/* stop BG_GC if there is not enough free sections. */
821
		if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0, 0))
C
Chao Yu 已提交
822
			return;
823

824
		if (check_valid_map(sbi, segno, off) == 0)
825 826 827
			continue;

		if (phase == 0) {
828 829 830 831 832 833 834
			ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), 1,
							META_NAT, true);
			continue;
		}

		if (phase == 1) {
			ra_node_page(sbi, nid);
835 836 837 838
			continue;
		}

		/* Get an inode by ino with checking validity */
839
		if (!is_alive(sbi, entry, &dni, start_addr + off, &nofs))
840 841
			continue;

842
		if (phase == 2) {
843 844 845 846 847 848
			ra_node_page(sbi, dni.ino);
			continue;
		}

		ofs_in_node = le16_to_cpu(entry->ofs_in_node);

849
		if (phase == 3) {
850
			inode = f2fs_iget(sb, dni.ino);
851
			if (IS_ERR(inode) || is_bad_inode(inode))
852 853
				continue;

854 855
			/* if inode uses special I/O path, let's go phase 3 */
			if (f2fs_post_read_required(inode)) {
856 857 858 859
				add_gc_inode(gc_list, inode);
				continue;
			}

860 861 862 863 864 865
			if (!down_write_trylock(
				&F2FS_I(inode)->dio_rwsem[WRITE])) {
				iput(inode);
				continue;
			}

866
			start_bidx = start_bidx_of_node(nofs, inode);
867
			data_page = get_read_data_page(inode,
868 869
					start_bidx + ofs_in_node, REQ_RAHEAD,
					true);
870
			up_write(&F2FS_I(inode)->dio_rwsem[WRITE]);
871 872 873 874
			if (IS_ERR(data_page)) {
				iput(inode);
				continue;
			}
875 876

			f2fs_put_page(data_page, 0);
877
			add_gc_inode(gc_list, inode);
878 879 880
			continue;
		}

881
		/* phase 4 */
882
		inode = find_gc_inode(gc_list, dni.ino);
883
		if (inode) {
884 885 886 887 888 889 890 891 892 893 894 895
			struct f2fs_inode_info *fi = F2FS_I(inode);
			bool locked = false;

			if (S_ISREG(inode->i_mode)) {
				if (!down_write_trylock(&fi->dio_rwsem[READ]))
					continue;
				if (!down_write_trylock(
						&fi->dio_rwsem[WRITE])) {
					up_write(&fi->dio_rwsem[READ]);
					continue;
				}
				locked = true;
896 897 898

				/* wait for all inflight aio data */
				inode_dio_wait(inode);
899 900
			}

901
			start_bidx = start_bidx_of_node(nofs, inode)
J
Jaegeuk Kim 已提交
902
								+ ofs_in_node;
903
			if (f2fs_post_read_required(inode))
904
				move_data_block(inode, start_bidx, segno, off);
905
			else
906 907
				move_data_page(inode, start_bidx, gc_type,
								segno, off);
908 909 910 911 912 913

			if (locked) {
				up_write(&fi->dio_rwsem[WRITE]);
				up_write(&fi->dio_rwsem[READ]);
			}

914
			stat_inc_data_blk_count(sbi, 1, gc_type);
915 916
		}
	}
917

918
	if (++phase < 5)
919 920 921 922
		goto next_step;
}

static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
923
			int gc_type)
924 925 926
{
	struct sit_info *sit_i = SIT_I(sbi);
	int ret;
927

928
	down_write(&sit_i->sentry_lock);
929 930
	ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type,
					      NO_CHECK_TYPE, LFS);
931
	up_write(&sit_i->sentry_lock);
932 933 934
	return ret;
}

C
Chao Yu 已提交
935 936
static int do_garbage_collect(struct f2fs_sb_info *sbi,
				unsigned int start_segno,
937
				struct gc_inode_list *gc_list, int gc_type)
938 939 940
{
	struct page *sum_page;
	struct f2fs_summary_block *sum;
941
	struct blk_plug plug;
C
Chao Yu 已提交
942 943
	unsigned int segno = start_segno;
	unsigned int end_segno = start_segno + sbi->segs_per_sec;
C
Chao Yu 已提交
944
	int seg_freed = 0;
C
Chao Yu 已提交
945 946
	unsigned char type = IS_DATASEG(get_seg_entry(sbi, segno)->type) ?
						SUM_TYPE_DATA : SUM_TYPE_NODE;
947

C
Chao Yu 已提交
948 949 950 951 952 953 954 955 956 957
	/* readahead multi ssa blocks those have contiguous address */
	if (sbi->segs_per_sec > 1)
		ra_meta_pages(sbi, GET_SUM_BLOCK(sbi, segno),
					sbi->segs_per_sec, META_SSA, true);

	/* reference all summary page */
	while (segno < end_segno) {
		sum_page = get_sum_page(sbi, segno++);
		unlock_page(sum_page);
	}
958

959 960
	blk_start_plug(&plug);

C
Chao Yu 已提交
961
	for (segno = start_segno; segno < end_segno; segno++) {
J
Jaegeuk Kim 已提交
962

C
Chao Yu 已提交
963 964 965 966
		/* find segment summary of victim */
		sum_page = find_get_page(META_MAPPING(sbi),
					GET_SUM_BLOCK(sbi, segno));
		f2fs_put_page(sum_page, 0);
967

968
		if (get_valid_blocks(sbi, segno, false) == 0 ||
969 970 971 972
				!PageUptodate(sum_page) ||
				unlikely(f2fs_cp_error(sbi)))
			goto next;

C
Chao Yu 已提交
973 974 975 976 977 978
		sum = page_address(sum_page);
		f2fs_bug_on(sbi, type != GET_SUM_TYPE((&sum->footer)));

		/*
		 * this is to avoid deadlock:
		 * - lock_page(sum_page)         - f2fs_replace_block
979 980
		 *  - check_valid_map()            - down_write(sentry_lock)
		 *   - down_read(sentry_lock)     - change_curseg()
C
Chao Yu 已提交
981 982 983 984 985 986 987 988 989
		 *                                  - lock_page(sum_page)
		 */
		if (type == SUM_TYPE_NODE)
			gc_node_segment(sbi, sum->entries, segno, gc_type);
		else
			gc_data_segment(sbi, sum->entries, gc_list, segno,
								gc_type);

		stat_inc_seg_count(sbi, type, gc_type);
C
Chao Yu 已提交
990 991 992 993

		if (gc_type == FG_GC &&
				get_valid_blocks(sbi, segno, false) == 0)
			seg_freed++;
994
next:
C
Chao Yu 已提交
995 996 997
		f2fs_put_page(sum_page, 0);
	}

998
	if (gc_type == FG_GC)
999 1000
		f2fs_submit_merged_write(sbi,
				(type == SUM_TYPE_NODE) ? NODE : DATA);
1001

C
Chao Yu 已提交
1002
	blk_finish_plug(&plug);
1003

1004 1005
	stat_inc_call_count(sbi->stat_info);

C
Chao Yu 已提交
1006
	return seg_freed;
1007 1008
}

1009 1010
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync,
			bool background, unsigned int segno)
1011
{
C
Chao Yu 已提交
1012
	int gc_type = sync ? FG_GC : BG_GC;
C
Chao Yu 已提交
1013 1014
	int sec_freed = 0, seg_freed = 0, total_freed = 0;
	int ret = 0;
1015
	struct cp_control cpc;
1016
	unsigned int init_segno = segno;
1017 1018
	struct gc_inode_list gc_list = {
		.ilist = LIST_HEAD_INIT(gc_list.ilist),
1019
		.iroot = RADIX_TREE_INIT(gc_list.iroot, GFP_NOFS),
1020
	};
1021

C
Chao Yu 已提交
1022 1023 1024 1025 1026 1027 1028 1029 1030
	trace_f2fs_gc_begin(sbi->sb, sync, background,
				get_pages(sbi, F2FS_DIRTY_NODES),
				get_pages(sbi, F2FS_DIRTY_DENTS),
				get_pages(sbi, F2FS_DIRTY_IMETA),
				free_sections(sbi),
				free_segments(sbi),
				reserved_segments(sbi),
				prefree_segments(sbi));

1031
	cpc.reason = __get_cp_reason(sbi);
1032
gc_more:
1033
	if (unlikely(!(sbi->sb->s_flags & SB_ACTIVE))) {
1034
		ret = -EINVAL;
J
Jaegeuk Kim 已提交
1035
		goto stop;
1036
	}
C
Chao Yu 已提交
1037 1038
	if (unlikely(f2fs_cp_error(sbi))) {
		ret = -EIO;
1039
		goto stop;
C
Chao Yu 已提交
1040
	}
1041

1042
	if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0, 0)) {
1043
		/*
1044 1045 1046
		 * For example, if there are many prefree_segments below given
		 * threshold, we can make them free by checkpoint. Then, we
		 * secure free segments which doesn't need fggc any more.
1047
		 */
1048 1049 1050 1051 1052
		if (prefree_segments(sbi)) {
			ret = write_checkpoint(sbi, &cpc);
			if (ret)
				goto stop;
		}
1053 1054
		if (has_not_enough_free_secs(sbi, 0, 0))
			gc_type = FG_GC;
1055
	}
1056

1057
	/* f2fs_balance_fs doesn't need to do BG_GC in critical path. */
C
Chao Yu 已提交
1058 1059
	if (gc_type == BG_GC && !background) {
		ret = -EINVAL;
1060
		goto stop;
C
Chao Yu 已提交
1061 1062 1063
	}
	if (!__get_victim(sbi, &segno, gc_type)) {
		ret = -ENODATA;
J
Jaegeuk Kim 已提交
1064
		goto stop;
C
Chao Yu 已提交
1065
	}
1066

C
Chao Yu 已提交
1067 1068
	seg_freed = do_garbage_collect(sbi, segno, &gc_list, gc_type);
	if (gc_type == FG_GC && seg_freed == sbi->segs_per_sec)
1069
		sec_freed++;
C
Chao Yu 已提交
1070
	total_freed += seg_freed;
1071

1072
	if (gc_type == FG_GC)
1073
		sbi->cur_victim_sec = NULL_SEGNO;
1074

C
Chao Yu 已提交
1075
	if (!sync) {
1076 1077
		if (has_not_enough_free_secs(sbi, sec_freed, 0)) {
			segno = NULL_SEGNO;
C
Chao Yu 已提交
1078
			goto gc_more;
1079
		}
1080

C
Chao Yu 已提交
1081
		if (gc_type == FG_GC)
1082
			ret = write_checkpoint(sbi, &cpc);
C
Chao Yu 已提交
1083
	}
J
Jaegeuk Kim 已提交
1084
stop:
1085 1086
	SIT_I(sbi)->last_victim[ALLOC_NEXT] = 0;
	SIT_I(sbi)->last_victim[FLUSH_DEVICE] = init_segno;
C
Chao Yu 已提交
1087 1088 1089 1090 1091 1092 1093 1094 1095 1096

	trace_f2fs_gc_end(sbi->sb, ret, total_freed, sec_freed,
				get_pages(sbi, F2FS_DIRTY_NODES),
				get_pages(sbi, F2FS_DIRTY_DENTS),
				get_pages(sbi, F2FS_DIRTY_IMETA),
				free_sections(sbi),
				free_segments(sbi),
				reserved_segments(sbi),
				prefree_segments(sbi));

1097 1098
	mutex_unlock(&sbi->gc_mutex);

1099
	put_gc_inode(&gc_list);
C
Chao Yu 已提交
1100 1101 1102

	if (sync)
		ret = sec_freed ? 0 : -EAGAIN;
1103
	return ret;
1104 1105 1106 1107
}

void build_gc_manager(struct f2fs_sb_info *sbi)
{
1108
	u64 main_count, resv_count, ovp_count;
1109

1110
	DIRTY_I(sbi)->v_ops = &default_v_ops;
1111 1112 1113 1114 1115 1116

	/* threshold of # of valid blocks in a section for victims of FG_GC */
	main_count = SM_I(sbi)->main_segments << sbi->log_blocks_per_seg;
	resv_count = SM_I(sbi)->reserved_segments << sbi->log_blocks_per_seg;
	ovp_count = SM_I(sbi)->ovp_segments << sbi->log_blocks_per_seg;

1117 1118
	sbi->fggc_threshold = div64_u64((main_count - ovp_count) *
				BLKS_PER_SEC(sbi), (main_count - resv_count));
1119
	sbi->gc_pin_file_threshold = DEF_GC_FAILED_PINNED_FILES;
1120 1121 1122 1123 1124

	/* give warm/cold data area from slower device */
	if (sbi->s_ndevs && sbi->segs_per_sec == 1)
		SIT_I(sbi)->last_victim[ALLOC_NEXT] =
				GET_SEGNO(sbi, FDEV(0).end_blk) + 1;
1125
}