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