]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - fs/f2fs/checkpoint.c
f2fs: give a chance to mount again when encountering errors
[mirror_ubuntu-artful-kernel.git] / fs / f2fs / checkpoint.c
CommitLineData
0a8165d7 1/*
127e670a
JK
2 * fs/f2fs/checkpoint.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/bio.h>
13#include <linux/mpage.h>
14#include <linux/writeback.h>
15#include <linux/blkdev.h>
16#include <linux/f2fs_fs.h>
17#include <linux/pagevec.h>
18#include <linux/swap.h>
19
20#include "f2fs.h"
21#include "node.h"
22#include "segment.h"
2af4bd6c 23#include <trace/events/f2fs.h>
127e670a 24
6451e041 25static struct kmem_cache *ino_entry_slab;
127e670a
JK
26static struct kmem_cache *inode_entry_slab;
27
0a8165d7 28/*
127e670a
JK
29 * We guarantee no failure on the returned page.
30 */
31struct page *grab_meta_page(struct f2fs_sb_info *sbi, pgoff_t index)
32{
9df27d98 33 struct address_space *mapping = META_MAPPING(sbi);
127e670a
JK
34 struct page *page = NULL;
35repeat:
bde44686 36 page = grab_cache_page(mapping, index);
127e670a
JK
37 if (!page) {
38 cond_resched();
39 goto repeat;
40 }
bde44686 41 f2fs_wait_on_page_writeback(page, META);
127e670a
JK
42 SetPageUptodate(page);
43 return page;
44}
45
0a8165d7 46/*
127e670a
JK
47 * We guarantee no failure on the returned page.
48 */
49struct page *get_meta_page(struct f2fs_sb_info *sbi, pgoff_t index)
50{
9df27d98 51 struct address_space *mapping = META_MAPPING(sbi);
127e670a
JK
52 struct page *page;
53repeat:
54 page = grab_cache_page(mapping, index);
55 if (!page) {
56 cond_resched();
57 goto repeat;
58 }
393ff91f
JK
59 if (PageUptodate(page))
60 goto out;
61
93dfe2ac
JK
62 if (f2fs_submit_page_bio(sbi, page, index,
63 READ_SYNC | REQ_META | REQ_PRIO))
127e670a 64 goto repeat;
127e670a 65
393ff91f 66 lock_page(page);
6bacf52f 67 if (unlikely(page->mapping != mapping)) {
afcb7ca0
JK
68 f2fs_put_page(page, 1);
69 goto repeat;
70 }
393ff91f 71out:
127e670a
JK
72 return page;
73}
74
b49ad51e 75static inline int get_max_meta_blks(struct f2fs_sb_info *sbi, int type)
662befda
CY
76{
77 switch (type) {
78 case META_NAT:
79 return NM_I(sbi)->max_nid / NAT_ENTRY_PER_BLOCK;
80 case META_SIT:
81 return SIT_BLK_CNT(sbi);
81c1a0f1 82 case META_SSA:
662befda
CY
83 case META_CP:
84 return 0;
85 default:
86 BUG();
87 }
88}
89
90/*
81c1a0f1 91 * Readahead CP/NAT/SIT/SSA pages
662befda
CY
92 */
93int ra_meta_pages(struct f2fs_sb_info *sbi, int start, int nrpages, int type)
94{
95 block_t prev_blk_addr = 0;
96 struct page *page;
97 int blkno = start;
98 int max_blks = get_max_meta_blks(sbi, type);
99
100 struct f2fs_io_info fio = {
101 .type = META,
102 .rw = READ_SYNC | REQ_META | REQ_PRIO
103 };
104
105 for (; nrpages-- > 0; blkno++) {
106 block_t blk_addr;
107
108 switch (type) {
109 case META_NAT:
110 /* get nat block addr */
111 if (unlikely(blkno >= max_blks))
112 blkno = 0;
113 blk_addr = current_nat_addr(sbi,
114 blkno * NAT_ENTRY_PER_BLOCK);
115 break;
116 case META_SIT:
117 /* get sit block addr */
118 if (unlikely(blkno >= max_blks))
119 goto out;
120 blk_addr = current_sit_addr(sbi,
121 blkno * SIT_ENTRY_PER_BLOCK);
122 if (blkno != start && prev_blk_addr + 1 != blk_addr)
123 goto out;
124 prev_blk_addr = blk_addr;
125 break;
81c1a0f1 126 case META_SSA:
662befda 127 case META_CP:
81c1a0f1 128 /* get ssa/cp block addr */
662befda
CY
129 blk_addr = blkno;
130 break;
131 default:
132 BUG();
133 }
134
135 page = grab_cache_page(META_MAPPING(sbi), blk_addr);
136 if (!page)
137 continue;
138 if (PageUptodate(page)) {
662befda
CY
139 f2fs_put_page(page, 1);
140 continue;
141 }
142
143 f2fs_submit_page_mbio(sbi, page, blk_addr, &fio);
662befda
CY
144 f2fs_put_page(page, 0);
145 }
146out:
147 f2fs_submit_merged_bio(sbi, META, READ);
148 return blkno - start;
149}
150
127e670a
JK
151static int f2fs_write_meta_page(struct page *page,
152 struct writeback_control *wbc)
153{
154 struct inode *inode = page->mapping->host;
155 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
127e670a 156
ecda0de3
CY
157 trace_f2fs_writepage(page, META);
158
203681f6 159 if (unlikely(sbi->por_doing))
cfb271d4 160 goto redirty_out;
cfb271d4
CY
161 if (wbc->for_reclaim)
162 goto redirty_out;
127e670a 163
203681f6
JK
164 /* Should not write any meta pages, if any IO error was occurred */
165 if (unlikely(is_set_ckpt_flags(F2FS_CKPT(sbi), CP_ERROR_FLAG)))
166 goto no_write;
127e670a 167
3cb5ad15 168 f2fs_wait_on_page_writeback(page, META);
577e3495 169 write_meta_page(sbi, page);
203681f6 170no_write:
577e3495
JK
171 dec_page_count(sbi, F2FS_DIRTY_META);
172 unlock_page(page);
173 return 0;
cfb271d4
CY
174
175redirty_out:
76f60268 176 redirty_page_for_writepage(wbc, page);
cfb271d4 177 return AOP_WRITEPAGE_ACTIVATE;
127e670a
JK
178}
179
180static int f2fs_write_meta_pages(struct address_space *mapping,
181 struct writeback_control *wbc)
182{
183 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
50c8cdb3 184 long diff, written;
127e670a 185
e5748434
CY
186 trace_f2fs_writepages(mapping->host, wbc, META);
187
5459aa97 188 /* collect a number of dirty meta pages and write together */
50c8cdb3
JK
189 if (wbc->for_kupdate ||
190 get_pages(sbi, F2FS_DIRTY_META) < nr_pages_to_skip(sbi, META))
d3baf95d 191 goto skip_write;
127e670a
JK
192
193 /* if mounting is failed, skip writing node pages */
194 mutex_lock(&sbi->cp_mutex);
50c8cdb3
JK
195 diff = nr_pages_to_write(sbi, META, wbc);
196 written = sync_meta_pages(sbi, META, wbc->nr_to_write);
127e670a 197 mutex_unlock(&sbi->cp_mutex);
50c8cdb3 198 wbc->nr_to_write = max((long)0, wbc->nr_to_write - written - diff);
127e670a 199 return 0;
d3baf95d
JK
200
201skip_write:
202 wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_META);
203 return 0;
127e670a
JK
204}
205
206long sync_meta_pages(struct f2fs_sb_info *sbi, enum page_type type,
207 long nr_to_write)
208{
9df27d98 209 struct address_space *mapping = META_MAPPING(sbi);
127e670a
JK
210 pgoff_t index = 0, end = LONG_MAX;
211 struct pagevec pvec;
212 long nwritten = 0;
213 struct writeback_control wbc = {
214 .for_reclaim = 0,
215 };
216
217 pagevec_init(&pvec, 0);
218
219 while (index <= end) {
220 int i, nr_pages;
221 nr_pages = pagevec_lookup_tag(&pvec, mapping, &index,
222 PAGECACHE_TAG_DIRTY,
223 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
cfb271d4 224 if (unlikely(nr_pages == 0))
127e670a
JK
225 break;
226
227 for (i = 0; i < nr_pages; i++) {
228 struct page *page = pvec.pages[i];
203681f6 229
127e670a 230 lock_page(page);
203681f6
JK
231
232 if (unlikely(page->mapping != mapping)) {
233continue_unlock:
234 unlock_page(page);
235 continue;
236 }
237 if (!PageDirty(page)) {
238 /* someone wrote it for us */
239 goto continue_unlock;
240 }
241
242 if (!clear_page_dirty_for_io(page))
243 goto continue_unlock;
244
577e3495
JK
245 if (f2fs_write_meta_page(page, &wbc)) {
246 unlock_page(page);
247 break;
248 }
cfb271d4
CY
249 nwritten++;
250 if (unlikely(nwritten >= nr_to_write))
127e670a
JK
251 break;
252 }
253 pagevec_release(&pvec);
254 cond_resched();
255 }
256
257 if (nwritten)
458e6197 258 f2fs_submit_merged_bio(sbi, type, WRITE);
127e670a
JK
259
260 return nwritten;
261}
262
263static int f2fs_set_meta_page_dirty(struct page *page)
264{
265 struct address_space *mapping = page->mapping;
266 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
267
26c6b887
JK
268 trace_f2fs_set_page_dirty(page, META);
269
127e670a
JK
270 SetPageUptodate(page);
271 if (!PageDirty(page)) {
272 __set_page_dirty_nobuffers(page);
273 inc_page_count(sbi, F2FS_DIRTY_META);
127e670a
JK
274 return 1;
275 }
276 return 0;
277}
278
279const struct address_space_operations f2fs_meta_aops = {
280 .writepage = f2fs_write_meta_page,
281 .writepages = f2fs_write_meta_pages,
282 .set_page_dirty = f2fs_set_meta_page_dirty,
283};
284
6451e041 285static void __add_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type)
953e6cc6 286{
39efac41
JK
287 struct ino_entry *e;
288retry:
6451e041 289 spin_lock(&sbi->ino_lock[type]);
39efac41
JK
290
291 e = radix_tree_lookup(&sbi->ino_root[type], ino);
292 if (!e) {
293 e = kmem_cache_alloc(ino_entry_slab, GFP_ATOMIC);
294 if (!e) {
6451e041 295 spin_unlock(&sbi->ino_lock[type]);
39efac41 296 goto retry;
953e6cc6 297 }
39efac41
JK
298 if (radix_tree_insert(&sbi->ino_root[type], ino, e)) {
299 spin_unlock(&sbi->ino_lock[type]);
300 kmem_cache_free(ino_entry_slab, e);
301 goto retry;
302 }
303 memset(e, 0, sizeof(struct ino_entry));
304 e->ino = ino;
953e6cc6 305
39efac41
JK
306 list_add_tail(&e->list, &sbi->ino_list[type]);
307 }
6451e041 308 spin_unlock(&sbi->ino_lock[type]);
953e6cc6
JK
309}
310
6451e041 311static void __remove_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type)
953e6cc6 312{
6451e041 313 struct ino_entry *e;
953e6cc6 314
6451e041 315 spin_lock(&sbi->ino_lock[type]);
39efac41
JK
316 e = radix_tree_lookup(&sbi->ino_root[type], ino);
317 if (e) {
318 list_del(&e->list);
319 radix_tree_delete(&sbi->ino_root[type], ino);
320 if (type == ORPHAN_INO)
953e6cc6 321 sbi->n_orphans--;
39efac41
JK
322 spin_unlock(&sbi->ino_lock[type]);
323 kmem_cache_free(ino_entry_slab, e);
324 return;
953e6cc6 325 }
6451e041 326 spin_unlock(&sbi->ino_lock[type]);
953e6cc6
JK
327}
328
fff04f90
JK
329void add_dirty_inode(struct f2fs_sb_info *sbi, nid_t ino, int type)
330{
331 /* add new dirty ino entry into list */
332 __add_ino_entry(sbi, ino, type);
333}
334
335void remove_dirty_inode(struct f2fs_sb_info *sbi, nid_t ino, int type)
336{
337 /* remove dirty ino entry from list */
338 __remove_ino_entry(sbi, ino, type);
339}
340
341/* mode should be APPEND_INO or UPDATE_INO */
342bool exist_written_data(struct f2fs_sb_info *sbi, nid_t ino, int mode)
343{
344 struct ino_entry *e;
345 spin_lock(&sbi->ino_lock[mode]);
346 e = radix_tree_lookup(&sbi->ino_root[mode], ino);
347 spin_unlock(&sbi->ino_lock[mode]);
348 return e ? true : false;
349}
350
6f12ac25 351void release_dirty_inode(struct f2fs_sb_info *sbi)
fff04f90
JK
352{
353 struct ino_entry *e, *tmp;
354 int i;
355
356 for (i = APPEND_INO; i <= UPDATE_INO; i++) {
357 spin_lock(&sbi->ino_lock[i]);
358 list_for_each_entry_safe(e, tmp, &sbi->ino_list[i], list) {
359 list_del(&e->list);
360 radix_tree_delete(&sbi->ino_root[i], e->ino);
361 kmem_cache_free(ino_entry_slab, e);
362 }
363 spin_unlock(&sbi->ino_lock[i]);
364 }
365}
366
cbd56e7d 367int acquire_orphan_inode(struct f2fs_sb_info *sbi)
127e670a 368{
127e670a
JK
369 int err = 0;
370
6451e041 371 spin_lock(&sbi->ino_lock[ORPHAN_INO]);
0d47c1ad 372 if (unlikely(sbi->n_orphans >= sbi->max_orphans))
127e670a 373 err = -ENOSPC;
cbd56e7d
JK
374 else
375 sbi->n_orphans++;
6451e041 376 spin_unlock(&sbi->ino_lock[ORPHAN_INO]);
0d47c1ad 377
127e670a
JK
378 return err;
379}
380
cbd56e7d
JK
381void release_orphan_inode(struct f2fs_sb_info *sbi)
382{
6451e041 383 spin_lock(&sbi->ino_lock[ORPHAN_INO]);
5d56b671 384 f2fs_bug_on(sbi->n_orphans == 0);
cbd56e7d 385 sbi->n_orphans--;
6451e041 386 spin_unlock(&sbi->ino_lock[ORPHAN_INO]);
cbd56e7d
JK
387}
388
127e670a
JK
389void add_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
390{
39efac41 391 /* add new orphan ino entry into list */
6451e041 392 __add_ino_entry(sbi, ino, ORPHAN_INO);
127e670a
JK
393}
394
395void remove_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
396{
953e6cc6 397 /* remove orphan entry from orphan list */
6451e041 398 __remove_ino_entry(sbi, ino, ORPHAN_INO);
127e670a
JK
399}
400
401static void recover_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
402{
403 struct inode *inode = f2fs_iget(sbi->sb, ino);
5d56b671 404 f2fs_bug_on(IS_ERR(inode));
127e670a
JK
405 clear_nlink(inode);
406
407 /* truncate all the data during iput */
408 iput(inode);
409}
410
8f99a946 411void recover_orphan_inodes(struct f2fs_sb_info *sbi)
127e670a
JK
412{
413 block_t start_blk, orphan_blkaddr, i, j;
414
25ca923b 415 if (!is_set_ckpt_flags(F2FS_CKPT(sbi), CP_ORPHAN_PRESENT_FLAG))
8f99a946 416 return;
127e670a 417
aabe5136 418 sbi->por_doing = true;
1dbe4152
CL
419
420 start_blk = __start_cp_addr(sbi) + 1 +
421 le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
127e670a
JK
422 orphan_blkaddr = __start_sum_addr(sbi) - 1;
423
662befda
CY
424 ra_meta_pages(sbi, start_blk, orphan_blkaddr, META_CP);
425
127e670a
JK
426 for (i = 0; i < orphan_blkaddr; i++) {
427 struct page *page = get_meta_page(sbi, start_blk + i);
428 struct f2fs_orphan_block *orphan_blk;
429
430 orphan_blk = (struct f2fs_orphan_block *)page_address(page);
431 for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) {
432 nid_t ino = le32_to_cpu(orphan_blk->ino[j]);
433 recover_orphan_inode(sbi, ino);
434 }
435 f2fs_put_page(page, 1);
436 }
437 /* clear Orphan Flag */
25ca923b 438 clear_ckpt_flags(F2FS_CKPT(sbi), CP_ORPHAN_PRESENT_FLAG);
aabe5136 439 sbi->por_doing = false;
8f99a946 440 return;
127e670a
JK
441}
442
443static void write_orphan_inodes(struct f2fs_sb_info *sbi, block_t start_blk)
444{
502c6e0b 445 struct list_head *head;
127e670a 446 struct f2fs_orphan_block *orphan_blk = NULL;
127e670a 447 unsigned int nentries = 0;
4531929e
GZ
448 unsigned short index;
449 unsigned short orphan_blocks = (unsigned short)((sbi->n_orphans +
450 (F2FS_ORPHANS_PER_BLOCK - 1)) / F2FS_ORPHANS_PER_BLOCK);
451 struct page *page = NULL;
6451e041 452 struct ino_entry *orphan = NULL;
127e670a 453
4531929e 454 for (index = 0; index < orphan_blocks; index++)
63f5384c 455 grab_meta_page(sbi, start_blk + index);
127e670a 456
4531929e 457 index = 1;
6451e041
JK
458 spin_lock(&sbi->ino_lock[ORPHAN_INO]);
459 head = &sbi->ino_list[ORPHAN_INO];
127e670a
JK
460
461 /* loop for each orphan inode entry and write them in Jornal block */
502c6e0b
GZ
462 list_for_each_entry(orphan, head, list) {
463 if (!page) {
63f5384c
GZ
464 page = find_get_page(META_MAPPING(sbi), start_blk++);
465 f2fs_bug_on(!page);
502c6e0b
GZ
466 orphan_blk =
467 (struct f2fs_orphan_block *)page_address(page);
468 memset(orphan_blk, 0, sizeof(*orphan_blk));
63f5384c 469 f2fs_put_page(page, 0);
502c6e0b 470 }
127e670a 471
36795567 472 orphan_blk->ino[nentries++] = cpu_to_le32(orphan->ino);
127e670a 473
36795567 474 if (nentries == F2FS_ORPHANS_PER_BLOCK) {
127e670a
JK
475 /*
476 * an orphan block is full of 1020 entries,
477 * then we need to flush current orphan blocks
478 * and bring another one in memory
479 */
480 orphan_blk->blk_addr = cpu_to_le16(index);
481 orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
482 orphan_blk->entry_count = cpu_to_le32(nentries);
483 set_page_dirty(page);
484 f2fs_put_page(page, 1);
485 index++;
127e670a
JK
486 nentries = 0;
487 page = NULL;
488 }
502c6e0b 489 }
127e670a 490
502c6e0b
GZ
491 if (page) {
492 orphan_blk->blk_addr = cpu_to_le16(index);
493 orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
494 orphan_blk->entry_count = cpu_to_le32(nentries);
495 set_page_dirty(page);
496 f2fs_put_page(page, 1);
127e670a 497 }
502c6e0b 498
6451e041 499 spin_unlock(&sbi->ino_lock[ORPHAN_INO]);
127e670a
JK
500}
501
502static struct page *validate_checkpoint(struct f2fs_sb_info *sbi,
503 block_t cp_addr, unsigned long long *version)
504{
505 struct page *cp_page_1, *cp_page_2 = NULL;
506 unsigned long blk_size = sbi->blocksize;
507 struct f2fs_checkpoint *cp_block;
508 unsigned long long cur_version = 0, pre_version = 0;
127e670a 509 size_t crc_offset;
7e586fa0 510 __u32 crc = 0;
127e670a
JK
511
512 /* Read the 1st cp block in this CP pack */
513 cp_page_1 = get_meta_page(sbi, cp_addr);
514
515 /* get the version number */
516 cp_block = (struct f2fs_checkpoint *)page_address(cp_page_1);
517 crc_offset = le32_to_cpu(cp_block->checksum_offset);
518 if (crc_offset >= blk_size)
519 goto invalid_cp1;
520
7e586fa0 521 crc = le32_to_cpu(*((__u32 *)((unsigned char *)cp_block + crc_offset)));
127e670a
JK
522 if (!f2fs_crc_valid(crc, cp_block, crc_offset))
523 goto invalid_cp1;
524
d71b5564 525 pre_version = cur_cp_version(cp_block);
127e670a
JK
526
527 /* Read the 2nd cp block in this CP pack */
25ca923b 528 cp_addr += le32_to_cpu(cp_block->cp_pack_total_block_count) - 1;
127e670a
JK
529 cp_page_2 = get_meta_page(sbi, cp_addr);
530
531 cp_block = (struct f2fs_checkpoint *)page_address(cp_page_2);
532 crc_offset = le32_to_cpu(cp_block->checksum_offset);
533 if (crc_offset >= blk_size)
534 goto invalid_cp2;
535
7e586fa0 536 crc = le32_to_cpu(*((__u32 *)((unsigned char *)cp_block + crc_offset)));
127e670a
JK
537 if (!f2fs_crc_valid(crc, cp_block, crc_offset))
538 goto invalid_cp2;
539
d71b5564 540 cur_version = cur_cp_version(cp_block);
127e670a
JK
541
542 if (cur_version == pre_version) {
543 *version = cur_version;
544 f2fs_put_page(cp_page_2, 1);
545 return cp_page_1;
546 }
547invalid_cp2:
548 f2fs_put_page(cp_page_2, 1);
549invalid_cp1:
550 f2fs_put_page(cp_page_1, 1);
551 return NULL;
552}
553
554int get_valid_checkpoint(struct f2fs_sb_info *sbi)
555{
556 struct f2fs_checkpoint *cp_block;
557 struct f2fs_super_block *fsb = sbi->raw_super;
558 struct page *cp1, *cp2, *cur_page;
559 unsigned long blk_size = sbi->blocksize;
560 unsigned long long cp1_version = 0, cp2_version = 0;
561 unsigned long long cp_start_blk_no;
1dbe4152
CL
562 unsigned int cp_blks = 1 + le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
563 block_t cp_blk_no;
564 int i;
127e670a 565
1dbe4152 566 sbi->ckpt = kzalloc(cp_blks * blk_size, GFP_KERNEL);
127e670a
JK
567 if (!sbi->ckpt)
568 return -ENOMEM;
569 /*
570 * Finding out valid cp block involves read both
571 * sets( cp pack1 and cp pack 2)
572 */
573 cp_start_blk_no = le32_to_cpu(fsb->cp_blkaddr);
574 cp1 = validate_checkpoint(sbi, cp_start_blk_no, &cp1_version);
575
576 /* The second checkpoint pack should start at the next segment */
f9a4e6df
JK
577 cp_start_blk_no += ((unsigned long long)1) <<
578 le32_to_cpu(fsb->log_blocks_per_seg);
127e670a
JK
579 cp2 = validate_checkpoint(sbi, cp_start_blk_no, &cp2_version);
580
581 if (cp1 && cp2) {
582 if (ver_after(cp2_version, cp1_version))
583 cur_page = cp2;
584 else
585 cur_page = cp1;
586 } else if (cp1) {
587 cur_page = cp1;
588 } else if (cp2) {
589 cur_page = cp2;
590 } else {
591 goto fail_no_cp;
592 }
593
594 cp_block = (struct f2fs_checkpoint *)page_address(cur_page);
595 memcpy(sbi->ckpt, cp_block, blk_size);
596
1dbe4152
CL
597 if (cp_blks <= 1)
598 goto done;
599
600 cp_blk_no = le32_to_cpu(fsb->cp_blkaddr);
601 if (cur_page == cp2)
602 cp_blk_no += 1 << le32_to_cpu(fsb->log_blocks_per_seg);
603
604 for (i = 1; i < cp_blks; i++) {
605 void *sit_bitmap_ptr;
606 unsigned char *ckpt = (unsigned char *)sbi->ckpt;
607
608 cur_page = get_meta_page(sbi, cp_blk_no + i);
609 sit_bitmap_ptr = page_address(cur_page);
610 memcpy(ckpt + i * blk_size, sit_bitmap_ptr, blk_size);
611 f2fs_put_page(cur_page, 1);
612 }
613done:
127e670a
JK
614 f2fs_put_page(cp1, 1);
615 f2fs_put_page(cp2, 1);
616 return 0;
617
618fail_no_cp:
619 kfree(sbi->ckpt);
620 return -EINVAL;
621}
622
5deb8267 623static int __add_dirty_inode(struct inode *inode, struct dir_inode_entry *new)
127e670a
JK
624{
625 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
127e670a 626
ed57c27f
JK
627 if (is_inode_flag_set(F2FS_I(inode), FI_DIRTY_DIR))
628 return -EEXIST;
2d7b822a 629
ed57c27f
JK
630 set_inode_flag(F2FS_I(inode), FI_DIRTY_DIR);
631 F2FS_I(inode)->dirty_dir = new;
632 list_add_tail(&new->list, &sbi->dir_inode_list);
dcdfff65 633 stat_inc_dirty_dir(sbi);
5deb8267
JK
634 return 0;
635}
636
637void set_dirty_dir_page(struct inode *inode, struct page *page)
638{
639 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
640 struct dir_inode_entry *new;
cf0ee0f0 641 int ret = 0;
5deb8267 642
127e670a
JK
643 if (!S_ISDIR(inode->i_mode))
644 return;
7bd59381
GZ
645
646 new = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
127e670a
JK
647 new->inode = inode;
648 INIT_LIST_HEAD(&new->list);
649
650 spin_lock(&sbi->dir_inode_lock);
cf0ee0f0 651 ret = __add_dirty_inode(inode, new);
127e670a
JK
652 inode_inc_dirty_dents(inode);
653 SetPagePrivate(page);
5deb8267 654 spin_unlock(&sbi->dir_inode_lock);
cf0ee0f0
CY
655
656 if (ret)
657 kmem_cache_free(inode_entry_slab, new);
5deb8267
JK
658}
659
660void add_dirty_dir_inode(struct inode *inode)
661{
662 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
7bd59381
GZ
663 struct dir_inode_entry *new =
664 f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
cf0ee0f0 665 int ret = 0;
7bd59381 666
5deb8267
JK
667 new->inode = inode;
668 INIT_LIST_HEAD(&new->list);
127e670a 669
5deb8267 670 spin_lock(&sbi->dir_inode_lock);
cf0ee0f0 671 ret = __add_dirty_inode(inode, new);
127e670a 672 spin_unlock(&sbi->dir_inode_lock);
cf0ee0f0
CY
673
674 if (ret)
675 kmem_cache_free(inode_entry_slab, new);
127e670a
JK
676}
677
678void remove_dirty_dir_inode(struct inode *inode)
679{
680 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
2d7b822a 681 struct dir_inode_entry *entry;
127e670a
JK
682
683 if (!S_ISDIR(inode->i_mode))
684 return;
685
686 spin_lock(&sbi->dir_inode_lock);
ed57c27f
JK
687 if (get_dirty_dents(inode) ||
688 !is_inode_flag_set(F2FS_I(inode), FI_DIRTY_DIR)) {
3b10b1fd
JK
689 spin_unlock(&sbi->dir_inode_lock);
690 return;
691 }
127e670a 692
ed57c27f
JK
693 entry = F2FS_I(inode)->dirty_dir;
694 list_del(&entry->list);
695 F2FS_I(inode)->dirty_dir = NULL;
696 clear_inode_flag(F2FS_I(inode), FI_DIRTY_DIR);
697 stat_dec_dirty_dir(sbi);
127e670a 698 spin_unlock(&sbi->dir_inode_lock);
ed57c27f 699 kmem_cache_free(inode_entry_slab, entry);
74d0b917
JK
700
701 /* Only from the recovery routine */
afc3eda2
JK
702 if (is_inode_flag_set(F2FS_I(inode), FI_DELAY_IPUT)) {
703 clear_inode_flag(F2FS_I(inode), FI_DELAY_IPUT);
74d0b917 704 iput(inode);
afc3eda2 705 }
74d0b917
JK
706}
707
127e670a
JK
708void sync_dirty_dir_inodes(struct f2fs_sb_info *sbi)
709{
ce3b7d80 710 struct list_head *head;
127e670a
JK
711 struct dir_inode_entry *entry;
712 struct inode *inode;
713retry:
714 spin_lock(&sbi->dir_inode_lock);
ce3b7d80
GZ
715
716 head = &sbi->dir_inode_list;
127e670a
JK
717 if (list_empty(head)) {
718 spin_unlock(&sbi->dir_inode_lock);
719 return;
720 }
721 entry = list_entry(head->next, struct dir_inode_entry, list);
722 inode = igrab(entry->inode);
723 spin_unlock(&sbi->dir_inode_lock);
724 if (inode) {
87d6f890 725 filemap_fdatawrite(inode->i_mapping);
127e670a
JK
726 iput(inode);
727 } else {
728 /*
729 * We should submit bio, since it exists several
730 * wribacking dentry pages in the freeing inode.
731 */
458e6197 732 f2fs_submit_merged_bio(sbi, DATA, WRITE);
127e670a
JK
733 }
734 goto retry;
735}
736
0a8165d7 737/*
127e670a
JK
738 * Freeze all the FS-operations for checkpoint.
739 */
43727527 740static void block_operations(struct f2fs_sb_info *sbi)
127e670a 741{
127e670a
JK
742 struct writeback_control wbc = {
743 .sync_mode = WB_SYNC_ALL,
744 .nr_to_write = LONG_MAX,
745 .for_reclaim = 0,
746 };
c718379b
JK
747 struct blk_plug plug;
748
749 blk_start_plug(&plug);
750
39936837 751retry_flush_dents:
e479556b 752 f2fs_lock_all(sbi);
127e670a 753 /* write all the dirty dentry pages */
127e670a 754 if (get_pages(sbi, F2FS_DIRTY_DENTS)) {
e479556b 755 f2fs_unlock_all(sbi);
39936837
JK
756 sync_dirty_dir_inodes(sbi);
757 goto retry_flush_dents;
127e670a
JK
758 }
759
127e670a 760 /*
e1c42045 761 * POR: we should ensure that there are no dirty node pages
127e670a
JK
762 * until finishing nat/sit flush.
763 */
39936837 764retry_flush_nodes:
b3582c68 765 down_write(&sbi->node_write);
127e670a
JK
766
767 if (get_pages(sbi, F2FS_DIRTY_NODES)) {
b3582c68 768 up_write(&sbi->node_write);
39936837
JK
769 sync_node_pages(sbi, 0, &wbc);
770 goto retry_flush_nodes;
127e670a 771 }
c718379b 772 blk_finish_plug(&plug);
127e670a
JK
773}
774
775static void unblock_operations(struct f2fs_sb_info *sbi)
776{
b3582c68 777 up_write(&sbi->node_write);
e479556b 778 f2fs_unlock_all(sbi);
127e670a
JK
779}
780
fb51b5ef
CL
781static void wait_on_all_pages_writeback(struct f2fs_sb_info *sbi)
782{
783 DEFINE_WAIT(wait);
784
785 for (;;) {
786 prepare_to_wait(&sbi->cp_wait, &wait, TASK_UNINTERRUPTIBLE);
787
788 if (!get_pages(sbi, F2FS_WRITEBACK))
789 break;
790
791 io_schedule();
792 }
793 finish_wait(&sbi->cp_wait, &wait);
794}
795
127e670a
JK
796static void do_checkpoint(struct f2fs_sb_info *sbi, bool is_umount)
797{
798 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
cf2271e7 799 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
127e670a
JK
800 nid_t last_nid = 0;
801 block_t start_blk;
802 struct page *cp_page;
803 unsigned int data_sum_blocks, orphan_blocks;
7e586fa0 804 __u32 crc32 = 0;
127e670a 805 void *kaddr;
127e670a 806 int i;
1dbe4152 807 int cp_payload_blks = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
127e670a 808
1e87a78d
JK
809 /*
810 * This avoids to conduct wrong roll-forward operations and uses
811 * metapages, so should be called prior to sync_meta_pages below.
812 */
cf2271e7 813 discard_next_dnode(sbi, NEXT_FREE_BLKADDR(sbi, curseg));
127e670a
JK
814
815 /* Flush all the NAT/SIT pages */
816 while (get_pages(sbi, F2FS_DIRTY_META))
817 sync_meta_pages(sbi, META, LONG_MAX);
818
819 next_free_nid(sbi, &last_nid);
820
821 /*
822 * modify checkpoint
823 * version number is already updated
824 */
825 ckpt->elapsed_time = cpu_to_le64(get_mtime(sbi));
826 ckpt->valid_block_count = cpu_to_le64(valid_user_blocks(sbi));
827 ckpt->free_segment_count = cpu_to_le32(free_segments(sbi));
828 for (i = 0; i < 3; i++) {
829 ckpt->cur_node_segno[i] =
830 cpu_to_le32(curseg_segno(sbi, i + CURSEG_HOT_NODE));
831 ckpt->cur_node_blkoff[i] =
832 cpu_to_le16(curseg_blkoff(sbi, i + CURSEG_HOT_NODE));
833 ckpt->alloc_type[i + CURSEG_HOT_NODE] =
834 curseg_alloc_type(sbi, i + CURSEG_HOT_NODE);
835 }
836 for (i = 0; i < 3; i++) {
837 ckpt->cur_data_segno[i] =
838 cpu_to_le32(curseg_segno(sbi, i + CURSEG_HOT_DATA));
839 ckpt->cur_data_blkoff[i] =
840 cpu_to_le16(curseg_blkoff(sbi, i + CURSEG_HOT_DATA));
841 ckpt->alloc_type[i + CURSEG_HOT_DATA] =
842 curseg_alloc_type(sbi, i + CURSEG_HOT_DATA);
843 }
844
845 ckpt->valid_node_count = cpu_to_le32(valid_node_count(sbi));
846 ckpt->valid_inode_count = cpu_to_le32(valid_inode_count(sbi));
847 ckpt->next_free_nid = cpu_to_le32(last_nid);
848
849 /* 2 cp + n data seg summary + orphan inode blocks */
850 data_sum_blocks = npages_for_summary_flush(sbi);
851 if (data_sum_blocks < 3)
25ca923b 852 set_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
127e670a 853 else
25ca923b 854 clear_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
127e670a
JK
855
856 orphan_blocks = (sbi->n_orphans + F2FS_ORPHANS_PER_BLOCK - 1)
857 / F2FS_ORPHANS_PER_BLOCK;
1dbe4152
CL
858 ckpt->cp_pack_start_sum = cpu_to_le32(1 + cp_payload_blks +
859 orphan_blocks);
127e670a
JK
860
861 if (is_umount) {
25ca923b
JK
862 set_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
863 ckpt->cp_pack_total_block_count = cpu_to_le32(2 +
1dbe4152
CL
864 cp_payload_blks + data_sum_blocks +
865 orphan_blocks + NR_CURSEG_NODE_TYPE);
127e670a 866 } else {
25ca923b
JK
867 clear_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
868 ckpt->cp_pack_total_block_count = cpu_to_le32(2 +
1dbe4152
CL
869 cp_payload_blks + data_sum_blocks +
870 orphan_blocks);
127e670a
JK
871 }
872
873 if (sbi->n_orphans)
25ca923b 874 set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
127e670a 875 else
25ca923b 876 clear_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
127e670a
JK
877
878 /* update SIT/NAT bitmap */
879 get_sit_bitmap(sbi, __bitmap_ptr(sbi, SIT_BITMAP));
880 get_nat_bitmap(sbi, __bitmap_ptr(sbi, NAT_BITMAP));
881
882 crc32 = f2fs_crc32(ckpt, le32_to_cpu(ckpt->checksum_offset));
7e586fa0
JK
883 *((__le32 *)((unsigned char *)ckpt +
884 le32_to_cpu(ckpt->checksum_offset)))
127e670a
JK
885 = cpu_to_le32(crc32);
886
887 start_blk = __start_cp_addr(sbi);
888
889 /* write out checkpoint buffer at block 0 */
890 cp_page = grab_meta_page(sbi, start_blk++);
891 kaddr = page_address(cp_page);
892 memcpy(kaddr, ckpt, (1 << sbi->log_blocksize));
893 set_page_dirty(cp_page);
894 f2fs_put_page(cp_page, 1);
895
1dbe4152
CL
896 for (i = 1; i < 1 + cp_payload_blks; i++) {
897 cp_page = grab_meta_page(sbi, start_blk++);
898 kaddr = page_address(cp_page);
899 memcpy(kaddr, (char *)ckpt + i * F2FS_BLKSIZE,
900 (1 << sbi->log_blocksize));
901 set_page_dirty(cp_page);
902 f2fs_put_page(cp_page, 1);
903 }
904
127e670a
JK
905 if (sbi->n_orphans) {
906 write_orphan_inodes(sbi, start_blk);
907 start_blk += orphan_blocks;
908 }
909
910 write_data_summaries(sbi, start_blk);
911 start_blk += data_sum_blocks;
912 if (is_umount) {
913 write_node_summaries(sbi, start_blk);
914 start_blk += NR_CURSEG_NODE_TYPE;
915 }
916
917 /* writeout checkpoint block */
918 cp_page = grab_meta_page(sbi, start_blk);
919 kaddr = page_address(cp_page);
920 memcpy(kaddr, ckpt, (1 << sbi->log_blocksize));
921 set_page_dirty(cp_page);
922 f2fs_put_page(cp_page, 1);
923
924 /* wait for previous submitted node/meta pages writeback */
fb51b5ef 925 wait_on_all_pages_writeback(sbi);
127e670a 926
4ef51a8f 927 filemap_fdatawait_range(NODE_MAPPING(sbi), 0, LONG_MAX);
9df27d98 928 filemap_fdatawait_range(META_MAPPING(sbi), 0, LONG_MAX);
127e670a
JK
929
930 /* update user_block_counts */
931 sbi->last_valid_block_count = sbi->total_valid_block_count;
932 sbi->alloc_valid_block_count = 0;
933
934 /* Here, we only have one bio having CP pack */
577e3495 935 sync_meta_pages(sbi, META_FLUSH, LONG_MAX);
127e670a 936
01229f5e 937 if (!is_set_ckpt_flags(ckpt, CP_ERROR_FLAG)) {
577e3495 938 clear_prefree_segments(sbi);
fff04f90 939 release_dirty_inode(sbi);
577e3495
JK
940 F2FS_RESET_SB_DIRT(sbi);
941 }
127e670a
JK
942}
943
0a8165d7 944/*
e1c42045 945 * We guarantee that this checkpoint procedure will not fail.
127e670a 946 */
43727527 947void write_checkpoint(struct f2fs_sb_info *sbi, bool is_umount)
127e670a
JK
948{
949 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
950 unsigned long long ckpt_ver;
951
2af4bd6c
NJ
952 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "start block_ops");
953
43727527
JK
954 mutex_lock(&sbi->cp_mutex);
955 block_operations(sbi);
127e670a 956
2af4bd6c
NJ
957 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "finish block_ops");
958
458e6197
JK
959 f2fs_submit_merged_bio(sbi, DATA, WRITE);
960 f2fs_submit_merged_bio(sbi, NODE, WRITE);
961 f2fs_submit_merged_bio(sbi, META, WRITE);
127e670a
JK
962
963 /*
964 * update checkpoint pack index
965 * Increase the version number so that
966 * SIT entries and seg summaries are written at correct place
967 */
d71b5564 968 ckpt_ver = cur_cp_version(ckpt);
127e670a
JK
969 ckpt->checkpoint_ver = cpu_to_le64(++ckpt_ver);
970
971 /* write cached NAT/SIT entries to NAT/SIT area */
972 flush_nat_entries(sbi);
973 flush_sit_entries(sbi);
974
127e670a
JK
975 /* unlock all the fs_lock[] in do_checkpoint() */
976 do_checkpoint(sbi, is_umount);
977
978 unblock_operations(sbi);
979 mutex_unlock(&sbi->cp_mutex);
2af4bd6c 980
942e0be6 981 stat_inc_cp_count(sbi->stat_info);
2af4bd6c 982 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "finish checkpoint");
127e670a
JK
983}
984
6451e041 985void init_ino_entry_info(struct f2fs_sb_info *sbi)
127e670a 986{
6451e041
JK
987 int i;
988
989 for (i = 0; i < MAX_INO_ENTRY; i++) {
39efac41 990 INIT_RADIX_TREE(&sbi->ino_root[i], GFP_ATOMIC);
6451e041
JK
991 spin_lock_init(&sbi->ino_lock[i]);
992 INIT_LIST_HEAD(&sbi->ino_list[i]);
993 }
994
0d47c1ad
GZ
995 /*
996 * considering 512 blocks in a segment 8 blocks are needed for cp
997 * and log segment summaries. Remaining blocks are used to keep
998 * orphan entries with the limitation one reserved segment
999 * for cp pack we can have max 1020*504 orphan entries
1000 */
6451e041 1001 sbi->n_orphans = 0;
0d47c1ad
GZ
1002 sbi->max_orphans = (sbi->blocks_per_seg - 2 - NR_CURSEG_TYPE)
1003 * F2FS_ORPHANS_PER_BLOCK;
127e670a
JK
1004}
1005
6e6093a8 1006int __init create_checkpoint_caches(void)
127e670a 1007{
6451e041
JK
1008 ino_entry_slab = f2fs_kmem_cache_create("f2fs_ino_entry",
1009 sizeof(struct ino_entry));
1010 if (!ino_entry_slab)
127e670a
JK
1011 return -ENOMEM;
1012 inode_entry_slab = f2fs_kmem_cache_create("f2fs_dirty_dir_entry",
e8512d2e 1013 sizeof(struct dir_inode_entry));
6bacf52f 1014 if (!inode_entry_slab) {
6451e041 1015 kmem_cache_destroy(ino_entry_slab);
127e670a
JK
1016 return -ENOMEM;
1017 }
1018 return 0;
1019}
1020
1021void destroy_checkpoint_caches(void)
1022{
6451e041 1023 kmem_cache_destroy(ino_entry_slab);
127e670a
JK
1024 kmem_cache_destroy(inode_entry_slab);
1025}