gc.c 24.8 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 31 32
	wait_queue_head_t *wq = &sbi->gc_thread->gc_wait_queue_head;
	long wait_ms;

33
	wait_ms = gc_th->min_sleep_time;
34 35 36 37 38 39 40 41 42 43 44

	do {
		if (try_to_freeze())
			continue;
		else
			wait_event_interruptible_timeout(*wq,
						kthread_should_stop(),
						msecs_to_jiffies(wait_ms));
		if (kthread_should_stop())
			break;

45
		if (sbi->sb->s_writers.frozen >= SB_FREEZE_WRITE) {
46
			increase_sleep_time(gc_th, &wait_ms);
47 48 49
			continue;
		}

50 51 52 53 54
#ifdef CONFIG_F2FS_FAULT_INJECTION
		if (time_to_inject(sbi, FAULT_CHECKPOINT))
			f2fs_stop_checkpoint(sbi, false);
#endif

55 56 57 58 59 60 61 62
		/*
		 * [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 已提交
63
		 * Note) We have to avoid triggering GCs frequently.
64 65 66 67 68 69 70 71
		 * 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.
		 */
		if (!mutex_trylock(&sbi->gc_mutex))
			continue;

		if (!is_idle(sbi)) {
72
			increase_sleep_time(gc_th, &wait_ms);
73 74 75 76 77
			mutex_unlock(&sbi->gc_mutex);
			continue;
		}

		if (has_enough_invalid_blocks(sbi))
78
			decrease_sleep_time(gc_th, &wait_ms);
79
		else
80
			increase_sleep_time(gc_th, &wait_ms);
81

82
		stat_inc_bggc_count(sbi);
83

84
		/* if return value is not zero, no victim was selected */
J
Jaegeuk Kim 已提交
85
		if (f2fs_gc(sbi, test_opt(sbi, FORCE_FG_GC), true))
86
			wait_ms = gc_th->no_gc_sleep_time;
87

88 89 90
		trace_f2fs_background_gc(sbi->sb, wait_ms,
				prefree_segments(sbi), free_segments(sbi));

91 92
		/* balancing f2fs's metadata periodically */
		f2fs_balance_fs_bg(sbi);
93

94 95 96 97 98 99
	} while (!kthread_should_stop());
	return 0;
}

int start_gc_thread(struct f2fs_sb_info *sbi)
{
N
Namjae Jeon 已提交
100
	struct f2fs_gc_kthread *gc_th;
101
	dev_t dev = sbi->sb->s_bdev->bd_dev;
102
	int err = 0;
103

104
	gc_th = f2fs_kmalloc(sbi, sizeof(struct f2fs_gc_kthread), GFP_KERNEL);
105 106 107 108
	if (!gc_th) {
		err = -ENOMEM;
		goto out;
	}
109

110 111 112 113
	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;

114 115
	gc_th->gc_idle = 0;

116 117 118
	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,
119
			"f2fs_gc-%u:%u", MAJOR(dev), MINOR(dev));
120
	if (IS_ERR(gc_th->f2fs_gc_task)) {
121
		err = PTR_ERR(gc_th->f2fs_gc_task);
122
		kfree(gc_th);
123
		sbi->gc_thread = NULL;
124
	}
125 126
out:
	return err;
127 128 129 130 131 132 133 134 135 136 137 138
}

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;
}

139
static int select_gc_type(struct f2fs_gc_kthread *gc_th, int gc_type)
140
{
141 142 143 144 145 146 147 148 149
	int gc_mode = (gc_type == BG_GC) ? GC_CB : GC_GREEDY;

	if (gc_th && gc_th->gc_idle) {
		if (gc_th->gc_idle == 1)
			gc_mode = GC_CB;
		else if (gc_th->gc_idle == 2)
			gc_mode = GC_GREEDY;
	}
	return gc_mode;
150 151 152 153 154 155 156
}

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);

157
	if (p->alloc_mode == SSR) {
158 159
		p->gc_mode = GC_GREEDY;
		p->dirty_segmap = dirty_i->dirty_segmap[type];
160
		p->max_search = dirty_i->nr_dirty[type];
161 162
		p->ofs_unit = 1;
	} else {
163
		p->gc_mode = select_gc_type(sbi->gc_thread, gc_type);
164
		p->dirty_segmap = dirty_i->dirty_segmap[DIRTY];
165
		p->max_search = dirty_i->nr_dirty[DIRTY];
166 167
		p->ofs_unit = sbi->segs_per_sec;
	}
168

169 170
	/* we need to check every dirty segments in the FG_GC case */
	if (gc_type != FG_GC && p->max_search > sbi->max_victim_search)
171
		p->max_search = sbi->max_victim_search;
172

173 174 175 176 177 178
	p->offset = sbi->last_victim[p->gc_mode];
}

static unsigned int get_max_cost(struct f2fs_sb_info *sbi,
				struct victim_sel_policy *p)
{
179 180
	/* SSR allocates in a segment unit */
	if (p->alloc_mode == SSR)
181
		return sbi->blocks_per_seg;
182
	if (p->gc_mode == GC_GREEDY)
183
		return sbi->blocks_per_seg * p->ofs_unit;
184 185 186 187 188 189 190 191 192
	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);
193
	unsigned int secno;
194 195 196 197 198 199

	/*
	 * 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.
	 */
200
	for_each_set_bit(secno, dirty_i->victim_secmap, MAIN_SECS(sbi)) {
201
		if (sec_usage_check(sbi, secno))
202
			continue;
203 204 205 206

		if (no_fggc_candidate(sbi, secno))
			continue;

207 208
		clear_bit(secno, dirty_i->victim_secmap);
		return secno * sbi->segs_per_sec;
209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
	}
	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);
	unsigned int secno = GET_SECNO(sbi, segno);
	unsigned int start = secno * sbi->segs_per_sec;
	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;
	vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);

	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 已提交
233
	/* Handle if the system time has changed by the user */
234 235 236 237 238 239 240 241 242 243 244
	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));
}

245 246 247 248 249 250 251 252 253 254
static unsigned int get_greedy_cost(struct f2fs_sb_info *sbi,
						unsigned int segno)
{
	unsigned int valid_blocks =
			get_valid_blocks(sbi, segno, sbi->segs_per_sec);

	return IS_DATASEG(get_seg_entry(sbi, segno)->type) ?
				valid_blocks * 2 : valid_blocks;
}

255 256
static inline unsigned int get_gc_cost(struct f2fs_sb_info *sbi,
			unsigned int segno, struct victim_sel_policy *p)
257 258 259 260 261 262
{
	if (p->alloc_mode == SSR)
		return get_seg_entry(sbi, segno)->ckpt_valid_blocks;

	/* alloc_mode == LFS */
	if (p->gc_mode == GC_GREEDY)
263
		return get_greedy_cost(sbi, segno);
264 265 266 267
	else
		return get_cb_cost(sbi, segno);
}

268 269 270 271 272 273 274 275 276 277 278 279
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 已提交
280
/*
M
Masanari Iida 已提交
281
 * This function is called from two paths.
282 283 284 285 286 287 288 289 290 291 292
 * 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);
	struct victim_sel_policy p;
S
Sheng Yong 已提交
293
	unsigned int secno, last_victim;
294
	unsigned int last_segment = MAIN_SEGS(sbi);
295
	unsigned int nsearched = 0;
296

297 298
	mutex_lock(&dirty_i->seglist_lock);

299 300 301 302
	p.alloc_mode = alloc_mode;
	select_policy(sbi, gc_type, type, &p);

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

305 306 307
	if (p.max_search == 0)
		goto out;

308
	last_victim = sbi->last_victim[p.gc_mode];
309 310 311 312 313 314 315 316
	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;
317
		unsigned int segno;
318

319 320
		segno = find_next_bit(p.dirty_segmap, last_segment, p.offset);
		if (segno >= last_segment) {
321
			if (sbi->last_victim[p.gc_mode]) {
322
				last_segment = sbi->last_victim[p.gc_mode];
323 324 325 326 327 328
				sbi->last_victim[p.gc_mode] = 0;
				p.offset = 0;
				continue;
			}
			break;
		}
329 330

		p.offset = segno + p.ofs_unit;
331
		if (p.ofs_unit > 1) {
332
			p.offset -= segno % p.ofs_unit;
333 334 335 336 337 338 339
			nsearched += count_bits(p.dirty_segmap,
						p.offset - p.ofs_unit,
						p.ofs_unit);
		} else {
			nsearched++;
		}

340
		secno = GET_SECNO(sbi, segno);
341

342
		if (sec_usage_check(sbi, secno))
343
			goto next;
344
		if (gc_type == BG_GC && test_bit(secno, dirty_i->victim_secmap))
345
			goto next;
346 347 348
		if (gc_type == FG_GC && p.alloc_mode == LFS &&
					no_fggc_candidate(sbi, secno))
			goto next;
349 350 351 352 353 354

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

		if (p.min_cost > cost) {
			p.min_segno = segno;
			p.min_cost = cost;
355
		}
356 357
next:
		if (nsearched >= p.max_search) {
358 359 360 361
			if (!sbi->last_victim[p.gc_mode] && segno <= last_victim)
				sbi->last_victim[p.gc_mode] = last_victim + 1;
			else
				sbi->last_victim[p.gc_mode] = segno + 1;
362 363 364 365
			break;
		}
	}
	if (p.min_segno != NULL_SEGNO) {
366
got_it:
367
		if (p.alloc_mode == LFS) {
368 369 370 371 372
			secno = GET_SECNO(sbi, p.min_segno);
			if (gc_type == FG_GC)
				sbi->cur_victim_sec = secno;
			else
				set_bit(secno, dirty_i->victim_secmap);
373
		}
374
		*result = (p.min_segno / p.ofs_unit) * p.ofs_unit;
375 376 377 378

		trace_f2fs_get_victim(sbi->sb, type, gc_type, &p,
				sbi->cur_victim_sec,
				prefree_segments(sbi), free_segments(sbi));
379
	}
380
out:
381 382 383 384 385 386 387 388 389
	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,
};

390
static struct inode *find_gc_inode(struct gc_inode_list *gc_list, nid_t ino)
391 392 393
{
	struct inode_entry *ie;

394 395 396
	ie = radix_tree_lookup(&gc_list->iroot, ino);
	if (ie)
		return ie->inode;
397 398 399
	return NULL;
}

400
static void add_gc_inode(struct gc_inode_list *gc_list, struct inode *inode)
401
{
402 403
	struct inode_entry *new_ie;

404
	if (inode == find_gc_inode(gc_list, inode->i_ino)) {
405 406
		iput(inode);
		return;
407
	}
408
	new_ie = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
409
	new_ie->inode = inode;
410 411

	f2fs_radix_tree_insert(&gc_list->iroot, inode->i_ino, new_ie);
412
	list_add_tail(&new_ie->list, &gc_list->ilist);
413 414
}

415
static void put_gc_inode(struct gc_inode_list *gc_list)
416 417
{
	struct inode_entry *ie, *next_ie;
418 419
	list_for_each_entry_safe(ie, next_ie, &gc_list->ilist, list) {
		radix_tree_delete(&gc_list->iroot, ie->inode->i_ino);
420 421
		iput(ie->inode);
		list_del(&ie->list);
422
		kmem_cache_free(inode_entry_slab, ie);
423 424 425 426 427 428 429 430 431 432 433 434 435 436
	}
}

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;

	mutex_lock(&sit_i->sentry_lock);
	sentry = get_seg_entry(sbi, segno);
	ret = f2fs_test_bit(offset, sentry->cur_valid_map);
	mutex_unlock(&sit_i->sentry_lock);
437
	return ret;
438 439
}

J
Jaegeuk Kim 已提交
440
/*
441 442 443 444
 * 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 已提交
445
static void gc_node_segment(struct f2fs_sb_info *sbi,
446 447 448
		struct f2fs_summary *sum, unsigned int segno, int gc_type)
{
	struct f2fs_summary *entry;
449
	block_t start_addr;
450
	int off;
451
	int phase = 0;
452

453 454
	start_addr = START_BLOCK(sbi, segno);

455 456
next_step:
	entry = sum;
457

458 459 460
	for (off = 0; off < sbi->blocks_per_seg; off++, entry++) {
		nid_t nid = le32_to_cpu(entry->nid);
		struct page *node_page;
461
		struct node_info ni;
462

463
		/* stop BG_GC if there is not enough free sections. */
464
		if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0, 0))
C
Chao Yu 已提交
465
			return;
466

467
		if (check_valid_map(sbi, segno, off) == 0)
468 469
			continue;

470 471 472 473 474 475 476
		if (phase == 0) {
			ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), 1,
							META_NAT, true);
			continue;
		}

		if (phase == 1) {
477 478 479
			ra_node_page(sbi, nid);
			continue;
		}
480 481

		/* phase == 2 */
482 483 484 485
		node_page = get_node_page(sbi, nid);
		if (IS_ERR(node_page))
			continue;

486 487 488 489
		/* block may become invalid during get_node_page */
		if (check_valid_map(sbi, segno, off) == 0) {
			f2fs_put_page(node_page, 1);
			continue;
490 491 492 493 494 495
		}

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

498
		move_node_page(node_page, gc_type);
499
		stat_inc_node_blk_count(sbi, 1, gc_type);
500
	}
501

502
	if (++phase < 3)
503 504 505
		goto next_step;
}

J
Jaegeuk Kim 已提交
506
/*
507 508 509 510 511
 * 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.
512
 */
513
block_t start_bidx_of_node(unsigned int node_ofs, struct inode *inode)
514
{
515 516
	unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
	unsigned int bidx;
517

518 519
	if (node_ofs == 0)
		return 0;
520

521
	if (node_ofs <= 2) {
522 523
		bidx = node_ofs - 1;
	} else if (node_ofs <= indirect_blks) {
524
		int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
525 526
		bidx = node_ofs - 2 - dec;
	} else {
527
		int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
528 529
		bidx = node_ofs - 5 - dec;
	}
530
	return bidx * ADDRS_PER_BLOCK + ADDRS_PER_INODE(inode);
531 532
}

533
static bool is_alive(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
534 535 536 537 538 539 540 541 542 543 544 545
		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))
546
		return false;
547 548 549 550 551

	get_node_info(sbi, nid, dni);

	if (sum->version != dni->version) {
		f2fs_put_page(node_page, 1);
552
		return false;
553 554 555 556 557 558 559
	}

	*nofs = ofs_of_node(node_page);
	source_blkaddr = datablock_addr(node_page, ofs_in_node);
	f2fs_put_page(node_page, 1);

	if (source_blkaddr != blkaddr)
560 561
		return false;
	return true;
562 563
}

564 565
static void move_encrypted_block(struct inode *inode, block_t bidx,
							unsigned int segno, int off)
566 567 568 569
{
	struct f2fs_io_info fio = {
		.sbi = F2FS_I_SB(inode),
		.type = DATA,
M
Mike Christie 已提交
570
		.op = REQ_OP_READ,
571
		.op_flags = 0,
572 573 574 575 576 577
		.encrypted_page = NULL,
	};
	struct dnode_of_data dn;
	struct f2fs_summary sum;
	struct node_info ni;
	struct page *page;
578
	block_t newaddr;
579 580 581
	int err;

	/* do not read out */
582
	page = f2fs_grab_cache_page(inode->i_mapping, bidx, false);
583 584 585
	if (!page)
		return;

586 587 588
	if (!check_valid_map(F2FS_I_SB(inode), segno, off))
		goto out;

C
Chao Yu 已提交
589 590 591
	if (f2fs_is_atomic_file(inode))
		goto out;

592 593 594 595 596
	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, bidx, LOOKUP_NODE);
	if (err)
		goto out;

597 598
	if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
		ClearPageUptodate(page);
599
		goto put_out;
600 601 602 603 604 605
	}

	/*
	 * don't cache encrypted data into meta inode until previous dirty
	 * data were writebacked to avoid racing between GC and flush.
	 */
606
	f2fs_wait_on_page_writeback(page, DATA, true);
607 608 609 610 611 612

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

	/* read page */
	fio.page = page;
613
	fio.new_blkaddr = fio.old_blkaddr = dn.data_blkaddr;
614

615 616 617 618 619 620 621 622 623
	allocate_data_block(fio.sbi, NULL, fio.old_blkaddr, &newaddr,
							&sum, CURSEG_COLD_DATA);

	fio.encrypted_page = pagecache_get_page(META_MAPPING(fio.sbi), newaddr,
					FGP_LOCK | FGP_CREAT, GFP_NOFS);
	if (!fio.encrypted_page) {
		err = -ENOMEM;
		goto recover_block;
	}
624

625 626 627 628 629 630 631
	err = f2fs_submit_page_bio(&fio);
	if (err)
		goto put_page_out;

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

632
	if (unlikely(fio.encrypted_page->mapping != META_MAPPING(fio.sbi))) {
633
		err = -EIO;
634
		goto put_page_out;
635
	}
636
	if (unlikely(!PageUptodate(fio.encrypted_page))) {
637
		err = -EIO;
638
		goto put_page_out;
639
	}
640

641
	set_page_dirty(fio.encrypted_page);
642
	f2fs_wait_on_page_writeback(fio.encrypted_page, DATA, true);
643 644 645
	if (clear_page_dirty_for_io(fio.encrypted_page))
		dec_page_count(fio.sbi, F2FS_DIRTY_META);

646
	set_page_writeback(fio.encrypted_page);
647 648

	/* allocate block address */
649
	f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
650

M
Mike Christie 已提交
651
	fio.op = REQ_OP_WRITE;
652
	fio.op_flags = REQ_SYNC;
653
	fio.new_blkaddr = newaddr;
654 655
	f2fs_submit_page_mbio(&fio);

656
	f2fs_update_data_blkaddr(&dn, newaddr);
657
	set_inode_flag(inode, FI_APPEND_WRITE);
658
	if (page->index == 0)
659
		set_inode_flag(inode, FI_FIRST_BLOCK_WRITTEN);
660
put_page_out:
661
	f2fs_put_page(fio.encrypted_page, 1);
662 663 664 665
recover_block:
	if (err)
		__f2fs_replace_block(fio.sbi, &sum, newaddr, fio.old_blkaddr,
								true, true);
666 667 668 669 670 671
put_out:
	f2fs_put_dnode(&dn);
out:
	f2fs_put_page(page, 1);
}

672 673
static void move_data_page(struct inode *inode, block_t bidx, int gc_type,
							unsigned int segno, int off)
674
{
J
Jaegeuk Kim 已提交
675 676
	struct page *page;

677
	page = get_lock_data_page(inode, bidx, true);
J
Jaegeuk Kim 已提交
678 679
	if (IS_ERR(page))
		return;
680

681 682 683
	if (!check_valid_map(F2FS_I_SB(inode), segno, off))
		goto out;

C
Chao Yu 已提交
684 685 686
	if (f2fs_is_atomic_file(inode))
		goto out;

687
	if (gc_type == BG_GC) {
688 689
		if (PageWriteback(page))
			goto out;
690 691 692
		set_page_dirty(page);
		set_cold_data(page);
	} else {
J
Jaegeuk Kim 已提交
693 694 695
		struct f2fs_io_info fio = {
			.sbi = F2FS_I_SB(inode),
			.type = DATA,
M
Mike Christie 已提交
696
			.op = REQ_OP_WRITE,
697
			.op_flags = REQ_SYNC,
J
Jaegeuk Kim 已提交
698
			.page = page,
699
			.encrypted_page = NULL,
J
Jaegeuk Kim 已提交
700
		};
701 702 703 704
		bool is_dirty = PageDirty(page);
		int err;

retry:
705
		set_page_dirty(page);
706
		f2fs_wait_on_page_writeback(page, DATA, true);
707
		if (clear_page_dirty_for_io(page)) {
708
			inode_dec_dirty_pages(inode);
709 710
			remove_dirty_inode(inode);
		}
711

712
		set_cold_data(page);
713 714 715 716 717 718

		err = do_write_data_page(&fio);
		if (err == -ENOMEM && is_dirty) {
			congestion_wait(BLK_RW_ASYNC, HZ/50);
			goto retry;
		}
719 720 721 722 723
	}
out:
	f2fs_put_page(page, 1);
}

J
Jaegeuk Kim 已提交
724
/*
725 726 727 728 729 730
 * 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 已提交
731
static void gc_data_segment(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
732
		struct gc_inode_list *gc_list, unsigned int segno, int gc_type)
733 734 735 736
{
	struct super_block *sb = sbi->sb;
	struct f2fs_summary *entry;
	block_t start_addr;
737
	int off;
738 739 740 741 742 743
	int phase = 0;

	start_addr = START_BLOCK(sbi, segno);

next_step:
	entry = sum;
744

745 746 747 748 749 750
	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;
751
		nid_t nid = le32_to_cpu(entry->nid);
752

753
		/* stop BG_GC if there is not enough free sections. */
754
		if (gc_type == BG_GC && has_not_enough_free_secs(sbi, 0, 0))
C
Chao Yu 已提交
755
			return;
756

757
		if (check_valid_map(sbi, segno, off) == 0)
758 759 760
			continue;

		if (phase == 0) {
761 762 763 764 765 766 767
			ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), 1,
							META_NAT, true);
			continue;
		}

		if (phase == 1) {
			ra_node_page(sbi, nid);
768 769 770 771
			continue;
		}

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

775
		if (phase == 2) {
776 777 778 779 780 781
			ra_node_page(sbi, dni.ino);
			continue;
		}

		ofs_in_node = le16_to_cpu(entry->ofs_in_node);

782
		if (phase == 3) {
783
			inode = f2fs_iget(sb, dni.ino);
784
			if (IS_ERR(inode) || is_bad_inode(inode))
785 786
				continue;

787 788 789 790 791 792 793
			/* if encrypted inode, let's go phase 3 */
			if (f2fs_encrypted_inode(inode) &&
						S_ISREG(inode->i_mode)) {
				add_gc_inode(gc_list, inode);
				continue;
			}

794
			start_bidx = start_bidx_of_node(nofs, inode);
795
			data_page = get_read_data_page(inode,
796 797
					start_bidx + ofs_in_node, REQ_RAHEAD,
					true);
798 799 800 801
			if (IS_ERR(data_page)) {
				iput(inode);
				continue;
			}
802 803

			f2fs_put_page(data_page, 0);
804
			add_gc_inode(gc_list, inode);
805 806 807
			continue;
		}

808
		/* phase 4 */
809
		inode = find_gc_inode(gc_list, dni.ino);
810
		if (inode) {
811 812 813 814 815 816 817 818 819 820 821 822 823 824
			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;
			}

825
			start_bidx = start_bidx_of_node(nofs, inode)
J
Jaegeuk Kim 已提交
826
								+ ofs_in_node;
827
			if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
828
				move_encrypted_block(inode, start_bidx, segno, off);
829
			else
830
				move_data_page(inode, start_bidx, gc_type, segno, off);
831 832 833 834 835 836

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

837
			stat_inc_data_blk_count(sbi, 1, gc_type);
838 839
		}
	}
840

841
	if (++phase < 5)
842 843 844 845
		goto next_step;
}

static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim,
846
			int gc_type)
847 848 849
{
	struct sit_info *sit_i = SIT_I(sbi);
	int ret;
850

851
	mutex_lock(&sit_i->sentry_lock);
852 853
	ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type,
					      NO_CHECK_TYPE, LFS);
854 855 856 857
	mutex_unlock(&sit_i->sentry_lock);
	return ret;
}

C
Chao Yu 已提交
858 859
static int do_garbage_collect(struct f2fs_sb_info *sbi,
				unsigned int start_segno,
860
				struct gc_inode_list *gc_list, int gc_type)
861 862 863
{
	struct page *sum_page;
	struct f2fs_summary_block *sum;
864
	struct blk_plug plug;
C
Chao Yu 已提交
865 866
	unsigned int segno = start_segno;
	unsigned int end_segno = start_segno + sbi->segs_per_sec;
C
Chao Yu 已提交
867
	int sec_freed = 0;
C
Chao Yu 已提交
868 869
	unsigned char type = IS_DATASEG(get_seg_entry(sbi, segno)->type) ?
						SUM_TYPE_DATA : SUM_TYPE_NODE;
870

C
Chao Yu 已提交
871 872 873 874 875 876 877 878 879 880
	/* 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);
	}
881

882 883
	blk_start_plug(&plug);

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

C
Chao Yu 已提交
886 887 888 889
		/* find segment summary of victim */
		sum_page = find_get_page(META_MAPPING(sbi),
					GET_SUM_BLOCK(sbi, segno));
		f2fs_put_page(sum_page, 0);
890

891 892 893 894 895
		if (get_valid_blocks(sbi, segno, 1) == 0 ||
				!PageUptodate(sum_page) ||
				unlikely(f2fs_cp_error(sbi)))
			goto next;

C
Chao Yu 已提交
896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913
		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
		 *  - check_valid_map()            - mutex_lock(sentry_lock)
		 *   - mutex_lock(sentry_lock)     - change_curseg()
		 *                                  - 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);
914
next:
C
Chao Yu 已提交
915 916 917
		f2fs_put_page(sum_page, 0);
	}

918 919 920
	if (gc_type == FG_GC)
		f2fs_submit_merged_bio(sbi,
				(type == SUM_TYPE_NODE) ? NODE : DATA, WRITE);
921

C
Chao Yu 已提交
922
	blk_finish_plug(&plug);
923

C
Chao Yu 已提交
924 925 926
	if (gc_type == FG_GC &&
		get_valid_blocks(sbi, start_segno, sbi->segs_per_sec) == 0)
		sec_freed = 1;
927 928 929

	stat_inc_call_count(sbi->stat_info);

C
Chao Yu 已提交
930
	return sec_freed;
931 932
}

J
Jaegeuk Kim 已提交
933
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync, bool background)
934
{
C
Chao Yu 已提交
935
	unsigned int segno;
C
Chao Yu 已提交
936
	int gc_type = sync ? FG_GC : BG_GC;
C
Chao Yu 已提交
937
	int sec_freed = 0;
C
Chao Yu 已提交
938
	int ret = -EINVAL;
939
	struct cp_control cpc;
940 941
	struct gc_inode_list gc_list = {
		.ilist = LIST_HEAD_INIT(gc_list.ilist),
942
		.iroot = RADIX_TREE_INIT(GFP_NOFS),
943
	};
944

945
	cpc.reason = __get_cp_reason(sbi);
946
gc_more:
947
	if (unlikely(!(sbi->sb->s_flags & MS_ACTIVE)))
J
Jaegeuk Kim 已提交
948
		goto stop;
C
Chao Yu 已提交
949 950
	if (unlikely(f2fs_cp_error(sbi))) {
		ret = -EIO;
951
		goto stop;
C
Chao Yu 已提交
952
	}
953

954
	if (gc_type == BG_GC && has_not_enough_free_secs(sbi, sec_freed, 0)) {
J
Jaegeuk Kim 已提交
955
		gc_type = FG_GC;
956 957 958 959 960
		/*
		 * If there is no victim and no prefree segment but still not
		 * enough free sections, we should flush dent/node blocks and do
		 * garbage collections.
		 */
961
		if (dirty_segments(sbi) || prefree_segments(sbi)) {
962 963 964
			ret = write_checkpoint(sbi, &cpc);
			if (ret)
				goto stop;
965
		} else if (has_not_enough_free_secs(sbi, 0, 0)) {
966 967 968
			ret = write_checkpoint(sbi, &cpc);
			if (ret)
				goto stop;
969
		}
J
Jaegeuk Kim 已提交
970 971 972
	} else if (gc_type == BG_GC && !background) {
		/* f2fs_balance_fs doesn't need to do BG_GC in critical path. */
		goto stop;
973
	}
974

975
	if (!__get_victim(sbi, &segno, gc_type))
J
Jaegeuk Kim 已提交
976
		goto stop;
977
	ret = 0;
978

C
Chao Yu 已提交
979 980
	if (do_garbage_collect(sbi, segno, &gc_list, gc_type) &&
			gc_type == FG_GC)
981
		sec_freed++;
982

983
	if (gc_type == FG_GC)
984
		sbi->cur_victim_sec = NULL_SEGNO;
985

C
Chao Yu 已提交
986
	if (!sync) {
987
		if (has_not_enough_free_secs(sbi, sec_freed, 0))
C
Chao Yu 已提交
988
			goto gc_more;
989

C
Chao Yu 已提交
990
		if (gc_type == FG_GC)
991
			ret = write_checkpoint(sbi, &cpc);
C
Chao Yu 已提交
992
	}
J
Jaegeuk Kim 已提交
993
stop:
994 995
	mutex_unlock(&sbi->gc_mutex);

996
	put_gc_inode(&gc_list);
C
Chao Yu 已提交
997 998 999

	if (sync)
		ret = sec_freed ? 0 : -EAGAIN;
1000
	return ret;
1001 1002 1003 1004
}

void build_gc_manager(struct f2fs_sb_info *sbi)
{
1005 1006
	u64 main_count, resv_count, ovp_count, blocks_per_sec;

1007
	DIRTY_I(sbi)->v_ops = &default_v_ops;
1008 1009 1010 1011 1012 1013 1014 1015 1016

	/* 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;
	blocks_per_sec = sbi->blocks_per_seg * sbi->segs_per_sec;

	sbi->fggc_threshold = div_u64((main_count - ovp_count) * blocks_per_sec,
					(main_count - resv_count));
1017
}