f2fs: update inode page after creation
[linux-block.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{
43 struct f2fs_node *raw_node = (struct f2fs_node *)kmap(ipage);
44 struct f2fs_inode *raw_inode = &(raw_node->i);
74d0b917 45 nid_t pino = le32_to_cpu(raw_inode->i_pino);
b7f7a5e0 46 struct qstr name;
d624c96f
JK
47 struct f2fs_dir_entry *de;
48 struct page *page;
49 struct inode *dir;
50 int err = 0;
51
52 if (!is_dent_dnode(ipage))
53 goto out;
54
74d0b917
JK
55 dir = check_dirty_dir_inode(F2FS_SB(inode->i_sb), pino);
56 if (!dir) {
57 dir = f2fs_iget(inode->i_sb, pino);
58 if (IS_ERR(dir)) {
59 err = PTR_ERR(dir);
60 goto out;
61 }
62 set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
d624c96f
JK
63 }
64
b7f7a5e0
AV
65 name.len = le32_to_cpu(raw_inode->i_namelen);
66 name.name = raw_inode->i_name;
d624c96f 67
b7f7a5e0 68 de = f2fs_find_entry(dir, &name, &page);
d624c96f
JK
69 if (de) {
70 kunmap(page);
71 f2fs_put_page(page, 0);
72 } else {
90b2fc64 73 err = __f2fs_add_link(dir, &name, inode);
d624c96f 74 }
d624c96f
JK
75out:
76 kunmap(ipage);
77 return err;
78}
79
80static int recover_inode(struct inode *inode, struct page *node_page)
81{
82 void *kaddr = page_address(node_page);
83 struct f2fs_node *raw_node = (struct f2fs_node *)kaddr;
84 struct f2fs_inode *raw_inode = &(raw_node->i);
85
25ca923b 86 inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f
JK
87 i_size_write(inode, le64_to_cpu(raw_inode->i_size));
88 inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
89 inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
90 inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
91 inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
92 inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
93 inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
94
95 return recover_dentry(node_page, inode);
96}
97
98static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
99{
100 unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
101 struct curseg_info *curseg;
102 struct page *page;
103 block_t blkaddr;
104 int err = 0;
105
106 /* get node pages in the current segment */
107 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
108 blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;
109
110 /* read node page */
111 page = alloc_page(GFP_F2FS_ZERO);
112 if (IS_ERR(page))
113 return PTR_ERR(page);
114 lock_page(page);
115
116 while (1) {
117 struct fsync_inode_entry *entry;
118
393ff91f
JK
119 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
120 if (err)
d624c96f
JK
121 goto out;
122
393ff91f
JK
123 lock_page(page);
124
6ead1142 125 if (cp_ver != cpver_of_node(page))
393ff91f 126 goto unlock_out;
d624c96f
JK
127
128 if (!is_fsync_dnode(page))
129 goto next;
130
131 entry = get_fsync_inode(head, ino_of_node(page));
132 if (entry) {
d624c96f
JK
133 if (IS_INODE(page) && is_dent_dnode(page))
134 set_inode_flag(F2FS_I(entry->inode),
135 FI_INC_LINK);
136 } else {
137 if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142
JK
138 err = recover_inode_page(sbi, page);
139 if (err)
393ff91f 140 goto unlock_out;
d624c96f
JK
141 }
142
143 /* add this fsync inode to the list */
144 entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
145 if (!entry) {
146 err = -ENOMEM;
393ff91f 147 goto unlock_out;
d624c96f
JK
148 }
149
d624c96f
JK
150 entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
151 if (IS_ERR(entry->inode)) {
152 err = PTR_ERR(entry->inode);
fd8bb65f 153 kmem_cache_free(fsync_entry_slab, entry);
393ff91f 154 goto unlock_out;
d624c96f 155 }
fd8bb65f 156 list_add_tail(&entry->list, head);
d624c96f 157 }
addbe45b
JK
158 entry->blkaddr = blkaddr;
159
d624c96f
JK
160 if (IS_INODE(page)) {
161 err = recover_inode(entry->inode, page);
047184b4
CF
162 if (err == -ENOENT) {
163 goto next;
164 } else if (err) {
165 err = -EINVAL;
393ff91f 166 goto unlock_out;
047184b4 167 }
d624c96f
JK
168 }
169next:
170 /* check next segment */
171 blkaddr = next_blkaddr_of_node(page);
d624c96f 172 }
393ff91f 173unlock_out:
d624c96f 174 unlock_page(page);
393ff91f 175out:
d624c96f
JK
176 __free_pages(page, 0);
177 return err;
178}
179
180static void destroy_fsync_dnodes(struct f2fs_sb_info *sbi,
181 struct list_head *head)
182{
d8b79b2f
DC
183 struct fsync_inode_entry *entry, *tmp;
184
185 list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f
JK
186 iput(entry->inode);
187 list_del(&entry->list);
188 kmem_cache_free(fsync_entry_slab, entry);
189 }
190}
191
192static void check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
193 block_t blkaddr)
194{
195 struct seg_entry *sentry;
196 unsigned int segno = GET_SEGNO(sbi, blkaddr);
197 unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
198 (sbi->blocks_per_seg - 1);
199 struct f2fs_summary sum;
200 nid_t ino;
201 void *kaddr;
202 struct inode *inode;
203 struct page *node_page;
204 block_t bidx;
205 int i;
206
207 sentry = get_seg_entry(sbi, segno);
208 if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
209 return;
210
211 /* Get the previous summary */
212 for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
213 struct curseg_info *curseg = CURSEG_I(sbi, i);
214 if (curseg->segno == segno) {
215 sum = curseg->sum_blk->entries[blkoff];
216 break;
217 }
218 }
219 if (i > CURSEG_COLD_DATA) {
220 struct page *sum_page = get_sum_page(sbi, segno);
221 struct f2fs_summary_block *sum_node;
222 kaddr = page_address(sum_page);
223 sum_node = (struct f2fs_summary_block *)kaddr;
224 sum = sum_node->entries[blkoff];
225 f2fs_put_page(sum_page, 1);
226 }
227
228 /* Get the node page */
229 node_page = get_node_page(sbi, le32_to_cpu(sum.nid));
230 bidx = start_bidx_of_node(ofs_of_node(node_page)) +
231 le16_to_cpu(sum.ofs_in_node);
232 ino = ino_of_node(node_page);
233 f2fs_put_page(node_page, 1);
234
235 /* Deallocate previous index in the node page */
d4686d56 236 inode = f2fs_iget(sbi->sb, ino);
06025f4d
NJ
237 if (IS_ERR(inode))
238 return;
239
d624c96f
JK
240 truncate_hole(inode, bidx, bidx + 1);
241 iput(inode);
242}
243
6ead1142 244static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
d624c96f
JK
245 struct page *page, block_t blkaddr)
246{
247 unsigned int start, end;
248 struct dnode_of_data dn;
249 struct f2fs_summary sum;
250 struct node_info ni;
6ead1142 251 int err = 0;
39936837 252 int ilock;
d624c96f
JK
253
254 start = start_bidx_of_node(ofs_of_node(page));
255 if (IS_INODE(page))
256 end = start + ADDRS_PER_INODE;
257 else
258 end = start + ADDRS_PER_BLOCK;
259
39936837 260 ilock = mutex_lock_op(sbi);
d624c96f 261 set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837 262
6ead1142 263 err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837
JK
264 if (err) {
265 mutex_unlock_op(sbi, ilock);
6ead1142 266 return err;
39936837 267 }
d624c96f
JK
268
269 wait_on_page_writeback(dn.node_page);
270
271 get_node_info(sbi, dn.nid, &ni);
272 BUG_ON(ni.ino != ino_of_node(page));
273 BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));
274
275 for (; start < end; start++) {
276 block_t src, dest;
277
278 src = datablock_addr(dn.node_page, dn.ofs_in_node);
279 dest = datablock_addr(page, dn.ofs_in_node);
280
281 if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
282 if (src == NULL_ADDR) {
283 int err = reserve_new_block(&dn);
284 /* We should not get -ENOSPC */
285 BUG_ON(err);
286 }
287
288 /* Check the previous node page having this index */
289 check_index_in_prev_nodes(sbi, dest);
290
291 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
292
293 /* write dummy data page */
294 recover_data_page(sbi, NULL, &sum, src, dest);
295 update_extent_cache(dest, &dn);
296 }
297 dn.ofs_in_node++;
298 }
299
300 /* write node page in place */
301 set_summary(&sum, dn.nid, 0, 0);
302 if (IS_INODE(dn.node_page))
303 sync_inode_page(&dn);
304
305 copy_node_footer(dn.node_page, page);
306 fill_node_footer(dn.node_page, dn.nid, ni.ino,
307 ofs_of_node(page), false);
308 set_page_dirty(dn.node_page);
309
310 recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
311 f2fs_put_dnode(&dn);
39936837 312 mutex_unlock_op(sbi, ilock);
6ead1142 313 return 0;
d624c96f
JK
314}
315
6ead1142 316static int recover_data(struct f2fs_sb_info *sbi,
d624c96f
JK
317 struct list_head *head, int type)
318{
319 unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
320 struct curseg_info *curseg;
321 struct page *page;
6ead1142 322 int err = 0;
d624c96f
JK
323 block_t blkaddr;
324
325 /* get node pages in the current segment */
326 curseg = CURSEG_I(sbi, type);
327 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
328
329 /* read node page */
330 page = alloc_page(GFP_NOFS | __GFP_ZERO);
331 if (IS_ERR(page))
6ead1142
JK
332 return -ENOMEM;
333
d624c96f
JK
334 lock_page(page);
335
336 while (1) {
337 struct fsync_inode_entry *entry;
338
6ead1142
JK
339 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
340 if (err)
d624c96f
JK
341 goto out;
342
393ff91f
JK
343 lock_page(page);
344
d624c96f 345 if (cp_ver != cpver_of_node(page))
393ff91f 346 goto unlock_out;
d624c96f
JK
347
348 entry = get_fsync_inode(head, ino_of_node(page));
349 if (!entry)
350 goto next;
351
6ead1142
JK
352 err = do_recover_data(sbi, entry->inode, page, blkaddr);
353 if (err)
354 goto out;
d624c96f
JK
355
356 if (entry->blkaddr == blkaddr) {
357 iput(entry->inode);
358 list_del(&entry->list);
359 kmem_cache_free(fsync_entry_slab, entry);
360 }
361next:
362 /* check next segment */
363 blkaddr = next_blkaddr_of_node(page);
d624c96f 364 }
393ff91f 365unlock_out:
d624c96f 366 unlock_page(page);
393ff91f 367out:
d624c96f
JK
368 __free_pages(page, 0);
369
6ead1142
JK
370 if (!err)
371 allocate_new_segments(sbi);
372 return err;
d624c96f
JK
373}
374
6ead1142 375int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f
JK
376{
377 struct list_head inode_list;
6ead1142 378 int err;
d624c96f
JK
379
380 fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
381 sizeof(struct fsync_inode_entry), NULL);
382 if (unlikely(!fsync_entry_slab))
6ead1142 383 return -ENOMEM;
d624c96f
JK
384
385 INIT_LIST_HEAD(&inode_list);
386
387 /* step #1: find fsynced inode numbers */
8c26d7d5 388 sbi->por_doing = 1;
6ead1142
JK
389 err = find_fsync_dnodes(sbi, &inode_list);
390 if (err)
d624c96f
JK
391 goto out;
392
393 if (list_empty(&inode_list))
394 goto out;
395
396 /* step #2: recover data */
6ead1142 397 err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
d624c96f
JK
398 BUG_ON(!list_empty(&inode_list));
399out:
400 destroy_fsync_dnodes(sbi, &inode_list);
401 kmem_cache_destroy(fsync_entry_slab);
8c26d7d5 402 sbi->por_doing = 0;
43727527 403 write_checkpoint(sbi, false);
6ead1142 404 return err;
d624c96f 405}