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)) {
69 f2fs_put_page(page, 0);
73 einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
76 if (PTR_ERR(einode) == -ENOENT)
80 f2fs_delete_entry(de, page, einode);
84 err = __f2fs_add_link(dir, &name, inode);
86 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode and its dentry: "
87 "ino = %x, name = %s, dir = %lx, err = %d",
88 ino_of_node(ipage), raw_inode->i_name,
89 IS_ERR(dir) ? 0 : dir->i_ino, err);
93 static int recover_inode(struct inode *inode, struct page *node_page)
95 struct f2fs_node *raw_node = F2FS_NODE(node_page);
96 struct f2fs_inode *raw_inode = &(raw_node->i);
98 if (!IS_INODE(node_page))
101 inode->i_mode = le16_to_cpu(raw_inode->i_mode);
102 i_size_write(inode, le64_to_cpu(raw_inode->i_size));
103 inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
104 inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
105 inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
106 inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
107 inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
108 inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
110 if (is_dent_dnode(node_page))
111 return recover_dentry(node_page, inode);
113 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
114 ino_of_node(node_page), raw_inode->i_name);
118 static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
120 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
121 struct curseg_info *curseg;
126 /* get node pages in the current segment */
127 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
128 blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;
131 page = alloc_page(GFP_F2FS_ZERO);
137 struct fsync_inode_entry *entry;
139 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
145 if (cp_ver != cpver_of_node(page))
148 if (!is_fsync_dnode(page))
151 entry = get_fsync_inode(head, ino_of_node(page));
153 if (IS_INODE(page) && is_dent_dnode(page))
154 set_inode_flag(F2FS_I(entry->inode),
157 if (IS_INODE(page) && is_dent_dnode(page)) {
158 err = recover_inode_page(sbi, page);
163 /* add this fsync inode to the list */
164 entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
170 entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
171 if (IS_ERR(entry->inode)) {
172 err = PTR_ERR(entry->inode);
173 kmem_cache_free(fsync_entry_slab, entry);
176 list_add_tail(&entry->list, head);
178 entry->blkaddr = blkaddr;
180 err = recover_inode(entry->inode, page);
181 if (err && err != -ENOENT)
184 /* check next segment */
185 blkaddr = next_blkaddr_of_node(page);
189 __free_pages(page, 0);
193 static void destroy_fsync_dnodes(struct list_head *head)
195 struct fsync_inode_entry *entry, *tmp;
197 list_for_each_entry_safe(entry, tmp, head, list) {
199 list_del(&entry->list);
200 kmem_cache_free(fsync_entry_slab, entry);
204 static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
205 block_t blkaddr, struct dnode_of_data *dn)
207 struct seg_entry *sentry;
208 unsigned int segno = GET_SEGNO(sbi, blkaddr);
209 unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
210 (sbi->blocks_per_seg - 1);
211 struct f2fs_summary sum;
215 struct page *node_page;
220 sentry = get_seg_entry(sbi, segno);
221 if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
224 /* Get the previous summary */
225 for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
226 struct curseg_info *curseg = CURSEG_I(sbi, i);
227 if (curseg->segno == segno) {
228 sum = curseg->sum_blk->entries[blkoff];
232 if (i > CURSEG_COLD_DATA) {
233 struct page *sum_page = get_sum_page(sbi, segno);
234 struct f2fs_summary_block *sum_node;
235 kaddr = page_address(sum_page);
236 sum_node = (struct f2fs_summary_block *)kaddr;
237 sum = sum_node->entries[blkoff];
238 f2fs_put_page(sum_page, 1);
241 /* Use the locked dnode page and inode */
242 nid = le32_to_cpu(sum.nid);
243 if (dn->inode->i_ino == nid) {
244 struct dnode_of_data tdn = *dn;
246 tdn.node_page = dn->inode_page;
247 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
248 truncate_data_blocks_range(&tdn, 1);
250 } else if (dn->nid == nid) {
251 struct dnode_of_data tdn = *dn;
252 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
253 truncate_data_blocks_range(&tdn, 1);
257 /* Get the node page */
258 node_page = get_node_page(sbi, nid);
259 if (IS_ERR(node_page))
260 return PTR_ERR(node_page);
262 offset = ofs_of_node(node_page);
263 ino = ino_of_node(node_page);
264 f2fs_put_page(node_page, 1);
266 /* Deallocate previous index in the node page */
267 inode = f2fs_iget(sbi->sb, ino);
269 return PTR_ERR(inode);
271 bidx = start_bidx_of_node(offset, F2FS_I(inode)) +
272 le16_to_cpu(sum.ofs_in_node);
274 truncate_hole(inode, bidx, bidx + 1);
279 static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
280 struct page *page, block_t blkaddr)
282 struct f2fs_inode_info *fi = F2FS_I(inode);
283 unsigned int start, end;
284 struct dnode_of_data dn;
285 struct f2fs_summary sum;
287 int err = 0, recovered = 0;
290 start = start_bidx_of_node(ofs_of_node(page), fi);
292 end = start + ADDRS_PER_INODE(fi);
294 end = start + ADDRS_PER_BLOCK;
296 ilock = mutex_lock_op(sbi);
297 set_new_dnode(&dn, inode, NULL, NULL, 0);
299 err = get_dnode_of_data(&dn, start, ALLOC_NODE);
301 mutex_unlock_op(sbi, ilock);
305 wait_on_page_writeback(dn.node_page);
307 get_node_info(sbi, dn.nid, &ni);
308 BUG_ON(ni.ino != ino_of_node(page));
309 BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));
311 for (; start < end; start++) {
314 src = datablock_addr(dn.node_page, dn.ofs_in_node);
315 dest = datablock_addr(page, dn.ofs_in_node);
317 if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
318 if (src == NULL_ADDR) {
319 int err = reserve_new_block(&dn);
320 /* We should not get -ENOSPC */
324 /* Check the previous node page having this index */
325 err = check_index_in_prev_nodes(sbi, dest, &dn);
329 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
331 /* write dummy data page */
332 recover_data_page(sbi, NULL, &sum, src, dest);
333 update_extent_cache(dest, &dn);
339 /* write node page in place */
340 set_summary(&sum, dn.nid, 0, 0);
341 if (IS_INODE(dn.node_page))
342 sync_inode_page(&dn);
344 copy_node_footer(dn.node_page, page);
345 fill_node_footer(dn.node_page, dn.nid, ni.ino,
346 ofs_of_node(page), false);
347 set_page_dirty(dn.node_page);
349 recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
352 mutex_unlock_op(sbi, ilock);
354 f2fs_msg(sbi->sb, KERN_NOTICE, "recover_data: ino = %lx, "
355 "recovered_data = %d blocks, err = %d",
356 inode->i_ino, recovered, err);
360 static int recover_data(struct f2fs_sb_info *sbi,
361 struct list_head *head, int type)
363 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
364 struct curseg_info *curseg;
369 /* get node pages in the current segment */
370 curseg = CURSEG_I(sbi, type);
371 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
374 page = alloc_page(GFP_NOFS | __GFP_ZERO);
381 struct fsync_inode_entry *entry;
383 err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
389 if (cp_ver != cpver_of_node(page))
392 entry = get_fsync_inode(head, ino_of_node(page));
396 err = do_recover_data(sbi, entry->inode, page, blkaddr);
400 if (entry->blkaddr == blkaddr) {
402 list_del(&entry->list);
403 kmem_cache_free(fsync_entry_slab, entry);
406 /* check next segment */
407 blkaddr = next_blkaddr_of_node(page);
411 __free_pages(page, 0);
414 allocate_new_segments(sbi);
418 int recover_fsync_data(struct f2fs_sb_info *sbi)
420 struct list_head inode_list;
423 fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
424 sizeof(struct fsync_inode_entry), NULL);
425 if (unlikely(!fsync_entry_slab))
428 INIT_LIST_HEAD(&inode_list);
430 /* step #1: find fsynced inode numbers */
432 err = find_fsync_dnodes(sbi, &inode_list);
436 if (list_empty(&inode_list))
439 /* step #2: recover data */
440 err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
441 BUG_ON(!list_empty(&inode_list));
443 destroy_fsync_dnodes(&inode_list);
444 kmem_cache_destroy(fsync_entry_slab);
447 write_checkpoint(sbi, false);