node.c 50.8 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
J
Jaegeuk Kim 已提交
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
 * fs/f2fs/node.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/f2fs_fs.h>
#include <linux/mpage.h>
#include <linux/backing-dev.h>
#include <linux/blkdev.h>
#include <linux/pagevec.h>
#include <linux/swap.h>

#include "f2fs.h"
#include "node.h"
#include "segment.h"
J
Jaegeuk Kim 已提交
22
#include "trace.h"
23
#include <trace/events/f2fs.h>
J
Jaegeuk Kim 已提交
24

25 26
#define on_build_free_nids(nmi) mutex_is_locked(&nm_i->build_lock)

J
Jaegeuk Kim 已提交
27 28
static struct kmem_cache *nat_entry_slab;
static struct kmem_cache *free_nid_slab;
29
static struct kmem_cache *nat_entry_set_slab;
J
Jaegeuk Kim 已提交
30

31
bool available_free_memory(struct f2fs_sb_info *sbi, int type)
32
{
33
	struct f2fs_nm_info *nm_i = NM_I(sbi);
34
	struct sysinfo val;
35
	unsigned long avail_ram;
36
	unsigned long mem_size = 0;
37
	bool res = false;
38 39

	si_meminfo(&val);
40 41 42 43

	/* only uses low memory */
	avail_ram = val.totalram - val.totalhigh;

44 45 46
	/*
	 * give 25%, 25%, 50%, 50%, 50% memory for each components respectively
	 */
47
	if (type == FREE_NIDS) {
48 49 50
		mem_size = (nm_i->fcnt * sizeof(struct free_nid)) >>
							PAGE_CACHE_SHIFT;
		res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2);
51
	} else if (type == NAT_ENTRIES) {
52 53 54 55 56 57 58
		mem_size = (nm_i->nat_cnt * sizeof(struct nat_entry)) >>
							PAGE_CACHE_SHIFT;
		res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2);
	} else if (type == INO_ENTRIES) {
		int i;

		for (i = 0; i <= UPDATE_INO; i++)
59 60
			mem_size += (sbi->im[i].ino_num *
				sizeof(struct ino_entry)) >> PAGE_CACHE_SHIFT;
61
		res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1);
62 63 64 65 66
	} else if (type == EXTENT_CACHE) {
		mem_size = (sbi->total_ext_tree * sizeof(struct extent_tree) +
				atomic_read(&sbi->total_ext_node) *
				sizeof(struct extent_node)) >> PAGE_CACHE_SHIFT;
		res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1);
67
	} else {
68
		if (sbi->sb->s_bdi->wb.dirty_exceeded)
69
			return false;
70 71
	}
	return res;
72 73
}

J
Jaegeuk Kim 已提交
74 75 76 77 78 79 80 81 82 83 84 85 86
static void clear_node_page_dirty(struct page *page)
{
	struct address_space *mapping = page->mapping;
	unsigned int long flags;

	if (PageDirty(page)) {
		spin_lock_irqsave(&mapping->tree_lock, flags);
		radix_tree_tag_clear(&mapping->page_tree,
				page_index(page),
				PAGECACHE_TAG_DIRTY);
		spin_unlock_irqrestore(&mapping->tree_lock, flags);

		clear_page_dirty_for_io(page);
87
		dec_page_count(F2FS_M_SB(mapping), F2FS_DIRTY_NODES);
J
Jaegeuk Kim 已提交
88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
	}
	ClearPageUptodate(page);
}

static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
{
	pgoff_t index = current_nat_addr(sbi, nid);
	return get_meta_page(sbi, index);
}

static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
{
	struct page *src_page;
	struct page *dst_page;
	pgoff_t src_off;
	pgoff_t dst_off;
	void *src_addr;
	void *dst_addr;
	struct f2fs_nm_info *nm_i = NM_I(sbi);

	src_off = current_nat_addr(sbi, nid);
	dst_off = next_nat_addr(sbi, src_off);

	/* get current nat block page with lock */
	src_page = get_meta_page(sbi, src_off);
	dst_page = grab_meta_page(sbi, dst_off);
114
	f2fs_bug_on(sbi, PageDirty(src_page));
J
Jaegeuk Kim 已提交
115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145

	src_addr = page_address(src_page);
	dst_addr = page_address(dst_page);
	memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE);
	set_page_dirty(dst_page);
	f2fs_put_page(src_page, 1);

	set_to_next_nat(nm_i, nid);

	return dst_page;
}

static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n)
{
	return radix_tree_lookup(&nm_i->nat_root, n);
}

static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i,
		nid_t start, unsigned int nr, struct nat_entry **ep)
{
	return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr);
}

static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e)
{
	list_del(&e->list);
	radix_tree_delete(&nm_i->nat_root, nat_get_nid(e));
	nm_i->nat_cnt--;
	kmem_cache_free(nat_entry_slab, e);
}

146 147 148 149 150 151 152 153
static void __set_nat_cache_dirty(struct f2fs_nm_info *nm_i,
						struct nat_entry *ne)
{
	nid_t set = NAT_BLOCK_OFFSET(ne->ni.nid);
	struct nat_entry_set *head;

	if (get_nat_flag(ne, IS_DIRTY))
		return;
154

155 156
	head = radix_tree_lookup(&nm_i->nat_set_root, set);
	if (!head) {
157
		head = f2fs_kmem_cache_alloc(nat_entry_set_slab, GFP_NOFS);
158 159 160 161 162

		INIT_LIST_HEAD(&head->entry_list);
		INIT_LIST_HEAD(&head->set_list);
		head->set = set;
		head->entry_cnt = 0;
163
		f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head);
164 165 166 167 168 169 170 171 172 173
	}
	list_move_tail(&ne->list, &head->entry_list);
	nm_i->dirty_nat_cnt++;
	head->entry_cnt++;
	set_nat_flag(ne, IS_DIRTY, true);
}

static void __clear_nat_cache_dirty(struct f2fs_nm_info *nm_i,
						struct nat_entry *ne)
{
174
	nid_t set = NAT_BLOCK_OFFSET(ne->ni.nid);
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
	struct nat_entry_set *head;

	head = radix_tree_lookup(&nm_i->nat_set_root, set);
	if (head) {
		list_move_tail(&ne->list, &nm_i->nat_entries);
		set_nat_flag(ne, IS_DIRTY, false);
		head->entry_cnt--;
		nm_i->dirty_nat_cnt--;
	}
}

static unsigned int __gang_lookup_nat_set(struct f2fs_nm_info *nm_i,
		nid_t start, unsigned int nr, struct nat_entry_set **ep)
{
	return radix_tree_gang_lookup(&nm_i->nat_set_root, (void **)ep,
							start, nr);
}

J
Jaegeuk Kim 已提交
193
int need_dentry_mark(struct f2fs_sb_info *sbi, nid_t nid)
J
Jaegeuk Kim 已提交
194 195 196
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct nat_entry *e;
J
Jaegeuk Kim 已提交
197
	bool need = false;
J
Jaegeuk Kim 已提交
198

199
	down_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
200
	e = __lookup_nat_cache(nm_i, nid);
J
Jaegeuk Kim 已提交
201 202 203 204 205
	if (e) {
		if (!get_nat_flag(e, IS_CHECKPOINTED) &&
				!get_nat_flag(e, HAS_FSYNCED_INODE))
			need = true;
	}
206
	up_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
207
	return need;
J
Jaegeuk Kim 已提交
208 209
}

J
Jaegeuk Kim 已提交
210
bool is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid)
211 212 213
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct nat_entry *e;
J
Jaegeuk Kim 已提交
214
	bool is_cp = true;
215

216
	down_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
217 218 219
	e = __lookup_nat_cache(nm_i, nid);
	if (e && !get_nat_flag(e, IS_CHECKPOINTED))
		is_cp = false;
220
	up_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
221
	return is_cp;
222 223
}

224
bool need_inode_block_update(struct f2fs_sb_info *sbi, nid_t ino)
225 226 227
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct nat_entry *e;
228
	bool need_update = true;
229

230
	down_read(&nm_i->nat_tree_lock);
231 232 233 234 235
	e = __lookup_nat_cache(nm_i, ino);
	if (e && get_nat_flag(e, HAS_LAST_FSYNC) &&
			(get_nat_flag(e, IS_CHECKPOINTED) ||
			 get_nat_flag(e, HAS_FSYNCED_INODE)))
		need_update = false;
236
	up_read(&nm_i->nat_tree_lock);
237
	return need_update;
238 239
}

J
Jaegeuk Kim 已提交
240 241 242 243
static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid)
{
	struct nat_entry *new;

244
	new = f2fs_kmem_cache_alloc(nat_entry_slab, GFP_NOFS);
245
	f2fs_radix_tree_insert(&nm_i->nat_root, nid, new);
J
Jaegeuk Kim 已提交
246 247
	memset(new, 0, sizeof(struct nat_entry));
	nat_set_nid(new, nid);
248
	nat_reset_flag(new);
J
Jaegeuk Kim 已提交
249 250 251 252 253 254 255 256 257
	list_add_tail(&new->list, &nm_i->nat_entries);
	nm_i->nat_cnt++;
	return new;
}

static void cache_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid,
						struct f2fs_nat_entry *ne)
{
	struct nat_entry *e;
258

259
	down_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
260 261 262
	e = __lookup_nat_cache(nm_i, nid);
	if (!e) {
		e = grab_nat_entry(nm_i, nid);
263
		node_info_from_raw_nat(&e->ni, ne);
J
Jaegeuk Kim 已提交
264
	}
265
	up_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
266 267 268
}

static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni,
269
			block_t new_blkaddr, bool fsync_done)
J
Jaegeuk Kim 已提交
270 271 272
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct nat_entry *e;
273

274
	down_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
275 276 277
	e = __lookup_nat_cache(nm_i, ni->nid);
	if (!e) {
		e = grab_nat_entry(nm_i, ni->nid);
278
		copy_node_info(&e->ni, ni);
279
		f2fs_bug_on(sbi, ni->blk_addr == NEW_ADDR);
J
Jaegeuk Kim 已提交
280 281 282 283 284 285
	} else if (new_blkaddr == NEW_ADDR) {
		/*
		 * when nid is reallocated,
		 * previous nat entry can be remained in nat cache.
		 * So, reinitialize it with new information.
		 */
286
		copy_node_info(&e->ni, ni);
287
		f2fs_bug_on(sbi, ni->blk_addr != NULL_ADDR);
J
Jaegeuk Kim 已提交
288 289 290
	}

	/* sanity check */
291 292
	f2fs_bug_on(sbi, nat_get_blkaddr(e) != ni->blk_addr);
	f2fs_bug_on(sbi, nat_get_blkaddr(e) == NULL_ADDR &&
J
Jaegeuk Kim 已提交
293
			new_blkaddr == NULL_ADDR);
294
	f2fs_bug_on(sbi, nat_get_blkaddr(e) == NEW_ADDR &&
J
Jaegeuk Kim 已提交
295
			new_blkaddr == NEW_ADDR);
296
	f2fs_bug_on(sbi, nat_get_blkaddr(e) != NEW_ADDR &&
J
Jaegeuk Kim 已提交
297 298 299
			nat_get_blkaddr(e) != NULL_ADDR &&
			new_blkaddr == NEW_ADDR);

A
arter97 已提交
300
	/* increment version no as node is removed */
J
Jaegeuk Kim 已提交
301 302 303
	if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) {
		unsigned char version = nat_get_version(e);
		nat_set_version(e, inc_node_version(version));
J
Jaegeuk Kim 已提交
304 305 306 307

		/* in order to reuse the nid */
		if (nm_i->next_scan_nid > ni->nid)
			nm_i->next_scan_nid = ni->nid;
J
Jaegeuk Kim 已提交
308 309 310 311
	}

	/* change address */
	nat_set_blkaddr(e, new_blkaddr);
312 313
	if (new_blkaddr == NEW_ADDR || new_blkaddr == NULL_ADDR)
		set_nat_flag(e, IS_CHECKPOINTED, false);
J
Jaegeuk Kim 已提交
314
	__set_nat_cache_dirty(nm_i, e);
315 316

	/* update fsync_mark if its inode nat entry is still alive */
317 318
	if (ni->nid != ni->ino)
		e = __lookup_nat_cache(nm_i, ni->ino);
319 320 321 322 323
	if (e) {
		if (fsync_done && ni->nid == ni->ino)
			set_nat_flag(e, HAS_FSYNCED_INODE, true);
		set_nat_flag(e, HAS_LAST_FSYNC, fsync_done);
	}
324
	up_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
325 326
}

327
int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink)
J
Jaegeuk Kim 已提交
328 329
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
J
Jaegeuk Kim 已提交
330
	int nr = nr_shrink;
J
Jaegeuk Kim 已提交
331

J
Jaegeuk Kim 已提交
332
	if (!down_write_trylock(&nm_i->nat_tree_lock))
J
Jaegeuk Kim 已提交
333 334 335 336 337 338 339 340 341
		return 0;

	while (nr_shrink && !list_empty(&nm_i->nat_entries)) {
		struct nat_entry *ne;
		ne = list_first_entry(&nm_i->nat_entries,
					struct nat_entry, list);
		__del_from_nat_cache(nm_i, ne);
		nr_shrink--;
	}
342
	up_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
343
	return nr - nr_shrink;
J
Jaegeuk Kim 已提交
344 345
}

J
Jaegeuk Kim 已提交
346
/*
A
arter97 已提交
347
 * This function always returns success
J
Jaegeuk Kim 已提交
348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
 */
void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
	struct f2fs_summary_block *sum = curseg->sum_blk;
	nid_t start_nid = START_NID(nid);
	struct f2fs_nat_block *nat_blk;
	struct page *page = NULL;
	struct f2fs_nat_entry ne;
	struct nat_entry *e;
	int i;

	ni->nid = nid;

	/* Check nat cache */
364
	down_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
365 366 367 368 369 370
	e = __lookup_nat_cache(nm_i, nid);
	if (e) {
		ni->ino = nat_get_ino(e);
		ni->blk_addr = nat_get_blkaddr(e);
		ni->version = nat_get_version(e);
	}
371
	up_read(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
372 373 374
	if (e)
		return;

375 376
	memset(&ne, 0, sizeof(struct f2fs_nat_entry));

J
Jaegeuk Kim 已提交
377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398
	/* Check current segment summary */
	mutex_lock(&curseg->curseg_mutex);
	i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0);
	if (i >= 0) {
		ne = nat_in_journal(sum, i);
		node_info_from_raw_nat(ni, &ne);
	}
	mutex_unlock(&curseg->curseg_mutex);
	if (i >= 0)
		goto cache;

	/* Fill node_info from nat page */
	page = get_current_nat_page(sbi, start_nid);
	nat_blk = (struct f2fs_nat_block *)page_address(page);
	ne = nat_blk->entries[nid - start_nid];
	node_info_from_raw_nat(ni, &ne);
	f2fs_put_page(page, 1);
cache:
	/* cache nat entry */
	cache_nat_entry(NM_I(sbi), nid, &ne);
}

J
Jaegeuk Kim 已提交
399
/*
J
Jaegeuk Kim 已提交
400 401 402
 * The maximum depth is four.
 * Offset[0] will have raw inode offset.
 */
403 404
static int get_node_path(struct f2fs_inode_info *fi, long block,
				int offset[4], unsigned int noffset[4])
J
Jaegeuk Kim 已提交
405
{
406
	const long direct_index = ADDRS_PER_INODE(fi);
J
Jaegeuk Kim 已提交
407 408 409 410 411 412 413 414 415 416
	const long direct_blks = ADDRS_PER_BLOCK;
	const long dptrs_per_blk = NIDS_PER_BLOCK;
	const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK;
	const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK;
	int n = 0;
	int level = 0;

	noffset[0] = 0;

	if (block < direct_index) {
417
		offset[n] = block;
J
Jaegeuk Kim 已提交
418 419 420 421 422 423
		goto got;
	}
	block -= direct_index;
	if (block < direct_blks) {
		offset[n++] = NODE_DIR1_BLOCK;
		noffset[n] = 1;
424
		offset[n] = block;
J
Jaegeuk Kim 已提交
425 426 427 428 429 430 431
		level = 1;
		goto got;
	}
	block -= direct_blks;
	if (block < direct_blks) {
		offset[n++] = NODE_DIR2_BLOCK;
		noffset[n] = 2;
432
		offset[n] = block;
J
Jaegeuk Kim 已提交
433 434 435 436 437 438 439 440 441
		level = 1;
		goto got;
	}
	block -= direct_blks;
	if (block < indirect_blks) {
		offset[n++] = NODE_IND1_BLOCK;
		noffset[n] = 3;
		offset[n++] = block / direct_blks;
		noffset[n] = 4 + offset[n - 1];
442
		offset[n] = block % direct_blks;
J
Jaegeuk Kim 已提交
443 444 445 446 447 448 449 450 451
		level = 2;
		goto got;
	}
	block -= indirect_blks;
	if (block < indirect_blks) {
		offset[n++] = NODE_IND2_BLOCK;
		noffset[n] = 4 + dptrs_per_blk;
		offset[n++] = block / direct_blks;
		noffset[n] = 5 + dptrs_per_blk + offset[n - 1];
452
		offset[n] = block % direct_blks;
J
Jaegeuk Kim 已提交
453 454 455 456 457 458 459 460 461 462 463 464 465 466
		level = 2;
		goto got;
	}
	block -= indirect_blks;
	if (block < dindirect_blks) {
		offset[n++] = NODE_DIND_BLOCK;
		noffset[n] = 5 + (dptrs_per_blk * 2);
		offset[n++] = block / indirect_blks;
		noffset[n] = 6 + (dptrs_per_blk * 2) +
			      offset[n - 1] * (dptrs_per_blk + 1);
		offset[n++] = (block / direct_blks) % dptrs_per_blk;
		noffset[n] = 7 + (dptrs_per_blk * 2) +
			      offset[n - 2] * (dptrs_per_blk + 1) +
			      offset[n - 1];
467
		offset[n] = block % direct_blks;
J
Jaegeuk Kim 已提交
468 469 470 471 472 473 474 475 476 477 478
		level = 3;
		goto got;
	} else {
		BUG();
	}
got:
	return level;
}

/*
 * Caller should call f2fs_put_dnode(dn).
C
Chao Yu 已提交
479 480
 * Also, it should grab and release a rwsem by calling f2fs_lock_op() and
 * f2fs_unlock_op() only if ro is not set RDONLY_NODE.
481
 * In the case of RDONLY_NODE, we don't need to care about mutex.
J
Jaegeuk Kim 已提交
482
 */
483
int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode)
J
Jaegeuk Kim 已提交
484
{
485
	struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
J
Jaegeuk Kim 已提交
486
	struct page *npage[4];
487
	struct page *parent = NULL;
J
Jaegeuk Kim 已提交
488 489 490 491 492 493
	int offset[4];
	unsigned int noffset[4];
	nid_t nids[4];
	int level, i;
	int err = 0;

494
	level = get_node_path(F2FS_I(dn->inode), index, offset, noffset);
J
Jaegeuk Kim 已提交
495 496

	nids[0] = dn->inode->i_ino;
497
	npage[0] = dn->inode_page;
J
Jaegeuk Kim 已提交
498

499 500 501 502 503
	if (!npage[0]) {
		npage[0] = get_node_page(sbi, nids[0]);
		if (IS_ERR(npage[0]))
			return PTR_ERR(npage[0]);
	}
504 505 506

	/* if inline_data is set, should not report any block indices */
	if (f2fs_has_inline_data(dn->inode) && index) {
507
		err = -ENOENT;
508 509 510 511
		f2fs_put_page(npage[0], 1);
		goto release_out;
	}

J
Jaegeuk Kim 已提交
512
	parent = npage[0];
513 514
	if (level != 0)
		nids[1] = get_nid(parent, offset[0], true);
J
Jaegeuk Kim 已提交
515 516 517 518 519 520 521
	dn->inode_page = npage[0];
	dn->inode_page_locked = true;

	/* get indirect or direct nodes */
	for (i = 1; i <= level; i++) {
		bool done = false;

522
		if (!nids[i] && mode == ALLOC_NODE) {
J
Jaegeuk Kim 已提交
523 524 525 526 527 528 529
			/* alloc new node */
			if (!alloc_nid(sbi, &(nids[i]))) {
				err = -ENOSPC;
				goto release_pages;
			}

			dn->nid = nids[i];
530
			npage[i] = new_node_page(dn, noffset[i], NULL);
J
Jaegeuk Kim 已提交
531 532 533 534 535 536 537 538 539
			if (IS_ERR(npage[i])) {
				alloc_nid_failed(sbi, nids[i]);
				err = PTR_ERR(npage[i]);
				goto release_pages;
			}

			set_nid(parent, offset[i - 1], nids[i], i == 1);
			alloc_nid_done(sbi, nids[i]);
			done = true;
540
		} else if (mode == LOOKUP_NODE_RA && i == level && level > 1) {
J
Jaegeuk Kim 已提交
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
			npage[i] = get_node_page_ra(parent, offset[i - 1]);
			if (IS_ERR(npage[i])) {
				err = PTR_ERR(npage[i]);
				goto release_pages;
			}
			done = true;
		}
		if (i == 1) {
			dn->inode_page_locked = false;
			unlock_page(parent);
		} else {
			f2fs_put_page(parent, 1);
		}

		if (!done) {
			npage[i] = get_node_page(sbi, nids[i]);
			if (IS_ERR(npage[i])) {
				err = PTR_ERR(npage[i]);
				f2fs_put_page(npage[0], 0);
				goto release_out;
			}
		}
		if (i < level) {
			parent = npage[i];
			nids[i + 1] = get_nid(parent, offset[i], false);
		}
	}
	dn->nid = nids[level];
	dn->ofs_in_node = offset[level];
	dn->node_page = npage[level];
	dn->data_blkaddr = datablock_addr(dn->node_page, dn->ofs_in_node);
	return 0;

release_pages:
	f2fs_put_page(parent, 1);
	if (i > 1)
		f2fs_put_page(npage[0], 0);
release_out:
	dn->inode_page = NULL;
	dn->node_page = NULL;
	return err;
}

static void truncate_node(struct dnode_of_data *dn)
{
586
	struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
J
Jaegeuk Kim 已提交
587 588 589
	struct node_info ni;

	get_node_info(sbi, dn->nid, &ni);
590
	if (dn->inode->i_blocks == 0) {
591
		f2fs_bug_on(sbi, ni.blk_addr != NULL_ADDR);
592 593
		goto invalidate;
	}
594
	f2fs_bug_on(sbi, ni.blk_addr == NULL_ADDR);
J
Jaegeuk Kim 已提交
595 596

	/* Deallocate node address */
597
	invalidate_blocks(sbi, ni.blk_addr);
598
	dec_valid_node_count(sbi, dn->inode);
599
	set_node_addr(sbi, &ni, NULL_ADDR, false);
J
Jaegeuk Kim 已提交
600 601 602 603 604 605 606

	if (dn->nid == dn->inode->i_ino) {
		remove_orphan_inode(sbi, dn->nid);
		dec_valid_inode_count(sbi);
	} else {
		sync_inode_page(dn);
	}
607
invalidate:
J
Jaegeuk Kim 已提交
608
	clear_node_page_dirty(dn->node_page);
609
	set_sbi_flag(sbi, SBI_IS_DIRTY);
J
Jaegeuk Kim 已提交
610 611

	f2fs_put_page(dn->node_page, 1);
612 613 614 615

	invalidate_mapping_pages(NODE_MAPPING(sbi),
			dn->node_page->index, dn->node_page->index);

J
Jaegeuk Kim 已提交
616
	dn->node_page = NULL;
617
	trace_f2fs_truncate_node(dn->inode, dn->nid, ni.blk_addr);
J
Jaegeuk Kim 已提交
618 619 620 621 622 623 624 625 626 627
}

static int truncate_dnode(struct dnode_of_data *dn)
{
	struct page *page;

	if (dn->nid == 0)
		return 1;

	/* get direct node */
628
	page = get_node_page(F2FS_I_SB(dn->inode), dn->nid);
J
Jaegeuk Kim 已提交
629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655
	if (IS_ERR(page) && PTR_ERR(page) == -ENOENT)
		return 1;
	else if (IS_ERR(page))
		return PTR_ERR(page);

	/* Make dnode_of_data for parameter */
	dn->node_page = page;
	dn->ofs_in_node = 0;
	truncate_data_blocks(dn);
	truncate_node(dn);
	return 1;
}

static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs,
						int ofs, int depth)
{
	struct dnode_of_data rdn = *dn;
	struct page *page;
	struct f2fs_node *rn;
	nid_t child_nid;
	unsigned int child_nofs;
	int freed = 0;
	int i, ret;

	if (dn->nid == 0)
		return NIDS_PER_BLOCK + 1;

656 657
	trace_f2fs_truncate_nodes_enter(dn->inode, dn->nid, dn->data_blkaddr);

658
	page = get_node_page(F2FS_I_SB(dn->inode), dn->nid);
659 660
	if (IS_ERR(page)) {
		trace_f2fs_truncate_nodes_exit(dn->inode, PTR_ERR(page));
J
Jaegeuk Kim 已提交
661
		return PTR_ERR(page);
662
	}
J
Jaegeuk Kim 已提交
663

664
	rn = F2FS_NODE(page);
J
Jaegeuk Kim 已提交
665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
	if (depth < 3) {
		for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) {
			child_nid = le32_to_cpu(rn->in.nid[i]);
			if (child_nid == 0)
				continue;
			rdn.nid = child_nid;
			ret = truncate_dnode(&rdn);
			if (ret < 0)
				goto out_err;
			set_nid(page, i, 0, false);
		}
	} else {
		child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1;
		for (i = ofs; i < NIDS_PER_BLOCK; i++) {
			child_nid = le32_to_cpu(rn->in.nid[i]);
			if (child_nid == 0) {
				child_nofs += NIDS_PER_BLOCK + 1;
				continue;
			}
			rdn.nid = child_nid;
			ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1);
			if (ret == (NIDS_PER_BLOCK + 1)) {
				set_nid(page, i, 0, false);
				child_nofs += ret;
			} else if (ret < 0 && ret != -ENOENT) {
				goto out_err;
			}
		}
		freed = child_nofs;
	}

	if (!ofs) {
		/* remove current indirect node */
		dn->node_page = page;
		truncate_node(dn);
		freed++;
	} else {
		f2fs_put_page(page, 1);
	}
704
	trace_f2fs_truncate_nodes_exit(dn->inode, freed);
J
Jaegeuk Kim 已提交
705 706 707 708
	return freed;

out_err:
	f2fs_put_page(page, 1);
709
	trace_f2fs_truncate_nodes_exit(dn->inode, ret);
J
Jaegeuk Kim 已提交
710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727
	return ret;
}

static int truncate_partial_nodes(struct dnode_of_data *dn,
			struct f2fs_inode *ri, int *offset, int depth)
{
	struct page *pages[2];
	nid_t nid[3];
	nid_t child_nid;
	int err = 0;
	int i;
	int idx = depth - 2;

	nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]);
	if (!nid[0])
		return 0;

	/* get indirect nodes in the path */
728
	for (i = 0; i < idx + 1; i++) {
A
arter97 已提交
729
		/* reference count'll be increased */
730
		pages[i] = get_node_page(F2FS_I_SB(dn->inode), nid[i]);
J
Jaegeuk Kim 已提交
731 732
		if (IS_ERR(pages[i])) {
			err = PTR_ERR(pages[i]);
733
			idx = i - 1;
J
Jaegeuk Kim 已提交
734 735 736 737 738 739
			goto fail;
		}
		nid[i + 1] = get_nid(pages[i], offset[i + 1], false);
	}

	/* free direct nodes linked to a partial indirect node */
740
	for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) {
J
Jaegeuk Kim 已提交
741 742 743 744 745 746 747 748 749 750
		child_nid = get_nid(pages[idx], i, false);
		if (!child_nid)
			continue;
		dn->nid = child_nid;
		err = truncate_dnode(dn);
		if (err < 0)
			goto fail;
		set_nid(pages[idx], i, 0, false);
	}

751
	if (offset[idx + 1] == 0) {
J
Jaegeuk Kim 已提交
752 753 754 755 756 757 758
		dn->node_page = pages[idx];
		dn->nid = nid[idx];
		truncate_node(dn);
	} else {
		f2fs_put_page(pages[idx], 1);
	}
	offset[idx]++;
759 760
	offset[idx + 1] = 0;
	idx--;
J
Jaegeuk Kim 已提交
761
fail:
762
	for (i = idx; i >= 0; i--)
J
Jaegeuk Kim 已提交
763
		f2fs_put_page(pages[i], 1);
764 765 766

	trace_f2fs_truncate_partial_nodes(dn->inode, nid, depth, err);

J
Jaegeuk Kim 已提交
767 768 769
	return err;
}

J
Jaegeuk Kim 已提交
770
/*
J
Jaegeuk Kim 已提交
771 772 773 774
 * All the block addresses of data and nodes should be nullified.
 */
int truncate_inode_blocks(struct inode *inode, pgoff_t from)
{
775
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
J
Jaegeuk Kim 已提交
776 777
	int err = 0, cont = 1;
	int level, offset[4], noffset[4];
J
Jaegeuk Kim 已提交
778
	unsigned int nofs = 0;
779
	struct f2fs_inode *ri;
J
Jaegeuk Kim 已提交
780 781 782
	struct dnode_of_data dn;
	struct page *page;

783 784
	trace_f2fs_truncate_inode_blocks_enter(inode, from);

785
	level = get_node_path(F2FS_I(inode), from, offset, noffset);
786
restart:
J
Jaegeuk Kim 已提交
787
	page = get_node_page(sbi, inode->i_ino);
788 789
	if (IS_ERR(page)) {
		trace_f2fs_truncate_inode_blocks_exit(inode, PTR_ERR(page));
J
Jaegeuk Kim 已提交
790
		return PTR_ERR(page);
791
	}
J
Jaegeuk Kim 已提交
792 793 794 795

	set_new_dnode(&dn, inode, page, NULL, 0);
	unlock_page(page);

796
	ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
797 798 799 800 801 802 803 804 805
	switch (level) {
	case 0:
	case 1:
		nofs = noffset[1];
		break;
	case 2:
		nofs = noffset[1];
		if (!offset[level - 1])
			goto skip_partial;
806
		err = truncate_partial_nodes(&dn, ri, offset, level);
J
Jaegeuk Kim 已提交
807 808 809 810 811 812 813 814
		if (err < 0 && err != -ENOENT)
			goto fail;
		nofs += 1 + NIDS_PER_BLOCK;
		break;
	case 3:
		nofs = 5 + 2 * NIDS_PER_BLOCK;
		if (!offset[level - 1])
			goto skip_partial;
815
		err = truncate_partial_nodes(&dn, ri, offset, level);
J
Jaegeuk Kim 已提交
816 817 818 819 820 821 822 823 824
		if (err < 0 && err != -ENOENT)
			goto fail;
		break;
	default:
		BUG();
	}

skip_partial:
	while (cont) {
825
		dn.nid = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]);
J
Jaegeuk Kim 已提交
826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847
		switch (offset[0]) {
		case NODE_DIR1_BLOCK:
		case NODE_DIR2_BLOCK:
			err = truncate_dnode(&dn);
			break;

		case NODE_IND1_BLOCK:
		case NODE_IND2_BLOCK:
			err = truncate_nodes(&dn, nofs, offset[1], 2);
			break;

		case NODE_DIND_BLOCK:
			err = truncate_nodes(&dn, nofs, offset[1], 3);
			cont = 0;
			break;

		default:
			BUG();
		}
		if (err < 0 && err != -ENOENT)
			goto fail;
		if (offset[1] == 0 &&
848
				ri->i_nid[offset[0] - NODE_DIR1_BLOCK]) {
J
Jaegeuk Kim 已提交
849
			lock_page(page);
850
			if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
851 852 853
				f2fs_put_page(page, 1);
				goto restart;
			}
854
			f2fs_wait_on_page_writeback(page, NODE);
855
			ri->i_nid[offset[0] - NODE_DIR1_BLOCK] = 0;
J
Jaegeuk Kim 已提交
856 857 858 859 860 861 862 863 864
			set_page_dirty(page);
			unlock_page(page);
		}
		offset[1] = 0;
		offset[0]++;
		nofs += err;
	}
fail:
	f2fs_put_page(page, 0);
865
	trace_f2fs_truncate_inode_blocks_exit(inode, err);
J
Jaegeuk Kim 已提交
866 867 868
	return err > 0 ? 0 : err;
}

869 870
int truncate_xattr_node(struct inode *inode, struct page *page)
{
871
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
872 873 874 875 876 877 878 879 880 881 882 883
	nid_t nid = F2FS_I(inode)->i_xattr_nid;
	struct dnode_of_data dn;
	struct page *npage;

	if (!nid)
		return 0;

	npage = get_node_page(sbi, nid);
	if (IS_ERR(npage))
		return PTR_ERR(npage);

	F2FS_I(inode)->i_xattr_nid = 0;
J
Jaegeuk Kim 已提交
884 885 886 887

	/* need to do checkpoint during fsync */
	F2FS_I(inode)->xattr_ver = cur_cp_version(F2FS_CKPT(sbi));

888 889 890
	set_new_dnode(&dn, inode, page, npage, nid);

	if (page)
891
		dn.inode_page_locked = true;
892 893 894 895
	truncate_node(&dn);
	return 0;
}

896
/*
C
Chao Yu 已提交
897 898
 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
 * f2fs_unlock_op().
899
 */
C
Chao Yu 已提交
900
int remove_inode_page(struct inode *inode)
J
Jaegeuk Kim 已提交
901 902
{
	struct dnode_of_data dn;
C
Chao Yu 已提交
903
	int err;
J
Jaegeuk Kim 已提交
904

905
	set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino);
C
Chao Yu 已提交
906 907 908
	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	if (err)
		return err;
J
Jaegeuk Kim 已提交
909

C
Chao Yu 已提交
910 911
	err = truncate_xattr_node(inode, dn.inode_page);
	if (err) {
912
		f2fs_put_dnode(&dn);
C
Chao Yu 已提交
913
		return err;
J
Jaegeuk Kim 已提交
914
	}
915 916 917 918 919 920

	/* remove potential inline_data blocks */
	if (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
				S_ISLNK(inode->i_mode))
		truncate_data_blocks_range(&dn, 1);

A
arter97 已提交
921
	/* 0 is possible, after f2fs_new_inode() has failed */
922 923
	f2fs_bug_on(F2FS_I_SB(inode),
			inode->i_blocks != 0 && inode->i_blocks != 1);
924 925

	/* will put inode & node pages */
926
	truncate_node(&dn);
C
Chao Yu 已提交
927
	return 0;
J
Jaegeuk Kim 已提交
928 929
}

930
struct page *new_inode_page(struct inode *inode)
J
Jaegeuk Kim 已提交
931 932 933 934 935
{
	struct dnode_of_data dn;

	/* allocate inode page for new inode */
	set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino);
936 937

	/* caller should f2fs_put_page(page, 1); */
938
	return new_node_page(&dn, 0, NULL);
J
Jaegeuk Kim 已提交
939 940
}

941 942
struct page *new_node_page(struct dnode_of_data *dn,
				unsigned int ofs, struct page *ipage)
J
Jaegeuk Kim 已提交
943
{
944
	struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
J
Jaegeuk Kim 已提交
945 946 947 948
	struct node_info old_ni, new_ni;
	struct page *page;
	int err;

949
	if (unlikely(is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC)))
J
Jaegeuk Kim 已提交
950 951
		return ERR_PTR(-EPERM);

952
	page = grab_cache_page(NODE_MAPPING(sbi), dn->nid);
J
Jaegeuk Kim 已提交
953 954 955
	if (!page)
		return ERR_PTR(-ENOMEM);

956
	if (unlikely(!inc_valid_node_count(sbi, dn->inode))) {
957 958 959
		err = -ENOSPC;
		goto fail;
	}
J
Jaegeuk Kim 已提交
960

961
	get_node_info(sbi, dn->nid, &old_ni);
J
Jaegeuk Kim 已提交
962 963

	/* Reinitialize old_ni with new node page */
964
	f2fs_bug_on(sbi, old_ni.blk_addr != NULL_ADDR);
J
Jaegeuk Kim 已提交
965 966
	new_ni = old_ni;
	new_ni.ino = dn->inode->i_ino;
967
	set_node_addr(sbi, &new_ni, NEW_ADDR, false);
968

969
	f2fs_wait_on_page_writeback(page, NODE);
970
	fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true);
971
	set_cold_node(dn->inode, page);
972 973
	SetPageUptodate(page);
	set_page_dirty(page);
J
Jaegeuk Kim 已提交
974

975
	if (f2fs_has_xattr_block(ofs))
976 977
		F2FS_I(dn->inode)->i_xattr_nid = dn->nid;

J
Jaegeuk Kim 已提交
978
	dn->node_page = page;
979 980 981 982
	if (ipage)
		update_inode(dn->inode, ipage);
	else
		sync_inode_page(dn);
J
Jaegeuk Kim 已提交
983 984 985 986 987 988
	if (ofs == 0)
		inc_valid_inode_count(sbi);

	return page;

fail:
989
	clear_node_page_dirty(page);
J
Jaegeuk Kim 已提交
990 991 992 993
	f2fs_put_page(page, 1);
	return ERR_PTR(err);
}

994 995 996
/*
 * Caller should do after getting the following values.
 * 0: f2fs_put_page(page, 0)
997
 * LOCKED_PAGE or error: f2fs_put_page(page, 1)
998
 */
999
static int read_node_page(struct page *page, int rw)
J
Jaegeuk Kim 已提交
1000
{
1001
	struct f2fs_sb_info *sbi = F2FS_P_SB(page);
J
Jaegeuk Kim 已提交
1002
	struct node_info ni;
1003
	struct f2fs_io_info fio = {
1004
		.sbi = sbi,
1005 1006
		.type = NODE,
		.rw = rw,
1007
		.page = page,
1008
		.encrypted_page = NULL,
1009
	};
J
Jaegeuk Kim 已提交
1010 1011 1012

	get_node_info(sbi, page->index, &ni);

1013
	if (unlikely(ni.blk_addr == NULL_ADDR)) {
1014
		ClearPageUptodate(page);
J
Jaegeuk Kim 已提交
1015
		return -ENOENT;
1016 1017
	}

1018 1019
	if (PageUptodate(page))
		return LOCKED_PAGE;
1020

1021
	fio.blk_addr = ni.blk_addr;
1022
	return f2fs_submit_page_bio(&fio);
J
Jaegeuk Kim 已提交
1023 1024
}

J
Jaegeuk Kim 已提交
1025
/*
J
Jaegeuk Kim 已提交
1026 1027 1028 1029 1030
 * Readahead a node page
 */
void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid)
{
	struct page *apage;
1031
	int err;
J
Jaegeuk Kim 已提交
1032

1033
	apage = find_get_page(NODE_MAPPING(sbi), nid);
1034 1035 1036 1037
	if (apage && PageUptodate(apage)) {
		f2fs_put_page(apage, 0);
		return;
	}
J
Jaegeuk Kim 已提交
1038 1039
	f2fs_put_page(apage, 0);

1040
	apage = grab_cache_page(NODE_MAPPING(sbi), nid);
J
Jaegeuk Kim 已提交
1041 1042 1043
	if (!apage)
		return;

1044
	err = read_node_page(apage, READA);
1045
	f2fs_put_page(apage, err ? 1 : 0);
J
Jaegeuk Kim 已提交
1046 1047 1048 1049
}

struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid)
{
1050 1051
	struct page *page;
	int err;
1052
repeat:
1053
	page = grab_cache_page(NODE_MAPPING(sbi), nid);
J
Jaegeuk Kim 已提交
1054 1055 1056 1057
	if (!page)
		return ERR_PTR(-ENOMEM);

	err = read_node_page(page, READ_SYNC);
1058 1059
	if (err < 0) {
		f2fs_put_page(page, 1);
J
Jaegeuk Kim 已提交
1060
		return ERR_PTR(err);
1061
	} else if (err != LOCKED_PAGE) {
1062
		lock_page(page);
1063
	}
J
Jaegeuk Kim 已提交
1064

1065
	if (unlikely(!PageUptodate(page) || nid != nid_of_node(page))) {
1066
		ClearPageUptodate(page);
1067 1068 1069
		f2fs_put_page(page, 1);
		return ERR_PTR(-EIO);
	}
1070
	if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1071 1072 1073
		f2fs_put_page(page, 1);
		goto repeat;
	}
J
Jaegeuk Kim 已提交
1074 1075 1076
	return page;
}

J
Jaegeuk Kim 已提交
1077
/*
J
Jaegeuk Kim 已提交
1078 1079 1080 1081 1082
 * Return a locked page for the desired node page.
 * And, readahead MAX_RA_NODE number of node pages.
 */
struct page *get_node_page_ra(struct page *parent, int start)
{
1083
	struct f2fs_sb_info *sbi = F2FS_P_SB(parent);
1084
	struct blk_plug plug;
J
Jaegeuk Kim 已提交
1085
	struct page *page;
1086 1087
	int err, i, end;
	nid_t nid;
J
Jaegeuk Kim 已提交
1088 1089 1090 1091 1092

	/* First, try getting the desired direct node. */
	nid = get_nid(parent, start, false);
	if (!nid)
		return ERR_PTR(-ENOENT);
1093
repeat:
1094
	page = grab_cache_page(NODE_MAPPING(sbi), nid);
J
Jaegeuk Kim 已提交
1095 1096 1097
	if (!page)
		return ERR_PTR(-ENOMEM);

1098
	err = read_node_page(page, READ_SYNC);
1099 1100
	if (err < 0) {
		f2fs_put_page(page, 1);
J
Jaegeuk Kim 已提交
1101
		return ERR_PTR(err);
1102
	} else if (err == LOCKED_PAGE) {
1103
		goto page_hit;
1104
	}
J
Jaegeuk Kim 已提交
1105

1106 1107
	blk_start_plug(&plug);

J
Jaegeuk Kim 已提交
1108 1109 1110 1111 1112 1113 1114 1115 1116 1117
	/* Then, try readahead for siblings of the desired node */
	end = start + MAX_RA_NODE;
	end = min(end, NIDS_PER_BLOCK);
	for (i = start + 1; i < end; i++) {
		nid = get_nid(parent, i, false);
		if (!nid)
			continue;
		ra_node_page(sbi, nid);
	}

1118 1119
	blk_finish_plug(&plug);

J
Jaegeuk Kim 已提交
1120
	lock_page(page);
1121
	if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1122 1123 1124
		f2fs_put_page(page, 1);
		goto repeat;
	}
1125
page_hit:
1126
	if (unlikely(!PageUptodate(page))) {
J
Jaegeuk Kim 已提交
1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143
		f2fs_put_page(page, 1);
		return ERR_PTR(-EIO);
	}
	return page;
}

void sync_inode_page(struct dnode_of_data *dn)
{
	if (IS_INODE(dn->node_page) || dn->inode_page == dn->node_page) {
		update_inode(dn->inode, dn->node_page);
	} else if (dn->inode_page) {
		if (!dn->inode_page_locked)
			lock_page(dn->inode_page);
		update_inode(dn->inode, dn->inode_page);
		if (!dn->inode_page_locked)
			unlock_page(dn->inode_page);
	} else {
1144
		update_inode_page(dn->inode);
J
Jaegeuk Kim 已提交
1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163
	}
}

int sync_node_pages(struct f2fs_sb_info *sbi, nid_t ino,
					struct writeback_control *wbc)
{
	pgoff_t index, end;
	struct pagevec pvec;
	int step = ino ? 2 : 0;
	int nwritten = 0, wrote = 0;

	pagevec_init(&pvec, 0);

next_step:
	index = 0;
	end = LONG_MAX;

	while (index <= end) {
		int i, nr_pages;
1164
		nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
J
Jaegeuk Kim 已提交
1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
				PAGECACHE_TAG_DIRTY,
				min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
		if (nr_pages == 0)
			break;

		for (i = 0; i < nr_pages; i++) {
			struct page *page = pvec.pages[i];

			/*
			 * flushing sequence with step:
			 * 0. indirect nodes
			 * 1. dentry dnodes
			 * 2. file dnodes
			 */
			if (step == 0 && IS_DNODE(page))
				continue;
			if (step == 1 && (!IS_DNODE(page) ||
						is_cold_node(page)))
				continue;
			if (step == 2 && (!IS_DNODE(page) ||
						!is_cold_node(page)))
				continue;

			/*
			 * If an fsync mode,
			 * we should not skip writing node pages.
			 */
			if (ino && ino_of_node(page) == ino)
				lock_page(page);
			else if (!trylock_page(page))
				continue;

1197
			if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
J
Jaegeuk Kim 已提交
1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215
continue_unlock:
				unlock_page(page);
				continue;
			}
			if (ino && ino_of_node(page) != ino)
				goto continue_unlock;

			if (!PageDirty(page)) {
				/* someone wrote it for us */
				goto continue_unlock;
			}

			if (!clear_page_dirty_for_io(page))
				goto continue_unlock;

			/* called by fsync() */
			if (ino && IS_DNODE(page)) {
				set_fsync_mark(page, 1);
J
Jaegeuk Kim 已提交
1216 1217 1218
				if (IS_INODE(page))
					set_dentry_mark(page,
						need_dentry_mark(sbi, ino));
J
Jaegeuk Kim 已提交
1219 1220 1221 1222 1223
				nwritten++;
			} else {
				set_fsync_mark(page, 0);
				set_dentry_mark(page, 0);
			}
1224 1225 1226 1227 1228

			if (NODE_MAPPING(sbi)->a_ops->writepage(page, wbc))
				unlock_page(page);
			else
				wrote++;
J
Jaegeuk Kim 已提交
1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247

			if (--wbc->nr_to_write == 0)
				break;
		}
		pagevec_release(&pvec);
		cond_resched();

		if (wbc->nr_to_write == 0) {
			step = 2;
			break;
		}
	}

	if (step < 2) {
		step++;
		goto next_step;
	}

	if (wrote)
J
Jaegeuk Kim 已提交
1248
		f2fs_submit_merged_bio(sbi, NODE, WRITE);
J
Jaegeuk Kim 已提交
1249 1250 1251
	return nwritten;
}

1252 1253 1254 1255 1256 1257 1258
int wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, nid_t ino)
{
	pgoff_t index = 0, end = LONG_MAX;
	struct pagevec pvec;
	int ret2 = 0, ret = 0;

	pagevec_init(&pvec, 0);
1259 1260 1261 1262 1263 1264 1265 1266

	while (index <= end) {
		int i, nr_pages;
		nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
				PAGECACHE_TAG_WRITEBACK,
				min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
		if (nr_pages == 0)
			break;
1267 1268 1269 1270 1271

		for (i = 0; i < nr_pages; i++) {
			struct page *page = pvec.pages[i];

			/* until radix tree lookup accepts end_index */
1272
			if (unlikely(page->index > end))
1273 1274
				continue;

1275
			if (ino && ino_of_node(page) == ino) {
1276
				f2fs_wait_on_page_writeback(page, NODE);
1277 1278 1279
				if (TestClearPageError(page))
					ret = -EIO;
			}
1280 1281 1282 1283 1284
		}
		pagevec_release(&pvec);
		cond_resched();
	}

1285
	if (unlikely(test_and_clear_bit(AS_ENOSPC, &NODE_MAPPING(sbi)->flags)))
1286
		ret2 = -ENOSPC;
1287
	if (unlikely(test_and_clear_bit(AS_EIO, &NODE_MAPPING(sbi)->flags)))
1288 1289 1290 1291 1292 1293
		ret2 = -EIO;
	if (!ret)
		ret = ret2;
	return ret;
}

J
Jaegeuk Kim 已提交
1294 1295 1296
static int f2fs_write_node_page(struct page *page,
				struct writeback_control *wbc)
{
1297
	struct f2fs_sb_info *sbi = F2FS_P_SB(page);
J
Jaegeuk Kim 已提交
1298 1299
	nid_t nid;
	struct node_info ni;
1300
	struct f2fs_io_info fio = {
1301
		.sbi = sbi,
1302
		.type = NODE,
C
Chris Fries 已提交
1303
		.rw = (wbc->sync_mode == WB_SYNC_ALL) ? WRITE_SYNC : WRITE,
1304
		.page = page,
1305
		.encrypted_page = NULL,
1306
	};
J
Jaegeuk Kim 已提交
1307

1308 1309
	trace_f2fs_writepage(page, NODE);

1310
	if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
1311
		goto redirty_out;
1312 1313
	if (unlikely(f2fs_cp_error(sbi)))
		goto redirty_out;
1314

1315
	f2fs_wait_on_page_writeback(page, NODE);
J
Jaegeuk Kim 已提交
1316 1317 1318

	/* get old block addr of this node page */
	nid = nid_of_node(page);
1319
	f2fs_bug_on(sbi, page->index != nid);
J
Jaegeuk Kim 已提交
1320

1321 1322 1323 1324 1325 1326 1327
	if (wbc->for_reclaim) {
		if (!down_read_trylock(&sbi->node_write))
			goto redirty_out;
	} else {
		down_read(&sbi->node_write);
	}

J
Jaegeuk Kim 已提交
1328 1329 1330
	get_node_info(sbi, nid, &ni);

	/* This page is already truncated */
1331
	if (unlikely(ni.blk_addr == NULL_ADDR)) {
1332
		ClearPageUptodate(page);
1333
		dec_page_count(sbi, F2FS_DIRTY_NODES);
1334
		up_read(&sbi->node_write);
1335 1336 1337
		unlock_page(page);
		return 0;
	}
J
Jaegeuk Kim 已提交
1338 1339

	set_page_writeback(page);
1340
	fio.blk_addr = ni.blk_addr;
1341
	write_node_page(nid, &fio);
1342
	set_node_addr(sbi, &ni, fio.blk_addr, is_fsync_dnode(page));
J
Jaegeuk Kim 已提交
1343
	dec_page_count(sbi, F2FS_DIRTY_NODES);
1344
	up_read(&sbi->node_write);
J
Jaegeuk Kim 已提交
1345
	unlock_page(page);
1346 1347 1348 1349

	if (wbc->for_reclaim)
		f2fs_submit_merged_bio(sbi, NODE, WRITE);

J
Jaegeuk Kim 已提交
1350
	return 0;
1351 1352

redirty_out:
1353
	redirty_page_for_writepage(wbc, page);
1354
	return AOP_WRITEPAGE_ACTIVATE;
J
Jaegeuk Kim 已提交
1355 1356 1357 1358 1359
}

static int f2fs_write_node_pages(struct address_space *mapping,
			    struct writeback_control *wbc)
{
1360
	struct f2fs_sb_info *sbi = F2FS_M_SB(mapping);
1361
	long diff;
J
Jaegeuk Kim 已提交
1362

1363 1364
	trace_f2fs_writepages(mapping->host, wbc, NODE);

1365 1366
	/* balancing f2fs's metadata in background */
	f2fs_balance_fs_bg(sbi);
J
Jaegeuk Kim 已提交
1367

1368
	/* collect a number of dirty node pages and write together */
1369
	if (get_pages(sbi, F2FS_DIRTY_NODES) < nr_pages_to_skip(sbi, NODE))
1370
		goto skip_write;
1371

1372
	diff = nr_pages_to_write(sbi, NODE, wbc);
1373
	wbc->sync_mode = WB_SYNC_NONE;
J
Jaegeuk Kim 已提交
1374
	sync_node_pages(sbi, 0, wbc);
1375
	wbc->nr_to_write = max((long)0, wbc->nr_to_write - diff);
J
Jaegeuk Kim 已提交
1376
	return 0;
1377 1378 1379 1380

skip_write:
	wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_NODES);
	return 0;
J
Jaegeuk Kim 已提交
1381 1382 1383 1384
}

static int f2fs_set_node_page_dirty(struct page *page)
{
1385 1386
	trace_f2fs_set_page_dirty(page, NODE);

J
Jaegeuk Kim 已提交
1387 1388 1389
	SetPageUptodate(page);
	if (!PageDirty(page)) {
		__set_page_dirty_nobuffers(page);
1390
		inc_page_count(F2FS_P_SB(page), F2FS_DIRTY_NODES);
J
Jaegeuk Kim 已提交
1391
		SetPagePrivate(page);
J
Jaegeuk Kim 已提交
1392
		f2fs_trace_pid(page);
J
Jaegeuk Kim 已提交
1393 1394 1395 1396 1397
		return 1;
	}
	return 0;
}

J
Jaegeuk Kim 已提交
1398
/*
J
Jaegeuk Kim 已提交
1399 1400 1401 1402 1403 1404
 * Structure of the f2fs node operations
 */
const struct address_space_operations f2fs_node_aops = {
	.writepage	= f2fs_write_node_page,
	.writepages	= f2fs_write_node_pages,
	.set_page_dirty	= f2fs_set_node_page_dirty,
1405 1406
	.invalidatepage	= f2fs_invalidate_page,
	.releasepage	= f2fs_release_page,
J
Jaegeuk Kim 已提交
1407 1408
};

1409 1410
static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i,
						nid_t n)
J
Jaegeuk Kim 已提交
1411
{
1412
	return radix_tree_lookup(&nm_i->free_nid_root, n);
J
Jaegeuk Kim 已提交
1413 1414
}

1415 1416
static void __del_from_free_nid_list(struct f2fs_nm_info *nm_i,
						struct free_nid *i)
J
Jaegeuk Kim 已提交
1417 1418
{
	list_del(&i->list);
1419
	radix_tree_delete(&nm_i->free_nid_root, i->nid);
J
Jaegeuk Kim 已提交
1420 1421
}

1422
static int add_free_nid(struct f2fs_sb_info *sbi, nid_t nid, bool build)
J
Jaegeuk Kim 已提交
1423
{
1424
	struct f2fs_nm_info *nm_i = NM_I(sbi);
J
Jaegeuk Kim 已提交
1425
	struct free_nid *i;
1426 1427
	struct nat_entry *ne;
	bool allocated = false;
J
Jaegeuk Kim 已提交
1428

1429
	if (!available_free_memory(sbi, FREE_NIDS))
H
Haicheng Li 已提交
1430
		return -1;
1431 1432

	/* 0 nid should not be used */
1433
	if (unlikely(nid == 0))
1434
		return 0;
1435

1436 1437
	if (build) {
		/* do not add allocated nids */
1438
		down_read(&nm_i->nat_tree_lock);
1439
		ne = __lookup_nat_cache(nm_i, nid);
1440
		if (ne &&
1441 1442
			(!get_nat_flag(ne, IS_CHECKPOINTED) ||
				nat_get_blkaddr(ne) != NULL_ADDR))
1443
			allocated = true;
1444
		up_read(&nm_i->nat_tree_lock);
1445 1446
		if (allocated)
			return 0;
J
Jaegeuk Kim 已提交
1447
	}
1448 1449

	i = f2fs_kmem_cache_alloc(free_nid_slab, GFP_NOFS);
J
Jaegeuk Kim 已提交
1450 1451 1452
	i->nid = nid;
	i->state = NID_NEW;

1453 1454 1455 1456 1457
	if (radix_tree_preload(GFP_NOFS)) {
		kmem_cache_free(free_nid_slab, i);
		return 0;
	}

J
Jaegeuk Kim 已提交
1458
	spin_lock(&nm_i->free_nid_list_lock);
1459
	if (radix_tree_insert(&nm_i->free_nid_root, i->nid, i)) {
J
Jaegeuk Kim 已提交
1460
		spin_unlock(&nm_i->free_nid_list_lock);
1461
		radix_tree_preload_end();
J
Jaegeuk Kim 已提交
1462 1463 1464 1465 1466 1467
		kmem_cache_free(free_nid_slab, i);
		return 0;
	}
	list_add_tail(&i->list, &nm_i->free_nid_list);
	nm_i->fcnt++;
	spin_unlock(&nm_i->free_nid_list_lock);
1468
	radix_tree_preload_end();
J
Jaegeuk Kim 已提交
1469 1470 1471 1472 1473 1474
	return 1;
}

static void remove_free_nid(struct f2fs_nm_info *nm_i, nid_t nid)
{
	struct free_nid *i;
1475 1476
	bool need_free = false;

J
Jaegeuk Kim 已提交
1477
	spin_lock(&nm_i->free_nid_list_lock);
1478
	i = __lookup_free_nid_list(nm_i, nid);
J
Jaegeuk Kim 已提交
1479
	if (i && i->state == NID_NEW) {
1480
		__del_from_free_nid_list(nm_i, i);
J
Jaegeuk Kim 已提交
1481
		nm_i->fcnt--;
1482
		need_free = true;
J
Jaegeuk Kim 已提交
1483 1484
	}
	spin_unlock(&nm_i->free_nid_list_lock);
1485 1486 1487

	if (need_free)
		kmem_cache_free(free_nid_slab, i);
J
Jaegeuk Kim 已提交
1488 1489
}

1490
static void scan_nat_page(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
1491 1492
			struct page *nat_page, nid_t start_nid)
{
1493
	struct f2fs_nm_info *nm_i = NM_I(sbi);
J
Jaegeuk Kim 已提交
1494 1495 1496 1497 1498 1499 1500
	struct f2fs_nat_block *nat_blk = page_address(nat_page);
	block_t blk_addr;
	int i;

	i = start_nid % NAT_ENTRY_PER_BLOCK;

	for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) {
H
Haicheng Li 已提交
1501

1502
		if (unlikely(start_nid >= nm_i->max_nid))
J
Jaegeuk Kim 已提交
1503
			break;
H
Haicheng Li 已提交
1504 1505

		blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr);
1506
		f2fs_bug_on(sbi, blk_addr == NEW_ADDR);
H
Haicheng Li 已提交
1507
		if (blk_addr == NULL_ADDR) {
1508
			if (add_free_nid(sbi, start_nid, true) < 0)
H
Haicheng Li 已提交
1509 1510
				break;
		}
J
Jaegeuk Kim 已提交
1511 1512 1513 1514 1515 1516 1517 1518
	}
}

static void build_free_nids(struct f2fs_sb_info *sbi)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
	struct f2fs_summary_block *sum = curseg->sum_blk;
1519
	int i = 0;
1520
	nid_t nid = nm_i->next_scan_nid;
J
Jaegeuk Kim 已提交
1521

1522 1523 1524
	/* Enough entries */
	if (nm_i->fcnt > NAT_ENTRY_PER_BLOCK)
		return;
J
Jaegeuk Kim 已提交
1525

1526
	/* readahead nat pages to be scanned */
1527
	ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), FREE_NID_PAGES, META_NAT);
J
Jaegeuk Kim 已提交
1528 1529 1530 1531

	while (1) {
		struct page *page = get_current_nat_page(sbi, nid);

1532
		scan_nat_page(sbi, page, nid);
J
Jaegeuk Kim 已提交
1533 1534 1535
		f2fs_put_page(page, 1);

		nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK));
1536
		if (unlikely(nid >= nm_i->max_nid))
J
Jaegeuk Kim 已提交
1537
			nid = 0;
1538

1539
		if (++i >= FREE_NID_PAGES)
J
Jaegeuk Kim 已提交
1540 1541 1542
			break;
	}

1543 1544
	/* go to the next free nat pages to find free nids abundantly */
	nm_i->next_scan_nid = nid;
J
Jaegeuk Kim 已提交
1545 1546 1547 1548 1549 1550 1551

	/* find free nids from current sum_pages */
	mutex_lock(&curseg->curseg_mutex);
	for (i = 0; i < nats_in_cursum(sum); i++) {
		block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr);
		nid = le32_to_cpu(nid_in_journal(sum, i));
		if (addr == NULL_ADDR)
1552
			add_free_nid(sbi, nid, true);
J
Jaegeuk Kim 已提交
1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568
		else
			remove_free_nid(nm_i, nid);
	}
	mutex_unlock(&curseg->curseg_mutex);
}

/*
 * If this function returns success, caller can obtain a new nid
 * from second parameter of this function.
 * The returned nid could be used ino as well as nid when inode is created.
 */
bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *i = NULL;
retry:
1569
	if (unlikely(sbi->total_valid_node_count + 1 > nm_i->available_nids))
1570
		return false;
J
Jaegeuk Kim 已提交
1571 1572 1573

	spin_lock(&nm_i->free_nid_list_lock);

1574
	/* We should not use stale free nids created by build_free_nids */
1575
	if (nm_i->fcnt && !on_build_free_nids(nm_i)) {
1576 1577
		struct node_info ni;

1578
		f2fs_bug_on(sbi, list_empty(&nm_i->free_nid_list));
1579
		list_for_each_entry(i, &nm_i->free_nid_list, list)
1580 1581
			if (i->state == NID_NEW)
				break;
J
Jaegeuk Kim 已提交
1582

1583
		f2fs_bug_on(sbi, i->state != NID_NEW);
1584 1585 1586 1587
		*nid = i->nid;
		i->state = NID_ALLOC;
		nm_i->fcnt--;
		spin_unlock(&nm_i->free_nid_list_lock);
1588 1589 1590 1591 1592 1593 1594

		/* check nid is allocated already */
		get_node_info(sbi, *nid, &ni);
		if (ni.blk_addr != NULL_ADDR) {
			alloc_nid_done(sbi, *nid);
			goto retry;
		}
1595 1596
		return true;
	}
J
Jaegeuk Kim 已提交
1597
	spin_unlock(&nm_i->free_nid_list_lock);
1598 1599 1600 1601 1602 1603

	/* Let's scan nat pages and its caches to get free nids */
	mutex_lock(&nm_i->build_lock);
	build_free_nids(sbi);
	mutex_unlock(&nm_i->build_lock);
	goto retry;
J
Jaegeuk Kim 已提交
1604 1605
}

J
Jaegeuk Kim 已提交
1606
/*
J
Jaegeuk Kim 已提交
1607 1608 1609 1610 1611 1612 1613 1614
 * alloc_nid() should be called prior to this function.
 */
void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *i;

	spin_lock(&nm_i->free_nid_list_lock);
1615
	i = __lookup_free_nid_list(nm_i, nid);
1616
	f2fs_bug_on(sbi, !i || i->state != NID_ALLOC);
1617
	__del_from_free_nid_list(nm_i, i);
J
Jaegeuk Kim 已提交
1618
	spin_unlock(&nm_i->free_nid_list_lock);
1619 1620

	kmem_cache_free(free_nid_slab, i);
J
Jaegeuk Kim 已提交
1621 1622
}

J
Jaegeuk Kim 已提交
1623
/*
J
Jaegeuk Kim 已提交
1624 1625 1626 1627
 * alloc_nid() should be called prior to this function.
 */
void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid)
{
1628 1629
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *i;
1630
	bool need_free = false;
1631

J
Jaegeuk Kim 已提交
1632 1633 1634
	if (!nid)
		return;

1635
	spin_lock(&nm_i->free_nid_list_lock);
1636
	i = __lookup_free_nid_list(nm_i, nid);
1637
	f2fs_bug_on(sbi, !i || i->state != NID_ALLOC);
1638
	if (!available_free_memory(sbi, FREE_NIDS)) {
1639
		__del_from_free_nid_list(nm_i, i);
1640
		need_free = true;
1641 1642 1643 1644
	} else {
		i->state = NID_NEW;
		nm_i->fcnt++;
	}
1645
	spin_unlock(&nm_i->free_nid_list_lock);
1646 1647 1648

	if (need_free)
		kmem_cache_free(free_nid_slab, i);
J
Jaegeuk Kim 已提交
1649 1650
}

C
Chao Yu 已提交
1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667
int try_to_free_nids(struct f2fs_sb_info *sbi, int nr_shrink)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *i, *next;
	int nr = nr_shrink;

	if (!mutex_trylock(&nm_i->build_lock))
		return 0;

	spin_lock(&nm_i->free_nid_list_lock);
	list_for_each_entry_safe(i, next, &nm_i->free_nid_list, list) {
		if (nr_shrink <= 0 || nm_i->fcnt <= NAT_ENTRY_PER_BLOCK)
			break;
		if (i->state == NID_ALLOC)
			continue;
		__del_from_free_nid_list(nm_i, i);
		kmem_cache_free(free_nid_slab, i);
1668
		nm_i->fcnt--;
C
Chao Yu 已提交
1669 1670 1671 1672 1673 1674 1675 1676
		nr_shrink--;
	}
	spin_unlock(&nm_i->free_nid_list_lock);
	mutex_unlock(&nm_i->build_lock);

	return nr - nr_shrink;
}

1677
void recover_inline_xattr(struct inode *inode, struct page *page)
1678 1679 1680 1681 1682 1683
{
	void *src_addr, *dst_addr;
	size_t inline_size;
	struct page *ipage;
	struct f2fs_inode *ri;

1684
	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
1685
	f2fs_bug_on(F2FS_I_SB(inode), IS_ERR(ipage));
1686

1687 1688 1689 1690 1691 1692
	ri = F2FS_INODE(page);
	if (!(ri->i_inline & F2FS_INLINE_XATTR)) {
		clear_inode_flag(F2FS_I(inode), FI_INLINE_XATTR);
		goto update_inode;
	}

1693 1694 1695 1696
	dst_addr = inline_xattr_addr(ipage);
	src_addr = inline_xattr_addr(page);
	inline_size = inline_xattr_size(inode);

1697
	f2fs_wait_on_page_writeback(ipage, NODE);
1698
	memcpy(dst_addr, src_addr, inline_size);
1699
update_inode:
1700 1701 1702 1703
	update_inode(inode, ipage);
	f2fs_put_page(ipage, 1);
}

1704
void recover_xattr_data(struct inode *inode, struct page *page, block_t blkaddr)
1705
{
1706
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1707 1708 1709 1710 1711 1712 1713 1714 1715 1716
	nid_t prev_xnid = F2FS_I(inode)->i_xattr_nid;
	nid_t new_xnid = nid_of_node(page);
	struct node_info ni;

	/* 1: invalidate the previous xattr nid */
	if (!prev_xnid)
		goto recover_xnid;

	/* Deallocate node address */
	get_node_info(sbi, prev_xnid, &ni);
1717
	f2fs_bug_on(sbi, ni.blk_addr == NULL_ADDR);
1718 1719
	invalidate_blocks(sbi, ni.blk_addr);
	dec_valid_node_count(sbi, inode);
1720
	set_node_addr(sbi, &ni, NULL_ADDR, false);
1721 1722 1723 1724

recover_xnid:
	/* 2: allocate new xattr nid */
	if (unlikely(!inc_valid_node_count(sbi, inode)))
1725
		f2fs_bug_on(sbi, 1);
1726 1727 1728 1729

	remove_free_nid(NM_I(sbi), new_xnid);
	get_node_info(sbi, new_xnid, &ni);
	ni.ino = inode->i_ino;
1730
	set_node_addr(sbi, &ni, NEW_ADDR, false);
1731 1732 1733 1734
	F2FS_I(inode)->i_xattr_nid = new_xnid;

	/* 3: update xattr blkaddr */
	refresh_sit_entry(sbi, NEW_ADDR, blkaddr);
1735
	set_node_addr(sbi, &ni, blkaddr, false);
1736 1737 1738 1739

	update_inode_page(inode);
}

J
Jaegeuk Kim 已提交
1740 1741
int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page)
{
1742
	struct f2fs_inode *src, *dst;
J
Jaegeuk Kim 已提交
1743 1744 1745 1746
	nid_t ino = ino_of_node(page);
	struct node_info old_ni, new_ni;
	struct page *ipage;

1747 1748 1749 1750 1751
	get_node_info(sbi, ino, &old_ni);

	if (unlikely(old_ni.blk_addr != NULL_ADDR))
		return -EINVAL;

1752
	ipage = grab_cache_page(NODE_MAPPING(sbi), ino);
J
Jaegeuk Kim 已提交
1753 1754 1755
	if (!ipage)
		return -ENOMEM;

A
arter97 已提交
1756
	/* Should not use this inode from free nid list */
J
Jaegeuk Kim 已提交
1757 1758 1759 1760 1761
	remove_free_nid(NM_I(sbi), ino);

	SetPageUptodate(ipage);
	fill_node_footer(ipage, ino, ino, 0, true);

1762 1763
	src = F2FS_INODE(page);
	dst = F2FS_INODE(ipage);
J
Jaegeuk Kim 已提交
1764

1765 1766 1767 1768 1769
	memcpy(dst, src, (unsigned long)&src->i_ext - (unsigned long)src);
	dst->i_size = 0;
	dst->i_blocks = cpu_to_le64(1);
	dst->i_links = cpu_to_le32(1);
	dst->i_xattr_nid = 0;
1770
	dst->i_inline = src->i_inline & F2FS_INLINE_XATTR;
J
Jaegeuk Kim 已提交
1771 1772 1773 1774

	new_ni = old_ni;
	new_ni.ino = ino;

1775
	if (unlikely(!inc_valid_node_count(sbi, NULL)))
1776
		WARN_ON(1);
1777
	set_node_addr(sbi, &new_ni, NEW_ADDR, false);
J
Jaegeuk Kim 已提交
1778
	inc_valid_inode_count(sbi);
1779
	set_page_dirty(ipage);
J
Jaegeuk Kim 已提交
1780 1781 1782 1783 1784 1785 1786 1787 1788 1789
	f2fs_put_page(ipage, 1);
	return 0;
}

int restore_node_summary(struct f2fs_sb_info *sbi,
			unsigned int segno, struct f2fs_summary_block *sum)
{
	struct f2fs_node *rn;
	struct f2fs_summary *sum_entry;
	block_t addr;
J
Jaegeuk Kim 已提交
1790
	int bio_blocks = MAX_BIO_BLOCKS(sbi);
1791
	int i, idx, last_offset, nrpages;
J
Jaegeuk Kim 已提交
1792 1793 1794 1795 1796 1797

	/* scan the node segment */
	last_offset = sbi->blocks_per_seg;
	addr = START_BLOCK(sbi, segno);
	sum_entry = &sum->entries[0];

1798
	for (i = 0; i < last_offset; i += nrpages, addr += nrpages) {
1799
		nrpages = min(last_offset - i, bio_blocks);
1800

A
arter97 已提交
1801
		/* readahead node pages */
1802
		ra_meta_pages(sbi, addr, nrpages, META_POR);
J
Jaegeuk Kim 已提交
1803

1804 1805
		for (idx = addr; idx < addr + nrpages; idx++) {
			struct page *page = get_meta_page(sbi, idx);
1806

1807 1808 1809 1810 1811 1812
			rn = F2FS_NODE(page);
			sum_entry->nid = rn->footer.nid;
			sum_entry->version = 0;
			sum_entry->ofs_in_node = 0;
			sum_entry++;
			f2fs_put_page(page, 1);
1813
		}
1814

1815
		invalidate_mapping_pages(META_MAPPING(sbi), addr,
1816
							addr + nrpages);
J
Jaegeuk Kim 已提交
1817
	}
1818
	return 0;
J
Jaegeuk Kim 已提交
1819 1820
}

1821
static void remove_nats_in_journal(struct f2fs_sb_info *sbi)
J
Jaegeuk Kim 已提交
1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
	struct f2fs_summary_block *sum = curseg->sum_blk;
	int i;

	mutex_lock(&curseg->curseg_mutex);
	for (i = 0; i < nats_in_cursum(sum); i++) {
		struct nat_entry *ne;
		struct f2fs_nat_entry raw_ne;
		nid_t nid = le32_to_cpu(nid_in_journal(sum, i));

		raw_ne = nat_in_journal(sum, i);
1835

1836
		down_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
1837 1838
		ne = __lookup_nat_cache(nm_i, nid);
		if (!ne) {
1839 1840
			ne = grab_nat_entry(nm_i, nid);
			node_info_from_raw_nat(&ne->ni, &raw_ne);
J
Jaegeuk Kim 已提交
1841 1842
		}
		__set_nat_cache_dirty(nm_i, ne);
1843
		up_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
1844 1845 1846 1847 1848
	}
	update_nats_in_cursum(sum, -i);
	mutex_unlock(&curseg->curseg_mutex);
}

1849 1850
static void __adjust_nat_entry_set(struct nat_entry_set *nes,
						struct list_head *head, int max)
J
Jaegeuk Kim 已提交
1851
{
1852
	struct nat_entry_set *cur;
J
Jaegeuk Kim 已提交
1853

1854 1855
	if (nes->entry_cnt >= max)
		goto add_out;
J
Jaegeuk Kim 已提交
1856

1857 1858 1859 1860 1861
	list_for_each_entry(cur, head, set_list) {
		if (cur->entry_cnt >= nes->entry_cnt) {
			list_add(&nes->set_list, cur->set_list.prev);
			return;
		}
1862
	}
1863 1864 1865
add_out:
	list_add_tail(&nes->set_list, head);
}
J
Jaegeuk Kim 已提交
1866

1867 1868 1869 1870 1871 1872 1873 1874 1875 1876
static void __flush_nat_entry_set(struct f2fs_sb_info *sbi,
					struct nat_entry_set *set)
{
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
	struct f2fs_summary_block *sum = curseg->sum_blk;
	nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK;
	bool to_journal = true;
	struct f2fs_nat_block *nat_blk;
	struct nat_entry *ne, *cur;
	struct page *page = NULL;
1877
	struct f2fs_nm_info *nm_i = NM_I(sbi);
J
Jaegeuk Kim 已提交
1878

1879 1880 1881 1882 1883
	/*
	 * there are two steps to flush nat entries:
	 * #1, flush nat entries to journal in current hot data summary block.
	 * #2, flush nat entries to nat page.
	 */
1884 1885 1886 1887 1888 1889 1890 1891 1892 1893
	if (!__has_cursum_space(sum, set->entry_cnt, NAT_JOURNAL))
		to_journal = false;

	if (to_journal) {
		mutex_lock(&curseg->curseg_mutex);
	} else {
		page = get_next_nat_page(sbi, start_nid);
		nat_blk = page_address(page);
		f2fs_bug_on(sbi, !nat_blk);
	}
1894

1895 1896 1897 1898 1899 1900 1901 1902
	/* flush dirty nats in nat entry set */
	list_for_each_entry_safe(ne, cur, &set->entry_list, list) {
		struct f2fs_nat_entry *raw_ne;
		nid_t nid = nat_get_nid(ne);
		int offset;

		if (nat_get_blkaddr(ne) == NEW_ADDR)
			continue;
1903 1904

		if (to_journal) {
1905 1906 1907 1908 1909
			offset = lookup_journal_in_cursum(sum,
							NAT_JOURNAL, nid, 1);
			f2fs_bug_on(sbi, offset < 0);
			raw_ne = &nat_in_journal(sum, offset);
			nid_in_journal(sum, offset) = cpu_to_le32(nid);
1910
		} else {
1911
			raw_ne = &nat_blk->entries[nid - start_nid];
J
Jaegeuk Kim 已提交
1912
		}
1913
		raw_nat_from_node_info(raw_ne, &ne->ni);
J
Jaegeuk Kim 已提交
1914

1915
		down_write(&NM_I(sbi)->nat_tree_lock);
1916 1917
		nat_reset_flag(ne);
		__clear_nat_cache_dirty(NM_I(sbi), ne);
1918
		up_write(&NM_I(sbi)->nat_tree_lock);
1919

1920 1921 1922
		if (nat_get_blkaddr(ne) == NULL_ADDR)
			add_free_nid(sbi, nid, false);
	}
J
Jaegeuk Kim 已提交
1923

1924 1925 1926 1927
	if (to_journal)
		mutex_unlock(&curseg->curseg_mutex);
	else
		f2fs_put_page(page, 1);
1928

1929 1930
	f2fs_bug_on(sbi, set->entry_cnt);

1931
	down_write(&nm_i->nat_tree_lock);
1932
	radix_tree_delete(&NM_I(sbi)->nat_set_root, set->set);
1933
	up_write(&nm_i->nat_tree_lock);
1934
	kmem_cache_free(nat_entry_set_slab, set);
1935
}
1936

1937 1938 1939 1940 1941 1942 1943 1944
/*
 * This function is called during the checkpointing process.
 */
void flush_nat_entries(struct f2fs_sb_info *sbi)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
	struct f2fs_summary_block *sum = curseg->sum_blk;
1945
	struct nat_entry_set *setvec[SETVEC_SIZE];
1946 1947 1948 1949 1950
	struct nat_entry_set *set, *tmp;
	unsigned int found;
	nid_t set_idx = 0;
	LIST_HEAD(sets);

1951 1952
	if (!nm_i->dirty_nat_cnt)
		return;
1953 1954 1955 1956 1957 1958 1959 1960
	/*
	 * if there are no enough space in journal to store dirty nat
	 * entries, remove all entries from journal and merge them
	 * into nat entry set.
	 */
	if (!__has_cursum_space(sum, nm_i->dirty_nat_cnt, NAT_JOURNAL))
		remove_nats_in_journal(sbi);

1961
	down_write(&nm_i->nat_tree_lock);
1962
	while ((found = __gang_lookup_nat_set(nm_i,
1963
					set_idx, SETVEC_SIZE, setvec))) {
1964 1965 1966 1967 1968
		unsigned idx;
		set_idx = setvec[found - 1]->set + 1;
		for (idx = 0; idx < found; idx++)
			__adjust_nat_entry_set(setvec[idx], &sets,
							MAX_NAT_JENTRIES(sum));
J
Jaegeuk Kim 已提交
1969
	}
1970
	up_write(&nm_i->nat_tree_lock);
1971

1972 1973 1974 1975
	/* flush dirty nats in nat entry set */
	list_for_each_entry_safe(set, tmp, &sets, set_list)
		__flush_nat_entry_set(sbi, set);

1976
	f2fs_bug_on(sbi, nm_i->dirty_nat_cnt);
J
Jaegeuk Kim 已提交
1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990
}

static int init_node_manager(struct f2fs_sb_info *sbi)
{
	struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi);
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	unsigned char *version_bitmap;
	unsigned int nat_segs, nat_blocks;

	nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr);

	/* segment_count_nat includes pair segment so divide to 2. */
	nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1;
	nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg);
1991

1992 1993
	nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks;

1994
	/* not used nids: 0, node, meta, (and root counted as valid node) */
1995
	nm_i->available_nids = nm_i->max_nid - F2FS_RESERVED_NODE_NUM;
J
Jaegeuk Kim 已提交
1996 1997
	nm_i->fcnt = 0;
	nm_i->nat_cnt = 0;
1998
	nm_i->ram_thresh = DEF_RAM_THRESHOLD;
J
Jaegeuk Kim 已提交
1999

2000
	INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC);
J
Jaegeuk Kim 已提交
2001
	INIT_LIST_HEAD(&nm_i->free_nid_list);
2002 2003
	INIT_RADIX_TREE(&nm_i->nat_root, GFP_NOIO);
	INIT_RADIX_TREE(&nm_i->nat_set_root, GFP_NOIO);
J
Jaegeuk Kim 已提交
2004 2005 2006 2007
	INIT_LIST_HEAD(&nm_i->nat_entries);

	mutex_init(&nm_i->build_lock);
	spin_lock_init(&nm_i->free_nid_list_lock);
2008
	init_rwsem(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
2009 2010

	nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid);
A
Alexandru Gheorghiu 已提交
2011
	nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP);
J
Jaegeuk Kim 已提交
2012 2013 2014 2015
	version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP);
	if (!version_bitmap)
		return -EFAULT;

A
Alexandru Gheorghiu 已提交
2016 2017 2018 2019
	nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size,
					GFP_KERNEL);
	if (!nm_i->nat_bitmap)
		return -ENOMEM;
J
Jaegeuk Kim 已提交
2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043
	return 0;
}

int build_node_manager(struct f2fs_sb_info *sbi)
{
	int err;

	sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL);
	if (!sbi->nm_info)
		return -ENOMEM;

	err = init_node_manager(sbi);
	if (err)
		return err;

	build_free_nids(sbi);
	return 0;
}

void destroy_node_manager(struct f2fs_sb_info *sbi)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *i, *next_i;
	struct nat_entry *natvec[NATVEC_SIZE];
2044
	struct nat_entry_set *setvec[SETVEC_SIZE];
J
Jaegeuk Kim 已提交
2045 2046 2047 2048 2049 2050 2051 2052 2053
	nid_t nid = 0;
	unsigned int found;

	if (!nm_i)
		return;

	/* destroy free nid list */
	spin_lock(&nm_i->free_nid_list_lock);
	list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) {
2054
		f2fs_bug_on(sbi, i->state == NID_ALLOC);
2055
		__del_from_free_nid_list(nm_i, i);
J
Jaegeuk Kim 已提交
2056
		nm_i->fcnt--;
2057 2058 2059
		spin_unlock(&nm_i->free_nid_list_lock);
		kmem_cache_free(free_nid_slab, i);
		spin_lock(&nm_i->free_nid_list_lock);
J
Jaegeuk Kim 已提交
2060
	}
2061
	f2fs_bug_on(sbi, nm_i->fcnt);
J
Jaegeuk Kim 已提交
2062 2063 2064
	spin_unlock(&nm_i->free_nid_list_lock);

	/* destroy nat cache */
2065
	down_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
2066 2067 2068
	while ((found = __gang_lookup_nat_cache(nm_i,
					nid, NATVEC_SIZE, natvec))) {
		unsigned idx;
2069

2070 2071 2072
		nid = nat_get_nid(natvec[found - 1]) + 1;
		for (idx = 0; idx < found; idx++)
			__del_from_nat_cache(nm_i, natvec[idx]);
J
Jaegeuk Kim 已提交
2073
	}
2074
	f2fs_bug_on(sbi, nm_i->nat_cnt);
2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089

	/* destroy nat set cache */
	nid = 0;
	while ((found = __gang_lookup_nat_set(nm_i,
					nid, SETVEC_SIZE, setvec))) {
		unsigned idx;

		nid = setvec[found - 1]->set + 1;
		for (idx = 0; idx < found; idx++) {
			/* entry_cnt is not zero, when cp_error was occurred */
			f2fs_bug_on(sbi, !list_empty(&setvec[idx]->entry_list));
			radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set);
			kmem_cache_free(nat_entry_set_slab, setvec[idx]);
		}
	}
2090
	up_write(&nm_i->nat_tree_lock);
J
Jaegeuk Kim 已提交
2091 2092 2093 2094 2095 2096

	kfree(nm_i->nat_bitmap);
	sbi->nm_info = NULL;
	kfree(nm_i);
}

2097
int __init create_node_manager_caches(void)
J
Jaegeuk Kim 已提交
2098 2099
{
	nat_entry_slab = f2fs_kmem_cache_create("nat_entry",
2100
			sizeof(struct nat_entry));
J
Jaegeuk Kim 已提交
2101
	if (!nat_entry_slab)
2102
		goto fail;
J
Jaegeuk Kim 已提交
2103 2104

	free_nid_slab = f2fs_kmem_cache_create("free_nid",
2105
			sizeof(struct free_nid));
2106
	if (!free_nid_slab)
2107
		goto destroy_nat_entry;
2108 2109 2110 2111

	nat_entry_set_slab = f2fs_kmem_cache_create("nat_entry_set",
			sizeof(struct nat_entry_set));
	if (!nat_entry_set_slab)
2112
		goto destroy_free_nid;
J
Jaegeuk Kim 已提交
2113
	return 0;
2114

2115
destroy_free_nid:
2116
	kmem_cache_destroy(free_nid_slab);
2117
destroy_nat_entry:
2118 2119 2120
	kmem_cache_destroy(nat_entry_slab);
fail:
	return -ENOMEM;
J
Jaegeuk Kim 已提交
2121 2122 2123 2124
}

void destroy_node_manager_caches(void)
{
2125
	kmem_cache_destroy(nat_entry_set_slab);
J
Jaegeuk Kim 已提交
2126 2127 2128
	kmem_cache_destroy(free_nid_slab);
	kmem_cache_destroy(nat_entry_slab);
}