]>
git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blob - fs/f2fs/recovery.c
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
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.
12 #include <linux/f2fs_fs.h>
17 static struct kmem_cache
*fsync_entry_slab
;
19 bool space_for_roll_forward(struct f2fs_sb_info
*sbi
)
21 if (sbi
->last_valid_block_count
+ sbi
->alloc_valid_block_count
22 > sbi
->user_block_count
)
27 static struct fsync_inode_entry
*get_fsync_inode(struct list_head
*head
,
30 struct list_head
*this;
31 struct fsync_inode_entry
*entry
;
33 list_for_each(this, head
) {
34 entry
= list_entry(this, struct fsync_inode_entry
, list
);
35 if (entry
->inode
->i_ino
== ino
)
41 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
);
46 struct f2fs_dir_entry
*de
;
49 struct inode
*dir
, *einode
;
52 dir
= check_dirty_dir_inode(F2FS_SB(inode
->i_sb
), pino
);
54 dir
= f2fs_iget(inode
->i_sb
, pino
);
59 set_inode_flag(F2FS_I(dir
), FI_DELAY_IPUT
);
60 add_dirty_dir_inode(dir
);
63 name
.len
= le32_to_cpu(raw_inode
->i_namelen
);
64 name
.name
= raw_inode
->i_name
;
66 de
= f2fs_find_entry(dir
, &name
, &page
);
67 if (de
&& inode
->i_ino
== le32_to_cpu(de
->ino
))
70 einode
= f2fs_iget(inode
->i_sb
, le32_to_cpu(de
->ino
));
73 if (PTR_ERR(einode
) == -ENOENT
)
77 err
= acquire_orphan_inode(F2FS_SB(inode
->i_sb
));
82 f2fs_delete_entry(de
, page
, einode
);
86 err
= __f2fs_add_link(dir
, &name
, inode
);
91 f2fs_put_page(page
, 0);
93 f2fs_msg(inode
->i_sb
, KERN_NOTICE
, "recover_inode and its dentry: "
94 "ino = %x, name = %s, dir = %lx, err = %d",
95 ino_of_node(ipage
), raw_inode
->i_name
,
96 IS_ERR(dir
) ? 0 : dir
->i_ino
, err
);
100 static int recover_inode(struct inode
*inode
, struct page
*node_page
)
102 struct f2fs_node
*raw_node
= F2FS_NODE(node_page
);
103 struct f2fs_inode
*raw_inode
= &(raw_node
->i
);
105 if (!IS_INODE(node_page
))
108 inode
->i_mode
= le16_to_cpu(raw_inode
->i_mode
);
109 i_size_write(inode
, le64_to_cpu(raw_inode
->i_size
));
110 inode
->i_atime
.tv_sec
= le64_to_cpu(raw_inode
->i_mtime
);
111 inode
->i_ctime
.tv_sec
= le64_to_cpu(raw_inode
->i_ctime
);
112 inode
->i_mtime
.tv_sec
= le64_to_cpu(raw_inode
->i_mtime
);
113 inode
->i_atime
.tv_nsec
= le32_to_cpu(raw_inode
->i_mtime_nsec
);
114 inode
->i_ctime
.tv_nsec
= le32_to_cpu(raw_inode
->i_ctime_nsec
);
115 inode
->i_mtime
.tv_nsec
= le32_to_cpu(raw_inode
->i_mtime_nsec
);
117 if (is_dent_dnode(node_page
))
118 return recover_dentry(node_page
, inode
);
120 f2fs_msg(inode
->i_sb
, KERN_NOTICE
, "recover_inode: ino = %x, name = %s",
121 ino_of_node(node_page
), raw_inode
->i_name
);
125 static int find_fsync_dnodes(struct f2fs_sb_info
*sbi
, struct list_head
*head
)
127 unsigned long long cp_ver
= cur_cp_version(F2FS_CKPT(sbi
));
128 struct curseg_info
*curseg
;
133 /* get node pages in the current segment */
134 curseg
= CURSEG_I(sbi
, CURSEG_WARM_NODE
);
135 blkaddr
= START_BLOCK(sbi
, curseg
->segno
) + curseg
->next_blkoff
;
138 page
= alloc_page(GFP_F2FS_ZERO
);
144 struct fsync_inode_entry
*entry
;
146 err
= f2fs_readpage(sbi
, page
, blkaddr
, READ_SYNC
);
152 if (cp_ver
!= cpver_of_node(page
))
155 if (!is_fsync_dnode(page
))
158 entry
= get_fsync_inode(head
, ino_of_node(page
));
160 if (IS_INODE(page
) && is_dent_dnode(page
))
161 set_inode_flag(F2FS_I(entry
->inode
),
164 if (IS_INODE(page
) && is_dent_dnode(page
)) {
165 err
= recover_inode_page(sbi
, page
);
170 /* add this fsync inode to the list */
171 entry
= kmem_cache_alloc(fsync_entry_slab
, GFP_NOFS
);
177 entry
->inode
= f2fs_iget(sbi
->sb
, ino_of_node(page
));
178 if (IS_ERR(entry
->inode
)) {
179 err
= PTR_ERR(entry
->inode
);
180 kmem_cache_free(fsync_entry_slab
, entry
);
183 list_add_tail(&entry
->list
, head
);
185 entry
->blkaddr
= blkaddr
;
187 err
= recover_inode(entry
->inode
, page
);
188 if (err
&& err
!= -ENOENT
)
191 /* check next segment */
192 blkaddr
= next_blkaddr_of_node(page
);
196 __free_pages(page
, 0);
200 static void destroy_fsync_dnodes(struct list_head
*head
)
202 struct fsync_inode_entry
*entry
, *tmp
;
204 list_for_each_entry_safe(entry
, tmp
, head
, list
) {
206 list_del(&entry
->list
);
207 kmem_cache_free(fsync_entry_slab
, entry
);
211 static int check_index_in_prev_nodes(struct f2fs_sb_info
*sbi
,
212 block_t blkaddr
, struct dnode_of_data
*dn
)
214 struct seg_entry
*sentry
;
215 unsigned int segno
= GET_SEGNO(sbi
, blkaddr
);
216 unsigned short blkoff
= GET_SEGOFF_FROM_SEG0(sbi
, blkaddr
) &
217 (sbi
->blocks_per_seg
- 1);
218 struct f2fs_summary sum
;
222 struct page
*node_page
;
227 sentry
= get_seg_entry(sbi
, segno
);
228 if (!f2fs_test_bit(blkoff
, sentry
->cur_valid_map
))
231 /* Get the previous summary */
232 for (i
= CURSEG_WARM_DATA
; i
<= CURSEG_COLD_DATA
; i
++) {
233 struct curseg_info
*curseg
= CURSEG_I(sbi
, i
);
234 if (curseg
->segno
== segno
) {
235 sum
= curseg
->sum_blk
->entries
[blkoff
];
239 if (i
> CURSEG_COLD_DATA
) {
240 struct page
*sum_page
= get_sum_page(sbi
, segno
);
241 struct f2fs_summary_block
*sum_node
;
242 kaddr
= page_address(sum_page
);
243 sum_node
= (struct f2fs_summary_block
*)kaddr
;
244 sum
= sum_node
->entries
[blkoff
];
245 f2fs_put_page(sum_page
, 1);
248 /* Use the locked dnode page and inode */
249 nid
= le32_to_cpu(sum
.nid
);
250 if (dn
->inode
->i_ino
== nid
) {
251 struct dnode_of_data tdn
= *dn
;
253 tdn
.node_page
= dn
->inode_page
;
254 tdn
.ofs_in_node
= le16_to_cpu(sum
.ofs_in_node
);
255 truncate_data_blocks_range(&tdn
, 1);
257 } else if (dn
->nid
== nid
) {
258 struct dnode_of_data tdn
= *dn
;
259 tdn
.ofs_in_node
= le16_to_cpu(sum
.ofs_in_node
);
260 truncate_data_blocks_range(&tdn
, 1);
264 /* Get the node page */
265 node_page
= get_node_page(sbi
, nid
);
266 if (IS_ERR(node_page
))
267 return PTR_ERR(node_page
);
269 offset
= ofs_of_node(node_page
);
270 ino
= ino_of_node(node_page
);
271 f2fs_put_page(node_page
, 1);
273 /* Deallocate previous index in the node page */
274 inode
= f2fs_iget(sbi
->sb
, ino
);
276 return PTR_ERR(inode
);
278 bidx
= start_bidx_of_node(offset
, F2FS_I(inode
)) +
279 le16_to_cpu(sum
.ofs_in_node
);
281 truncate_hole(inode
, bidx
, bidx
+ 1);
286 static int do_recover_data(struct f2fs_sb_info
*sbi
, struct inode
*inode
,
287 struct page
*page
, block_t blkaddr
)
289 struct f2fs_inode_info
*fi
= F2FS_I(inode
);
290 unsigned int start
, end
;
291 struct dnode_of_data dn
;
292 struct f2fs_summary sum
;
294 int err
= 0, recovered
= 0;
296 start
= start_bidx_of_node(ofs_of_node(page
), fi
);
298 end
= start
+ ADDRS_PER_INODE(fi
);
300 end
= start
+ ADDRS_PER_BLOCK
;
303 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
305 err
= get_dnode_of_data(&dn
, start
, ALLOC_NODE
);
311 wait_on_page_writeback(dn
.node_page
);
313 get_node_info(sbi
, dn
.nid
, &ni
);
314 BUG_ON(ni
.ino
!= ino_of_node(page
));
315 BUG_ON(ofs_of_node(dn
.node_page
) != ofs_of_node(page
));
317 for (; start
< end
; start
++) {
320 src
= datablock_addr(dn
.node_page
, dn
.ofs_in_node
);
321 dest
= datablock_addr(page
, dn
.ofs_in_node
);
323 if (src
!= dest
&& dest
!= NEW_ADDR
&& dest
!= NULL_ADDR
) {
324 if (src
== NULL_ADDR
) {
325 int err
= reserve_new_block(&dn
);
326 /* We should not get -ENOSPC */
330 /* Check the previous node page having this index */
331 err
= check_index_in_prev_nodes(sbi
, dest
, &dn
);
335 set_summary(&sum
, dn
.nid
, dn
.ofs_in_node
, ni
.version
);
337 /* write dummy data page */
338 recover_data_page(sbi
, NULL
, &sum
, src
, dest
);
339 update_extent_cache(dest
, &dn
);
345 /* write node page in place */
346 set_summary(&sum
, dn
.nid
, 0, 0);
347 if (IS_INODE(dn
.node_page
))
348 sync_inode_page(&dn
);
350 copy_node_footer(dn
.node_page
, page
);
351 fill_node_footer(dn
.node_page
, dn
.nid
, ni
.ino
,
352 ofs_of_node(page
), false);
353 set_page_dirty(dn
.node_page
);
355 recover_node_page(sbi
, dn
.node_page
, &sum
, &ni
, blkaddr
);
360 f2fs_msg(sbi
->sb
, KERN_NOTICE
, "recover_data: ino = %lx, "
361 "recovered_data = %d blocks, err = %d",
362 inode
->i_ino
, recovered
, err
);
366 static int recover_data(struct f2fs_sb_info
*sbi
,
367 struct list_head
*head
, int type
)
369 unsigned long long cp_ver
= cur_cp_version(F2FS_CKPT(sbi
));
370 struct curseg_info
*curseg
;
375 /* get node pages in the current segment */
376 curseg
= CURSEG_I(sbi
, type
);
377 blkaddr
= NEXT_FREE_BLKADDR(sbi
, curseg
);
380 page
= alloc_page(GFP_NOFS
| __GFP_ZERO
);
387 struct fsync_inode_entry
*entry
;
389 err
= f2fs_readpage(sbi
, page
, blkaddr
, READ_SYNC
);
395 if (cp_ver
!= cpver_of_node(page
))
398 entry
= get_fsync_inode(head
, ino_of_node(page
));
402 err
= do_recover_data(sbi
, entry
->inode
, page
, blkaddr
);
406 if (entry
->blkaddr
== blkaddr
) {
408 list_del(&entry
->list
);
409 kmem_cache_free(fsync_entry_slab
, entry
);
412 /* check next segment */
413 blkaddr
= next_blkaddr_of_node(page
);
417 __free_pages(page
, 0);
420 allocate_new_segments(sbi
);
424 int recover_fsync_data(struct f2fs_sb_info
*sbi
)
426 struct list_head inode_list
;
428 int need_writecp
= 0;
430 fsync_entry_slab
= f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
431 sizeof(struct fsync_inode_entry
), NULL
);
432 if (unlikely(!fsync_entry_slab
))
435 INIT_LIST_HEAD(&inode_list
);
437 /* step #1: find fsynced inode numbers */
439 err
= find_fsync_dnodes(sbi
, &inode_list
);
443 if (list_empty(&inode_list
))
448 /* step #2: recover data */
449 err
= recover_data(sbi
, &inode_list
, CURSEG_WARM_NODE
);
450 BUG_ON(!list_empty(&inode_list
));
452 destroy_fsync_dnodes(&inode_list
);
453 kmem_cache_destroy(fsync_entry_slab
);
455 if (!err
&& need_writecp
)
456 write_checkpoint(sbi
, false);