recovery.c 11.0 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 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
 * fs/f2fs/recovery.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 "f2fs.h"
#include "node.h"
#include "segment.h"

static struct kmem_cache *fsync_entry_slab;

bool space_for_roll_forward(struct f2fs_sb_info *sbi)
{
	if (sbi->last_valid_block_count + sbi->alloc_valid_block_count
			> sbi->user_block_count)
		return false;
	return true;
}

static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
								nid_t ino)
{
	struct list_head *this;
	struct fsync_inode_entry *entry;

	list_for_each(this, head) {
		entry = list_entry(this, struct fsync_inode_entry, list);
		if (entry->inode->i_ino == ino)
			return entry;
	}
	return NULL;
}

static int recover_dentry(struct page *ipage, struct inode *inode)
{
43
	struct f2fs_node *raw_node = F2FS_NODE(ipage);
44
	struct f2fs_inode *raw_inode = &(raw_node->i);
45
	nid_t pino = le32_to_cpu(raw_inode->i_pino);
J
Jaegeuk Kim 已提交
46
	struct f2fs_dir_entry *de;
47
	struct qstr name;
48
	struct page *page;
J
Jaegeuk Kim 已提交
49
	struct inode *dir, *einode;
50 51
	int err = 0;

52 53 54 55 56 57 58 59
	dir = check_dirty_dir_inode(F2FS_SB(inode->i_sb), pino);
	if (!dir) {
		dir = f2fs_iget(inode->i_sb, pino);
		if (IS_ERR(dir)) {
			err = PTR_ERR(dir);
			goto out;
		}
		set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
60
		add_dirty_dir_inode(dir);
61 62
	}

63 64
	name.len = le32_to_cpu(raw_inode->i_namelen);
	name.name = raw_inode->i_name;
65 66 67 68 69 70

	if (unlikely(name.len > F2FS_NAME_LEN)) {
		WARN_ON(1);
		err = -ENAMETOOLONG;
		goto out;
	}
J
Jaegeuk Kim 已提交
71 72
retry:
	de = f2fs_find_entry(dir, &name, &page);
73 74
	if (de && inode->i_ino == le32_to_cpu(de->ino))
		goto out_unmap_put;
J
Jaegeuk Kim 已提交
75 76 77 78 79 80
	if (de) {
		einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
		if (IS_ERR(einode)) {
			WARN_ON(1);
			if (PTR_ERR(einode) == -ENOENT)
				err = -EEXIST;
81 82 83 84 85 86
			goto out_unmap_put;
		}
		err = acquire_orphan_inode(F2FS_SB(inode->i_sb));
		if (err) {
			iput(einode);
			goto out_unmap_put;
J
Jaegeuk Kim 已提交
87 88 89 90
		}
		f2fs_delete_entry(de, page, einode);
		iput(einode);
		goto retry;
91
	}
J
Jaegeuk Kim 已提交
92
	err = __f2fs_add_link(dir, &name, inode);
93 94 95 96 97
	goto out;

out_unmap_put:
	kunmap(page);
	f2fs_put_page(page, 0);
98
out:
99 100
	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode and its dentry: "
			"ino = %x, name = %s, dir = %lx, err = %d",
D
Dan Carpenter 已提交
101 102
			ino_of_node(ipage), raw_inode->i_name,
			IS_ERR(dir) ? 0 : dir->i_ino, err);
103 104 105 106 107
	return err;
}

static int recover_inode(struct inode *inode, struct page *node_page)
{
108
	struct f2fs_node *raw_node = F2FS_NODE(node_page);
109 110
	struct f2fs_inode *raw_inode = &(raw_node->i);

111 112 113
	if (!IS_INODE(node_page))
		return 0;

114
	inode->i_mode = le16_to_cpu(raw_inode->i_mode);
115 116 117 118 119 120 121 122
	i_size_write(inode, le64_to_cpu(raw_inode->i_size));
	inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
	inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
	inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);

123 124 125 126 127 128
	if (is_dent_dnode(node_page))
		return recover_dentry(node_page, inode);

	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
			ino_of_node(node_page), raw_inode->i_name);
	return 0;
129 130 131 132
}

static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
{
133
	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
134 135 136 137 138 139 140 141 142 143 144
	struct curseg_info *curseg;
	struct page *page;
	block_t blkaddr;
	int err = 0;

	/* get node pages in the current segment */
	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
	blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;

	/* read node page */
	page = alloc_page(GFP_F2FS_ZERO);
145 146
	if (!page)
		return -ENOMEM;
147 148 149 150 151
	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

152
		err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
153
		if (err)
154
			return err;
155

156 157
		lock_page(page);

158
		if (cp_ver != cpver_of_node(page))
159
			break;
160 161 162 163 164 165 166 167 168 169 170

		if (!is_fsync_dnode(page))
			goto next;

		entry = get_fsync_inode(head, ino_of_node(page));
		if (entry) {
			if (IS_INODE(page) && is_dent_dnode(page))
				set_inode_flag(F2FS_I(entry->inode),
							FI_INC_LINK);
		} else {
			if (IS_INODE(page) && is_dent_dnode(page)) {
171 172
				err = recover_inode_page(sbi, page);
				if (err)
173
					break;
174 175 176 177 178 179
			}

			/* add this fsync inode to the list */
			entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
			if (!entry) {
				err = -ENOMEM;
180
				break;
181 182 183 184 185
			}

			entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
			if (IS_ERR(entry->inode)) {
				err = PTR_ERR(entry->inode);
186
				kmem_cache_free(fsync_entry_slab, entry);
187
				break;
188
			}
189
			list_add_tail(&entry->list, head);
190
		}
J
Jaegeuk Kim 已提交
191 192
		entry->blkaddr = blkaddr;

193 194 195
		err = recover_inode(entry->inode, page);
		if (err && err != -ENOENT)
			break;
196 197 198 199
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
	}
200

201 202
	unlock_page(page);
	__free_pages(page, 0);
203

204 205 206
	return err;
}

207
static void destroy_fsync_dnodes(struct list_head *head)
208
{
209 210 211
	struct fsync_inode_entry *entry, *tmp;

	list_for_each_entry_safe(entry, tmp, head, list) {
212 213 214 215 216 217
		iput(entry->inode);
		list_del(&entry->list);
		kmem_cache_free(fsync_entry_slab, entry);
	}
}

218
static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
219
			block_t blkaddr, struct dnode_of_data *dn)
220 221 222 223 224 225
{
	struct seg_entry *sentry;
	unsigned int segno = GET_SEGNO(sbi, blkaddr);
	unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
					(sbi->blocks_per_seg - 1);
	struct f2fs_summary sum;
226
	nid_t ino, nid;
227 228 229
	void *kaddr;
	struct inode *inode;
	struct page *node_page;
230
	unsigned int offset;
231 232 233 234 235
	block_t bidx;
	int i;

	sentry = get_seg_entry(sbi, segno);
	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
236
		return 0;
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254

	/* Get the previous summary */
	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
		struct curseg_info *curseg = CURSEG_I(sbi, i);
		if (curseg->segno == segno) {
			sum = curseg->sum_blk->entries[blkoff];
			break;
		}
	}
	if (i > CURSEG_COLD_DATA) {
		struct page *sum_page = get_sum_page(sbi, segno);
		struct f2fs_summary_block *sum_node;
		kaddr = page_address(sum_page);
		sum_node = (struct f2fs_summary_block *)kaddr;
		sum = sum_node->entries[blkoff];
		f2fs_put_page(sum_page, 1);
	}

255 256 257 258 259 260
	/* Use the locked dnode page and inode */
	nid = le32_to_cpu(sum.nid);
	if (dn->inode->i_ino == nid) {
		struct dnode_of_data tdn = *dn;
		tdn.nid = nid;
		tdn.node_page = dn->inode_page;
261
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
262
		truncate_data_blocks_range(&tdn, 1);
263
		return 0;
264 265
	} else if (dn->nid == nid) {
		struct dnode_of_data tdn = *dn;
266
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
267
		truncate_data_blocks_range(&tdn, 1);
268
		return 0;
269 270
	}

271
	/* Get the node page */
272
	node_page = get_node_page(sbi, nid);
273 274
	if (IS_ERR(node_page))
		return PTR_ERR(node_page);
275 276

	offset = ofs_of_node(node_page);
277 278 279 280
	ino = ino_of_node(node_page);
	f2fs_put_page(node_page, 1);

	/* Deallocate previous index in the node page */
281
	inode = f2fs_iget(sbi->sb, ino);
282
	if (IS_ERR(inode))
283
		return PTR_ERR(inode);
284

285 286 287
	bidx = start_bidx_of_node(offset, F2FS_I(inode)) +
					le16_to_cpu(sum.ofs_in_node);

288 289
	truncate_hole(inode, bidx, bidx + 1);
	iput(inode);
290
	return 0;
291 292
}

293
static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
294 295
					struct page *page, block_t blkaddr)
{
296
	struct f2fs_inode_info *fi = F2FS_I(inode);
297 298 299 300
	unsigned int start, end;
	struct dnode_of_data dn;
	struct f2fs_summary sum;
	struct node_info ni;
301
	int err = 0, recovered = 0;
302

303
	start = start_bidx_of_node(ofs_of_node(page), fi);
304
	if (IS_INODE(page))
305
		end = start + ADDRS_PER_INODE(fi);
306 307 308
	else
		end = start + ADDRS_PER_BLOCK;

309
	f2fs_lock_op(sbi);
310
	set_new_dnode(&dn, inode, NULL, NULL, 0);
311

312
	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
313
	if (err) {
314
		f2fs_unlock_op(sbi);
315
		return err;
316
	}
317 318 319 320

	wait_on_page_writeback(dn.node_page);

	get_node_info(sbi, dn.nid, &ni);
321 322
	f2fs_bug_on(ni.ino != ino_of_node(page));
	f2fs_bug_on(ofs_of_node(dn.node_page) != ofs_of_node(page));
323 324 325 326 327 328 329 330 331

	for (; start < end; start++) {
		block_t src, dest;

		src = datablock_addr(dn.node_page, dn.ofs_in_node);
		dest = datablock_addr(page, dn.ofs_in_node);

		if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
			if (src == NULL_ADDR) {
332
				err = reserve_new_block(&dn);
333
				/* We should not get -ENOSPC */
334
				f2fs_bug_on(err);
335 336 337
			}

			/* Check the previous node page having this index */
338 339 340
			err = check_index_in_prev_nodes(sbi, dest, &dn);
			if (err)
				goto err;
341 342 343 344 345 346

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

			/* write dummy data page */
			recover_data_page(sbi, NULL, &sum, src, dest);
			update_extent_cache(dest, &dn);
347
			recovered++;
348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
		}
		dn.ofs_in_node++;
	}

	/* write node page in place */
	set_summary(&sum, dn.nid, 0, 0);
	if (IS_INODE(dn.node_page))
		sync_inode_page(&dn);

	copy_node_footer(dn.node_page, page);
	fill_node_footer(dn.node_page, dn.nid, ni.ino,
					ofs_of_node(page), false);
	set_page_dirty(dn.node_page);

	recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
363
err:
364
	f2fs_put_dnode(&dn);
365
	f2fs_unlock_op(sbi);
366 367

	f2fs_msg(sbi->sb, KERN_NOTICE, "recover_data: ino = %lx, "
368 369 370
			"recovered_data = %d blocks, err = %d",
			inode->i_ino, recovered, err);
	return err;
371 372
}

373
static int recover_data(struct f2fs_sb_info *sbi,
374 375
				struct list_head *head, int type)
{
376
	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
377 378
	struct curseg_info *curseg;
	struct page *page;
379
	int err = 0;
380 381 382 383 384 385 386
	block_t blkaddr;

	/* get node pages in the current segment */
	curseg = CURSEG_I(sbi, type);
	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);

	/* read node page */
387
	page = alloc_page(GFP_F2FS_ZERO);
388
	if (!page)
389 390
		return -ENOMEM;

391 392 393 394 395
	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

396
		err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
397
		if (err)
398
			return err;
399

400 401
		lock_page(page);

402
		if (cp_ver != cpver_of_node(page))
403
			break;
404 405 406 407 408

		entry = get_fsync_inode(head, ino_of_node(page));
		if (!entry)
			goto next;

409 410
		err = do_recover_data(sbi, entry->inode, page, blkaddr);
		if (err)
411
			break;
412 413 414 415 416 417 418 419 420 421

		if (entry->blkaddr == blkaddr) {
			iput(entry->inode);
			list_del(&entry->list);
			kmem_cache_free(fsync_entry_slab, entry);
		}
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
	}
422

423 424 425
	unlock_page(page);
	__free_pages(page, 0);

426 427 428
	if (!err)
		allocate_new_segments(sbi);
	return err;
429 430
}

431
int recover_fsync_data(struct f2fs_sb_info *sbi)
432 433
{
	struct list_head inode_list;
434
	int err;
H
Haicheng Li 已提交
435
	bool need_writecp = false;
436 437 438

	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
			sizeof(struct fsync_inode_entry), NULL);
439
	if (!fsync_entry_slab)
440
		return -ENOMEM;
441 442 443 444

	INIT_LIST_HEAD(&inode_list);

	/* step #1: find fsynced inode numbers */
H
Haicheng Li 已提交
445
	sbi->por_doing = true;
446 447
	err = find_fsync_dnodes(sbi, &inode_list);
	if (err)
448 449 450 451 452
		goto out;

	if (list_empty(&inode_list))
		goto out;

H
Haicheng Li 已提交
453
	need_writecp = true;
454

455
	/* step #2: recover data */
456
	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
457
	f2fs_bug_on(!list_empty(&inode_list));
458
out:
459
	destroy_fsync_dnodes(&inode_list);
460
	kmem_cache_destroy(fsync_entry_slab);
H
Haicheng Li 已提交
461
	sbi->por_doing = false;
462
	if (!err && need_writecp)
463
		write_checkpoint(sbi, false);
464
	return err;
465
}