f2fs: fix dentry recovery routine
[deliverable/linux.git] / fs / f2fs / recovery.c
CommitLineData
0a8165d7 1/*
d624c96f
JK
2 * fs/f2fs/recovery.c
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 */
11#include <linux/fs.h>
12#include <linux/f2fs_fs.h>
13#include "f2fs.h"
14#include "node.h"
15#include "segment.h"
16
17static struct kmem_cache *fsync_entry_slab;
18
19bool space_for_roll_forward(struct f2fs_sb_info *sbi)
20{
21 if (sbi->last_valid_block_count + sbi->alloc_valid_block_count
22 > sbi->user_block_count)
23 return false;
24 return true;
25}
26
27static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
28 nid_t ino)
29{
30 struct list_head *this;
31 struct fsync_inode_entry *entry;
32
33 list_for_each(this, head) {
34 entry = list_entry(this, struct fsync_inode_entry, list);
35 if (entry->inode->i_ino == ino)
36 return entry;
37 }
38 return NULL;
39}
40
41static int recover_dentry(struct page *ipage, struct inode *inode)
42{
9a55ed65
JK
43 void *kaddr = page_address(ipage);
44 struct f2fs_node *raw_node = (struct f2fs_node *)kaddr;
d624c96f 45 struct f2fs_inode *raw_inode = &(raw_node->i);
74d0b917 46 nid_t pino = le32_to_cpu(raw_inode->i_pino);
6b8213d9 47 struct f2fs_dir_entry *de;
b7f7a5e0 48 struct qstr name;
d624c96f 49 struct page *page;
6b8213d9 50 struct inode *dir, *einode;
d624c96f
JK
51 int err = 0;
52
74d0b917
JK
53 dir = check_dirty_dir_inode(F2FS_SB(inode->i_sb), pino);
54 if (!dir) {
55 dir = f2fs_iget(inode->i_sb, pino);
56 if (IS_ERR(dir)) {
57 err = PTR_ERR(dir);
58 goto out;
59 }
60 set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
d624c96f
JK
61 }
62
b7f7a5e0
AV
63 name.len = le32_to_cpu(raw_inode->i_namelen);
64 name.name = raw_inode->i_name;
6b8213d9
JK
65retry:
66 de = f2fs_find_entry(dir, &name, &page);
67 if (de && inode->i_ino == le32_to_cpu(de->ino)) {
d624c96f
JK
68 kunmap(page);
69 f2fs_put_page(page, 0);
6b8213d9
JK
70 goto out;
71 }
72 if (de) {
73 einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
74 if (IS_ERR(einode)) {
75 WARN_ON(1);
76 if (PTR_ERR(einode) == -ENOENT)
77 err = -EEXIST;
78 goto out;
79 }
80 f2fs_delete_entry(de, page, einode);
81 iput(einode);
82 goto retry;
d624c96f 83 }
6b8213d9 84 err = __f2fs_add_link(dir, &name, inode);
d624c96f 85out:
f356fe0c
JK
86 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode and its dentry: "
87 "ino = %x, name = %s, dir = %lx, err = %d",
f28c06fa
DC
88 ino_of_node(ipage), raw_inode->i_name,
89 IS_ERR(dir) ? 0 : dir->i_ino, err);
d624c96f
JK
90 return err;
91}
92
93static int recover_inode(struct inode *inode, struct page *node_page)
94{
95 void *kaddr = page_address(node_page);
96 struct f2fs_node *raw_node = (struct f2fs_node *)kaddr;
97 struct f2fs_inode *raw_inode = &(raw_node->i);
98
f356fe0c
JK
99 if (!IS_INODE(node_page))
100 return 0;
101
25ca923b 102 inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f
JK
103 i_size_write(inode, le64_to_cpu(raw_inode->i_size));
104 inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
105 inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
106 inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
107 inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
108 inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
109 inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
110
f356fe0c
JK
111 if (is_dent_dnode(node_page))
112 return recover_dentry(node_page, inode);
113
114 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
115 ino_of_node(node_page), raw_inode->i_name);
116 return 0;
d624c96f
JK
117}
118
119static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
120{
121 unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
122 struct curseg_info *curseg;
123 struct page *page;
124 block_t blkaddr;
125 int err = 0;
126
127 /* get node pages in the current segment */
128 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
129 blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;
130
131 /* read node page */
132 page = alloc_page(GFP_F2FS_ZERO);
133 if (IS_ERR(page))
134 return PTR_ERR(page);
135 lock_page(page);
136
137 while (1) {
138 struct fsync_inode_entry *entry;
139
393ff91f
JK
140 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
141 if (err)
d624c96f
JK
142 goto out;
143
393ff91f
JK
144 lock_page(page);
145
6ead1142 146 if (cp_ver != cpver_of_node(page))
f356fe0c 147 break;
d624c96f
JK
148
149 if (!is_fsync_dnode(page))
150 goto next;
151
152 entry = get_fsync_inode(head, ino_of_node(page));
153 if (entry) {
d624c96f
JK
154 if (IS_INODE(page) && is_dent_dnode(page))
155 set_inode_flag(F2FS_I(entry->inode),
156 FI_INC_LINK);
157 } else {
158 if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142
JK
159 err = recover_inode_page(sbi, page);
160 if (err)
f356fe0c 161 break;
d624c96f
JK
162 }
163
164 /* add this fsync inode to the list */
165 entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
166 if (!entry) {
167 err = -ENOMEM;
f356fe0c 168 break;
d624c96f
JK
169 }
170
d624c96f
JK
171 entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
172 if (IS_ERR(entry->inode)) {
173 err = PTR_ERR(entry->inode);
fd8bb65f 174 kmem_cache_free(fsync_entry_slab, entry);
f356fe0c 175 break;
d624c96f 176 }
fd8bb65f 177 list_add_tail(&entry->list, head);
d624c96f 178 }
addbe45b
JK
179 entry->blkaddr = blkaddr;
180
f356fe0c
JK
181 err = recover_inode(entry->inode, page);
182 if (err && err != -ENOENT)
183 break;
d624c96f
JK
184next:
185 /* check next segment */
186 blkaddr = next_blkaddr_of_node(page);
d624c96f 187 }
d624c96f 188 unlock_page(page);
393ff91f 189out:
d624c96f
JK
190 __free_pages(page, 0);
191 return err;
192}
193
194static void destroy_fsync_dnodes(struct f2fs_sb_info *sbi,
195 struct list_head *head)
196{
d8b79b2f
DC
197 struct fsync_inode_entry *entry, *tmp;
198
199 list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f
JK
200 iput(entry->inode);
201 list_del(&entry->list);
202 kmem_cache_free(fsync_entry_slab, entry);
203 }
204}
205
39cf72cf 206static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
b292dcab 207 block_t blkaddr, struct dnode_of_data *dn)
d624c96f
JK
208{
209 struct seg_entry *sentry;
210 unsigned int segno = GET_SEGNO(sbi, blkaddr);
211 unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
212 (sbi->blocks_per_seg - 1);
213 struct f2fs_summary sum;
b292dcab 214 nid_t ino, nid;
d624c96f
JK
215 void *kaddr;
216 struct inode *inode;
217 struct page *node_page;
218 block_t bidx;
219 int i;
220
221 sentry = get_seg_entry(sbi, segno);
222 if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
39cf72cf 223 return 0;
d624c96f
JK
224
225 /* Get the previous summary */
226 for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
227 struct curseg_info *curseg = CURSEG_I(sbi, i);
228 if (curseg->segno == segno) {
229 sum = curseg->sum_blk->entries[blkoff];
230 break;
231 }
232 }
233 if (i > CURSEG_COLD_DATA) {
234 struct page *sum_page = get_sum_page(sbi, segno);
235 struct f2fs_summary_block *sum_node;
236 kaddr = page_address(sum_page);
237 sum_node = (struct f2fs_summary_block *)kaddr;
238 sum = sum_node->entries[blkoff];
239 f2fs_put_page(sum_page, 1);
240 }
241
b292dcab
JK
242 /* Use the locked dnode page and inode */
243 nid = le32_to_cpu(sum.nid);
244 if (dn->inode->i_ino == nid) {
245 struct dnode_of_data tdn = *dn;
246 tdn.nid = nid;
247 tdn.node_page = dn->inode_page;
248 tdn.ofs_in_node = sum.ofs_in_node;
249 truncate_data_blocks_range(&tdn, 1);
39cf72cf 250 return 0;
b292dcab
JK
251 } else if (dn->nid == nid) {
252 struct dnode_of_data tdn = *dn;
253 tdn.ofs_in_node = sum.ofs_in_node;
254 truncate_data_blocks_range(&tdn, 1);
39cf72cf 255 return 0;
b292dcab
JK
256 }
257
d624c96f 258 /* Get the node page */
b292dcab 259 node_page = get_node_page(sbi, nid);
39cf72cf
JK
260 if (IS_ERR(node_page))
261 return PTR_ERR(node_page);
d624c96f 262 bidx = start_bidx_of_node(ofs_of_node(node_page)) +
b292dcab 263 le16_to_cpu(sum.ofs_in_node);
d624c96f
JK
264 ino = ino_of_node(node_page);
265 f2fs_put_page(node_page, 1);
266
267 /* Deallocate previous index in the node page */
d4686d56 268 inode = f2fs_iget(sbi->sb, ino);
06025f4d 269 if (IS_ERR(inode))
39cf72cf 270 return PTR_ERR(inode);
06025f4d 271
d624c96f
JK
272 truncate_hole(inode, bidx, bidx + 1);
273 iput(inode);
39cf72cf 274 return 0;
d624c96f
JK
275}
276
6ead1142 277static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
d624c96f
JK
278 struct page *page, block_t blkaddr)
279{
280 unsigned int start, end;
281 struct dnode_of_data dn;
282 struct f2fs_summary sum;
283 struct node_info ni;
f356fe0c 284 int err = 0, recovered = 0;
39936837 285 int ilock;
d624c96f
JK
286
287 start = start_bidx_of_node(ofs_of_node(page));
288 if (IS_INODE(page))
289 end = start + ADDRS_PER_INODE;
290 else
291 end = start + ADDRS_PER_BLOCK;
292
39936837 293 ilock = mutex_lock_op(sbi);
d624c96f 294 set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837 295
6ead1142 296 err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837
JK
297 if (err) {
298 mutex_unlock_op(sbi, ilock);
6ead1142 299 return err;
39936837 300 }
d624c96f
JK
301
302 wait_on_page_writeback(dn.node_page);
303
304 get_node_info(sbi, dn.nid, &ni);
305 BUG_ON(ni.ino != ino_of_node(page));
306 BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));
307
308 for (; start < end; start++) {
309 block_t src, dest;
310
311 src = datablock_addr(dn.node_page, dn.ofs_in_node);
312 dest = datablock_addr(page, dn.ofs_in_node);
313
314 if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
315 if (src == NULL_ADDR) {
316 int err = reserve_new_block(&dn);
317 /* We should not get -ENOSPC */
318 BUG_ON(err);
319 }
320
321 /* Check the previous node page having this index */
39cf72cf
JK
322 err = check_index_in_prev_nodes(sbi, dest, &dn);
323 if (err)
324 goto err;
d624c96f
JK
325
326 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
327
328 /* write dummy data page */
329 recover_data_page(sbi, NULL, &sum, src, dest);
330 update_extent_cache(dest, &dn);
f356fe0c 331 recovered++;
d624c96f
JK
332 }
333 dn.ofs_in_node++;
334 }
335
336 /* write node page in place */
337 set_summary(&sum, dn.nid, 0, 0);
338 if (IS_INODE(dn.node_page))
339 sync_inode_page(&dn);
340
341 copy_node_footer(dn.node_page, page);
342 fill_node_footer(dn.node_page, dn.nid, ni.ino,
343 ofs_of_node(page), false);
344 set_page_dirty(dn.node_page);
345
346 recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
39cf72cf 347err:
d624c96f 348 f2fs_put_dnode(&dn);
39936837 349 mutex_unlock_op(sbi, ilock);
f356fe0c
JK
350
351 f2fs_msg(sbi->sb, KERN_NOTICE, "recover_data: ino = %lx, "
39cf72cf
JK
352 "recovered_data = %d blocks, err = %d",
353 inode->i_ino, recovered, err);
354 return err;
d624c96f
JK
355}
356
6ead1142 357static int recover_data(struct f2fs_sb_info *sbi,
d624c96f
JK
358 struct list_head *head, int type)
359{
360 unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
361 struct curseg_info *curseg;
362 struct page *page;
6ead1142 363 int err = 0;
d624c96f
JK
364 block_t blkaddr;
365
366 /* get node pages in the current segment */
367 curseg = CURSEG_I(sbi, type);
368 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
369
370 /* read node page */
371 page = alloc_page(GFP_NOFS | __GFP_ZERO);
372 if (IS_ERR(page))
6ead1142
JK
373 return -ENOMEM;
374
d624c96f
JK
375 lock_page(page);
376
377 while (1) {
378 struct fsync_inode_entry *entry;
379
6ead1142
JK
380 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
381 if (err)
d624c96f
JK
382 goto out;
383
393ff91f
JK
384 lock_page(page);
385
d624c96f 386 if (cp_ver != cpver_of_node(page))
45856aff 387 break;
d624c96f
JK
388
389 entry = get_fsync_inode(head, ino_of_node(page));
390 if (!entry)
391 goto next;
392
6ead1142
JK
393 err = do_recover_data(sbi, entry->inode, page, blkaddr);
394 if (err)
45856aff 395 break;
d624c96f
JK
396
397 if (entry->blkaddr == blkaddr) {
398 iput(entry->inode);
399 list_del(&entry->list);
400 kmem_cache_free(fsync_entry_slab, entry);
401 }
402next:
403 /* check next segment */
404 blkaddr = next_blkaddr_of_node(page);
d624c96f 405 }
d624c96f 406 unlock_page(page);
393ff91f 407out:
d624c96f
JK
408 __free_pages(page, 0);
409
6ead1142
JK
410 if (!err)
411 allocate_new_segments(sbi);
412 return err;
d624c96f
JK
413}
414
6ead1142 415int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f
JK
416{
417 struct list_head inode_list;
6ead1142 418 int err;
d624c96f
JK
419
420 fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
421 sizeof(struct fsync_inode_entry), NULL);
422 if (unlikely(!fsync_entry_slab))
6ead1142 423 return -ENOMEM;
d624c96f
JK
424
425 INIT_LIST_HEAD(&inode_list);
426
427 /* step #1: find fsynced inode numbers */
8c26d7d5 428 sbi->por_doing = 1;
6ead1142
JK
429 err = find_fsync_dnodes(sbi, &inode_list);
430 if (err)
d624c96f
JK
431 goto out;
432
433 if (list_empty(&inode_list))
434 goto out;
435
436 /* step #2: recover data */
6ead1142 437 err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
d624c96f
JK
438 BUG_ON(!list_empty(&inode_list));
439out:
440 destroy_fsync_dnodes(sbi, &inode_list);
441 kmem_cache_destroy(fsync_entry_slab);
8c26d7d5 442 sbi->por_doing = 0;
2c2c149f
JK
443 if (!err)
444 write_checkpoint(sbi, false);
6ead1142 445 return err;
d624c96f 446}
This page took 0.058747 seconds and 5 git commands to generate.