]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - fs/f2fs/checkpoint.c
f2fs: move grabing orphan pages out of protection region
[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
JK
24
25static struct kmem_cache *orphan_entry_slab;
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{
33 struct address_space *mapping = sbi->meta_inode->i_mapping;
34 struct page *page = NULL;
35repeat:
36 page = grab_cache_page(mapping, index);
37 if (!page) {
38 cond_resched();
39 goto repeat;
40 }
41
42 /* We wait writeback only inside grab_meta_page() */
43 wait_on_page_writeback(page);
44 SetPageUptodate(page);
45 return page;
46}
47
0a8165d7 48/*
127e670a
JK
49 * We guarantee no failure on the returned page.
50 */
51struct page *get_meta_page(struct f2fs_sb_info *sbi, pgoff_t index)
52{
53 struct address_space *mapping = sbi->meta_inode->i_mapping;
54 struct page *page;
55repeat:
56 page = grab_cache_page(mapping, index);
57 if (!page) {
58 cond_resched();
59 goto repeat;
60 }
393ff91f
JK
61 if (PageUptodate(page))
62 goto out;
63
93dfe2ac
JK
64 if (f2fs_submit_page_bio(sbi, page, index,
65 READ_SYNC | REQ_META | REQ_PRIO))
127e670a 66 goto repeat;
127e670a 67
393ff91f 68 lock_page(page);
6bacf52f 69 if (unlikely(page->mapping != mapping)) {
afcb7ca0
JK
70 f2fs_put_page(page, 1);
71 goto repeat;
72 }
393ff91f
JK
73out:
74 mark_page_accessed(page);
127e670a
JK
75 return page;
76}
77
78static int f2fs_write_meta_page(struct page *page,
79 struct writeback_control *wbc)
80{
81 struct inode *inode = page->mapping->host;
82 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
127e670a 83
577e3495 84 /* Should not write any meta pages, if any IO error was occurred */
cfb271d4
CY
85 if (unlikely(sbi->por_doing ||
86 is_set_ckpt_flags(F2FS_CKPT(sbi), CP_ERROR_FLAG)))
87 goto redirty_out;
88
89 if (wbc->for_reclaim)
90 goto redirty_out;
127e670a 91
577e3495 92 wait_on_page_writeback(page);
127e670a 93
577e3495
JK
94 write_meta_page(sbi, page);
95 dec_page_count(sbi, F2FS_DIRTY_META);
96 unlock_page(page);
97 return 0;
cfb271d4
CY
98
99redirty_out:
100 dec_page_count(sbi, F2FS_DIRTY_META);
101 wbc->pages_skipped++;
102 set_page_dirty(page);
103 return AOP_WRITEPAGE_ACTIVATE;
127e670a
JK
104}
105
106static int f2fs_write_meta_pages(struct address_space *mapping,
107 struct writeback_control *wbc)
108{
109 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
5459aa97 110 int nrpages = MAX_BIO_BLOCKS(max_hw_blocks(sbi));
127e670a
JK
111 long written;
112
113 if (wbc->for_kupdate)
114 return 0;
115
5459aa97
JK
116 /* collect a number of dirty meta pages and write together */
117 if (get_pages(sbi, F2FS_DIRTY_META) < nrpages)
127e670a
JK
118 return 0;
119
120 /* if mounting is failed, skip writing node pages */
121 mutex_lock(&sbi->cp_mutex);
5459aa97 122 written = sync_meta_pages(sbi, META, nrpages);
127e670a
JK
123 mutex_unlock(&sbi->cp_mutex);
124 wbc->nr_to_write -= written;
125 return 0;
126}
127
128long sync_meta_pages(struct f2fs_sb_info *sbi, enum page_type type,
129 long nr_to_write)
130{
131 struct address_space *mapping = sbi->meta_inode->i_mapping;
132 pgoff_t index = 0, end = LONG_MAX;
133 struct pagevec pvec;
134 long nwritten = 0;
135 struct writeback_control wbc = {
136 .for_reclaim = 0,
137 };
138
139 pagevec_init(&pvec, 0);
140
141 while (index <= end) {
142 int i, nr_pages;
143 nr_pages = pagevec_lookup_tag(&pvec, mapping, &index,
144 PAGECACHE_TAG_DIRTY,
145 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
cfb271d4 146 if (unlikely(nr_pages == 0))
127e670a
JK
147 break;
148
149 for (i = 0; i < nr_pages; i++) {
150 struct page *page = pvec.pages[i];
151 lock_page(page);
5d56b671
JK
152 f2fs_bug_on(page->mapping != mapping);
153 f2fs_bug_on(!PageDirty(page));
127e670a 154 clear_page_dirty_for_io(page);
577e3495
JK
155 if (f2fs_write_meta_page(page, &wbc)) {
156 unlock_page(page);
157 break;
158 }
cfb271d4
CY
159 nwritten++;
160 if (unlikely(nwritten >= nr_to_write))
127e670a
JK
161 break;
162 }
163 pagevec_release(&pvec);
164 cond_resched();
165 }
166
167 if (nwritten)
458e6197 168 f2fs_submit_merged_bio(sbi, type, WRITE);
127e670a
JK
169
170 return nwritten;
171}
172
173static int f2fs_set_meta_page_dirty(struct page *page)
174{
175 struct address_space *mapping = page->mapping;
176 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
177
26c6b887
JK
178 trace_f2fs_set_page_dirty(page, META);
179
127e670a
JK
180 SetPageUptodate(page);
181 if (!PageDirty(page)) {
182 __set_page_dirty_nobuffers(page);
183 inc_page_count(sbi, F2FS_DIRTY_META);
127e670a
JK
184 return 1;
185 }
186 return 0;
187}
188
189const struct address_space_operations f2fs_meta_aops = {
190 .writepage = f2fs_write_meta_page,
191 .writepages = f2fs_write_meta_pages,
192 .set_page_dirty = f2fs_set_meta_page_dirty,
193};
194
cbd56e7d 195int acquire_orphan_inode(struct f2fs_sb_info *sbi)
127e670a 196{
127e670a
JK
197 int err = 0;
198
127e670a 199 mutex_lock(&sbi->orphan_inode_mutex);
0d47c1ad 200 if (unlikely(sbi->n_orphans >= sbi->max_orphans))
127e670a 201 err = -ENOSPC;
cbd56e7d
JK
202 else
203 sbi->n_orphans++;
127e670a 204 mutex_unlock(&sbi->orphan_inode_mutex);
0d47c1ad 205
127e670a
JK
206 return err;
207}
208
cbd56e7d
JK
209void release_orphan_inode(struct f2fs_sb_info *sbi)
210{
211 mutex_lock(&sbi->orphan_inode_mutex);
5d56b671 212 f2fs_bug_on(sbi->n_orphans == 0);
cbd56e7d
JK
213 sbi->n_orphans--;
214 mutex_unlock(&sbi->orphan_inode_mutex);
215}
216
127e670a
JK
217void add_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
218{
219 struct list_head *head, *this;
220 struct orphan_inode_entry *new = NULL, *orphan = NULL;
221
222 mutex_lock(&sbi->orphan_inode_mutex);
223 head = &sbi->orphan_inode_list;
224 list_for_each(this, head) {
225 orphan = list_entry(this, struct orphan_inode_entry, list);
226 if (orphan->ino == ino)
227 goto out;
228 if (orphan->ino > ino)
229 break;
230 orphan = NULL;
231 }
7bd59381
GZ
232
233 new = f2fs_kmem_cache_alloc(orphan_entry_slab, GFP_ATOMIC);
127e670a 234 new->ino = ino;
127e670a
JK
235
236 /* add new_oentry into list which is sorted by inode number */
a2617dc6 237 if (orphan)
238 list_add(&new->list, this->prev);
239 else
127e670a 240 list_add_tail(&new->list, head);
127e670a
JK
241out:
242 mutex_unlock(&sbi->orphan_inode_mutex);
243}
244
245void remove_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
246{
60ed9a0f 247 struct list_head *head;
127e670a
JK
248 struct orphan_inode_entry *orphan;
249
250 mutex_lock(&sbi->orphan_inode_mutex);
251 head = &sbi->orphan_inode_list;
60ed9a0f 252 list_for_each_entry(orphan, head, list) {
127e670a
JK
253 if (orphan->ino == ino) {
254 list_del(&orphan->list);
255 kmem_cache_free(orphan_entry_slab, orphan);
5d56b671 256 f2fs_bug_on(sbi->n_orphans == 0);
127e670a
JK
257 sbi->n_orphans--;
258 break;
259 }
260 }
261 mutex_unlock(&sbi->orphan_inode_mutex);
262}
263
264static void recover_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
265{
266 struct inode *inode = f2fs_iget(sbi->sb, ino);
5d56b671 267 f2fs_bug_on(IS_ERR(inode));
127e670a
JK
268 clear_nlink(inode);
269
270 /* truncate all the data during iput */
271 iput(inode);
272}
273
8f99a946 274void recover_orphan_inodes(struct f2fs_sb_info *sbi)
127e670a
JK
275{
276 block_t start_blk, orphan_blkaddr, i, j;
277
25ca923b 278 if (!is_set_ckpt_flags(F2FS_CKPT(sbi), CP_ORPHAN_PRESENT_FLAG))
8f99a946 279 return;
127e670a 280
aabe5136 281 sbi->por_doing = true;
127e670a
JK
282 start_blk = __start_cp_addr(sbi) + 1;
283 orphan_blkaddr = __start_sum_addr(sbi) - 1;
284
285 for (i = 0; i < orphan_blkaddr; i++) {
286 struct page *page = get_meta_page(sbi, start_blk + i);
287 struct f2fs_orphan_block *orphan_blk;
288
289 orphan_blk = (struct f2fs_orphan_block *)page_address(page);
290 for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) {
291 nid_t ino = le32_to_cpu(orphan_blk->ino[j]);
292 recover_orphan_inode(sbi, ino);
293 }
294 f2fs_put_page(page, 1);
295 }
296 /* clear Orphan Flag */
25ca923b 297 clear_ckpt_flags(F2FS_CKPT(sbi), CP_ORPHAN_PRESENT_FLAG);
aabe5136 298 sbi->por_doing = false;
8f99a946 299 return;
127e670a
JK
300}
301
302static void write_orphan_inodes(struct f2fs_sb_info *sbi, block_t start_blk)
303{
502c6e0b 304 struct list_head *head;
127e670a 305 struct f2fs_orphan_block *orphan_blk = NULL;
127e670a 306 unsigned int nentries = 0;
4531929e
GZ
307 unsigned short index;
308 unsigned short orphan_blocks = (unsigned short)((sbi->n_orphans +
309 (F2FS_ORPHANS_PER_BLOCK - 1)) / F2FS_ORPHANS_PER_BLOCK);
310 struct page *page = NULL;
311 struct page *pages[orphan_blocks];
502c6e0b 312 struct orphan_inode_entry *orphan = NULL;
127e670a 313
4531929e
GZ
314 for (index = 0; index < orphan_blocks; index++)
315 pages[index] = grab_meta_page(sbi, start_blk + index);
127e670a 316
4531929e 317 index = 1;
127e670a
JK
318 mutex_lock(&sbi->orphan_inode_mutex);
319 head = &sbi->orphan_inode_list;
320
321 /* loop for each orphan inode entry and write them in Jornal block */
502c6e0b
GZ
322 list_for_each_entry(orphan, head, list) {
323 if (!page) {
4531929e 324 page = pages[index - 1];
502c6e0b
GZ
325 orphan_blk =
326 (struct f2fs_orphan_block *)page_address(page);
327 memset(orphan_blk, 0, sizeof(*orphan_blk));
328 }
127e670a 329
36795567 330 orphan_blk->ino[nentries++] = cpu_to_le32(orphan->ino);
127e670a 331
36795567 332 if (nentries == F2FS_ORPHANS_PER_BLOCK) {
127e670a
JK
333 /*
334 * an orphan block is full of 1020 entries,
335 * then we need to flush current orphan blocks
336 * and bring another one in memory
337 */
338 orphan_blk->blk_addr = cpu_to_le16(index);
339 orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
340 orphan_blk->entry_count = cpu_to_le32(nentries);
341 set_page_dirty(page);
342 f2fs_put_page(page, 1);
343 index++;
127e670a
JK
344 nentries = 0;
345 page = NULL;
346 }
502c6e0b 347 }
127e670a 348
502c6e0b
GZ
349 if (page) {
350 orphan_blk->blk_addr = cpu_to_le16(index);
351 orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
352 orphan_blk->entry_count = cpu_to_le32(nentries);
353 set_page_dirty(page);
354 f2fs_put_page(page, 1);
127e670a 355 }
502c6e0b 356
127e670a
JK
357 mutex_unlock(&sbi->orphan_inode_mutex);
358}
359
360static struct page *validate_checkpoint(struct f2fs_sb_info *sbi,
361 block_t cp_addr, unsigned long long *version)
362{
363 struct page *cp_page_1, *cp_page_2 = NULL;
364 unsigned long blk_size = sbi->blocksize;
365 struct f2fs_checkpoint *cp_block;
366 unsigned long long cur_version = 0, pre_version = 0;
127e670a 367 size_t crc_offset;
7e586fa0 368 __u32 crc = 0;
127e670a
JK
369
370 /* Read the 1st cp block in this CP pack */
371 cp_page_1 = get_meta_page(sbi, cp_addr);
372
373 /* get the version number */
374 cp_block = (struct f2fs_checkpoint *)page_address(cp_page_1);
375 crc_offset = le32_to_cpu(cp_block->checksum_offset);
376 if (crc_offset >= blk_size)
377 goto invalid_cp1;
378
7e586fa0 379 crc = le32_to_cpu(*((__u32 *)((unsigned char *)cp_block + crc_offset)));
127e670a
JK
380 if (!f2fs_crc_valid(crc, cp_block, crc_offset))
381 goto invalid_cp1;
382
d71b5564 383 pre_version = cur_cp_version(cp_block);
127e670a
JK
384
385 /* Read the 2nd cp block in this CP pack */
25ca923b 386 cp_addr += le32_to_cpu(cp_block->cp_pack_total_block_count) - 1;
127e670a
JK
387 cp_page_2 = get_meta_page(sbi, cp_addr);
388
389 cp_block = (struct f2fs_checkpoint *)page_address(cp_page_2);
390 crc_offset = le32_to_cpu(cp_block->checksum_offset);
391 if (crc_offset >= blk_size)
392 goto invalid_cp2;
393
7e586fa0 394 crc = le32_to_cpu(*((__u32 *)((unsigned char *)cp_block + crc_offset)));
127e670a
JK
395 if (!f2fs_crc_valid(crc, cp_block, crc_offset))
396 goto invalid_cp2;
397
d71b5564 398 cur_version = cur_cp_version(cp_block);
127e670a
JK
399
400 if (cur_version == pre_version) {
401 *version = cur_version;
402 f2fs_put_page(cp_page_2, 1);
403 return cp_page_1;
404 }
405invalid_cp2:
406 f2fs_put_page(cp_page_2, 1);
407invalid_cp1:
408 f2fs_put_page(cp_page_1, 1);
409 return NULL;
410}
411
412int get_valid_checkpoint(struct f2fs_sb_info *sbi)
413{
414 struct f2fs_checkpoint *cp_block;
415 struct f2fs_super_block *fsb = sbi->raw_super;
416 struct page *cp1, *cp2, *cur_page;
417 unsigned long blk_size = sbi->blocksize;
418 unsigned long long cp1_version = 0, cp2_version = 0;
419 unsigned long long cp_start_blk_no;
420
421 sbi->ckpt = kzalloc(blk_size, GFP_KERNEL);
422 if (!sbi->ckpt)
423 return -ENOMEM;
424 /*
425 * Finding out valid cp block involves read both
426 * sets( cp pack1 and cp pack 2)
427 */
428 cp_start_blk_no = le32_to_cpu(fsb->cp_blkaddr);
429 cp1 = validate_checkpoint(sbi, cp_start_blk_no, &cp1_version);
430
431 /* The second checkpoint pack should start at the next segment */
f9a4e6df
JK
432 cp_start_blk_no += ((unsigned long long)1) <<
433 le32_to_cpu(fsb->log_blocks_per_seg);
127e670a
JK
434 cp2 = validate_checkpoint(sbi, cp_start_blk_no, &cp2_version);
435
436 if (cp1 && cp2) {
437 if (ver_after(cp2_version, cp1_version))
438 cur_page = cp2;
439 else
440 cur_page = cp1;
441 } else if (cp1) {
442 cur_page = cp1;
443 } else if (cp2) {
444 cur_page = cp2;
445 } else {
446 goto fail_no_cp;
447 }
448
449 cp_block = (struct f2fs_checkpoint *)page_address(cur_page);
450 memcpy(sbi->ckpt, cp_block, blk_size);
451
452 f2fs_put_page(cp1, 1);
453 f2fs_put_page(cp2, 1);
454 return 0;
455
456fail_no_cp:
457 kfree(sbi->ckpt);
458 return -EINVAL;
459}
460
5deb8267 461static int __add_dirty_inode(struct inode *inode, struct dir_inode_entry *new)
127e670a
JK
462{
463 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
464 struct list_head *head = &sbi->dir_inode_list;
127e670a
JK
465 struct list_head *this;
466
5deb8267
JK
467 list_for_each(this, head) {
468 struct dir_inode_entry *entry;
469 entry = list_entry(this, struct dir_inode_entry, list);
6bacf52f 470 if (unlikely(entry->inode == inode))
5deb8267
JK
471 return -EEXIST;
472 }
473 list_add_tail(&new->list, head);
dcdfff65 474 stat_inc_dirty_dir(sbi);
5deb8267
JK
475 return 0;
476}
477
478void set_dirty_dir_page(struct inode *inode, struct page *page)
479{
480 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
481 struct dir_inode_entry *new;
482
127e670a
JK
483 if (!S_ISDIR(inode->i_mode))
484 return;
7bd59381
GZ
485
486 new = f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
127e670a
JK
487 new->inode = inode;
488 INIT_LIST_HEAD(&new->list);
489
490 spin_lock(&sbi->dir_inode_lock);
5deb8267
JK
491 if (__add_dirty_inode(inode, new))
492 kmem_cache_free(inode_entry_slab, new);
127e670a 493
127e670a
JK
494 inc_page_count(sbi, F2FS_DIRTY_DENTS);
495 inode_inc_dirty_dents(inode);
496 SetPagePrivate(page);
5deb8267
JK
497 spin_unlock(&sbi->dir_inode_lock);
498}
499
500void add_dirty_dir_inode(struct inode *inode)
501{
502 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
7bd59381
GZ
503 struct dir_inode_entry *new =
504 f2fs_kmem_cache_alloc(inode_entry_slab, GFP_NOFS);
505
5deb8267
JK
506 new->inode = inode;
507 INIT_LIST_HEAD(&new->list);
127e670a 508
5deb8267
JK
509 spin_lock(&sbi->dir_inode_lock);
510 if (__add_dirty_inode(inode, new))
511 kmem_cache_free(inode_entry_slab, new);
127e670a
JK
512 spin_unlock(&sbi->dir_inode_lock);
513}
514
515void remove_dirty_dir_inode(struct inode *inode)
516{
517 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
ce3b7d80
GZ
518
519 struct list_head *this, *head;
127e670a
JK
520
521 if (!S_ISDIR(inode->i_mode))
522 return;
523
524 spin_lock(&sbi->dir_inode_lock);
3b10b1fd
JK
525 if (atomic_read(&F2FS_I(inode)->dirty_dents)) {
526 spin_unlock(&sbi->dir_inode_lock);
527 return;
528 }
127e670a 529
ce3b7d80 530 head = &sbi->dir_inode_list;
127e670a
JK
531 list_for_each(this, head) {
532 struct dir_inode_entry *entry;
533 entry = list_entry(this, struct dir_inode_entry, list);
534 if (entry->inode == inode) {
535 list_del(&entry->list);
536 kmem_cache_free(inode_entry_slab, entry);
dcdfff65 537 stat_dec_dirty_dir(sbi);
127e670a
JK
538 break;
539 }
540 }
127e670a 541 spin_unlock(&sbi->dir_inode_lock);
74d0b917
JK
542
543 /* Only from the recovery routine */
afc3eda2
JK
544 if (is_inode_flag_set(F2FS_I(inode), FI_DELAY_IPUT)) {
545 clear_inode_flag(F2FS_I(inode), FI_DELAY_IPUT);
74d0b917 546 iput(inode);
afc3eda2 547 }
74d0b917
JK
548}
549
550struct inode *check_dirty_dir_inode(struct f2fs_sb_info *sbi, nid_t ino)
551{
ce3b7d80
GZ
552
553 struct list_head *this, *head;
74d0b917
JK
554 struct inode *inode = NULL;
555
556 spin_lock(&sbi->dir_inode_lock);
ce3b7d80
GZ
557
558 head = &sbi->dir_inode_list;
74d0b917
JK
559 list_for_each(this, head) {
560 struct dir_inode_entry *entry;
561 entry = list_entry(this, struct dir_inode_entry, list);
562 if (entry->inode->i_ino == ino) {
563 inode = entry->inode;
564 break;
565 }
566 }
567 spin_unlock(&sbi->dir_inode_lock);
568 return inode;
127e670a
JK
569}
570
571void sync_dirty_dir_inodes(struct f2fs_sb_info *sbi)
572{
ce3b7d80 573 struct list_head *head;
127e670a
JK
574 struct dir_inode_entry *entry;
575 struct inode *inode;
576retry:
577 spin_lock(&sbi->dir_inode_lock);
ce3b7d80
GZ
578
579 head = &sbi->dir_inode_list;
127e670a
JK
580 if (list_empty(head)) {
581 spin_unlock(&sbi->dir_inode_lock);
582 return;
583 }
584 entry = list_entry(head->next, struct dir_inode_entry, list);
585 inode = igrab(entry->inode);
586 spin_unlock(&sbi->dir_inode_lock);
587 if (inode) {
588 filemap_flush(inode->i_mapping);
589 iput(inode);
590 } else {
591 /*
592 * We should submit bio, since it exists several
593 * wribacking dentry pages in the freeing inode.
594 */
458e6197 595 f2fs_submit_merged_bio(sbi, DATA, WRITE);
127e670a
JK
596 }
597 goto retry;
598}
599
0a8165d7 600/*
127e670a
JK
601 * Freeze all the FS-operations for checkpoint.
602 */
43727527 603static void block_operations(struct f2fs_sb_info *sbi)
127e670a 604{
127e670a
JK
605 struct writeback_control wbc = {
606 .sync_mode = WB_SYNC_ALL,
607 .nr_to_write = LONG_MAX,
608 .for_reclaim = 0,
609 };
c718379b
JK
610 struct blk_plug plug;
611
612 blk_start_plug(&plug);
613
39936837 614retry_flush_dents:
e479556b 615 f2fs_lock_all(sbi);
127e670a 616 /* write all the dirty dentry pages */
127e670a 617 if (get_pages(sbi, F2FS_DIRTY_DENTS)) {
e479556b 618 f2fs_unlock_all(sbi);
39936837
JK
619 sync_dirty_dir_inodes(sbi);
620 goto retry_flush_dents;
127e670a
JK
621 }
622
127e670a
JK
623 /*
624 * POR: we should ensure that there is no dirty node pages
625 * until finishing nat/sit flush.
626 */
39936837
JK
627retry_flush_nodes:
628 mutex_lock(&sbi->node_write);
127e670a
JK
629
630 if (get_pages(sbi, F2FS_DIRTY_NODES)) {
39936837
JK
631 mutex_unlock(&sbi->node_write);
632 sync_node_pages(sbi, 0, &wbc);
633 goto retry_flush_nodes;
127e670a 634 }
c718379b 635 blk_finish_plug(&plug);
127e670a
JK
636}
637
638static void unblock_operations(struct f2fs_sb_info *sbi)
639{
39936837 640 mutex_unlock(&sbi->node_write);
e479556b 641 f2fs_unlock_all(sbi);
127e670a
JK
642}
643
fb51b5ef
CL
644static void wait_on_all_pages_writeback(struct f2fs_sb_info *sbi)
645{
646 DEFINE_WAIT(wait);
647
648 for (;;) {
649 prepare_to_wait(&sbi->cp_wait, &wait, TASK_UNINTERRUPTIBLE);
650
651 if (!get_pages(sbi, F2FS_WRITEBACK))
652 break;
653
654 io_schedule();
655 }
656 finish_wait(&sbi->cp_wait, &wait);
657}
658
127e670a
JK
659static void do_checkpoint(struct f2fs_sb_info *sbi, bool is_umount)
660{
661 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
662 nid_t last_nid = 0;
663 block_t start_blk;
664 struct page *cp_page;
665 unsigned int data_sum_blocks, orphan_blocks;
7e586fa0 666 __u32 crc32 = 0;
127e670a 667 void *kaddr;
127e670a
JK
668 int i;
669
670 /* Flush all the NAT/SIT pages */
671 while (get_pages(sbi, F2FS_DIRTY_META))
672 sync_meta_pages(sbi, META, LONG_MAX);
673
674 next_free_nid(sbi, &last_nid);
675
676 /*
677 * modify checkpoint
678 * version number is already updated
679 */
680 ckpt->elapsed_time = cpu_to_le64(get_mtime(sbi));
681 ckpt->valid_block_count = cpu_to_le64(valid_user_blocks(sbi));
682 ckpt->free_segment_count = cpu_to_le32(free_segments(sbi));
683 for (i = 0; i < 3; i++) {
684 ckpt->cur_node_segno[i] =
685 cpu_to_le32(curseg_segno(sbi, i + CURSEG_HOT_NODE));
686 ckpt->cur_node_blkoff[i] =
687 cpu_to_le16(curseg_blkoff(sbi, i + CURSEG_HOT_NODE));
688 ckpt->alloc_type[i + CURSEG_HOT_NODE] =
689 curseg_alloc_type(sbi, i + CURSEG_HOT_NODE);
690 }
691 for (i = 0; i < 3; i++) {
692 ckpt->cur_data_segno[i] =
693 cpu_to_le32(curseg_segno(sbi, i + CURSEG_HOT_DATA));
694 ckpt->cur_data_blkoff[i] =
695 cpu_to_le16(curseg_blkoff(sbi, i + CURSEG_HOT_DATA));
696 ckpt->alloc_type[i + CURSEG_HOT_DATA] =
697 curseg_alloc_type(sbi, i + CURSEG_HOT_DATA);
698 }
699
700 ckpt->valid_node_count = cpu_to_le32(valid_node_count(sbi));
701 ckpt->valid_inode_count = cpu_to_le32(valid_inode_count(sbi));
702 ckpt->next_free_nid = cpu_to_le32(last_nid);
703
704 /* 2 cp + n data seg summary + orphan inode blocks */
705 data_sum_blocks = npages_for_summary_flush(sbi);
706 if (data_sum_blocks < 3)
25ca923b 707 set_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
127e670a 708 else
25ca923b 709 clear_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
127e670a
JK
710
711 orphan_blocks = (sbi->n_orphans + F2FS_ORPHANS_PER_BLOCK - 1)
712 / F2FS_ORPHANS_PER_BLOCK;
25ca923b 713 ckpt->cp_pack_start_sum = cpu_to_le32(1 + orphan_blocks);
127e670a
JK
714
715 if (is_umount) {
25ca923b
JK
716 set_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
717 ckpt->cp_pack_total_block_count = cpu_to_le32(2 +
718 data_sum_blocks + orphan_blocks + NR_CURSEG_NODE_TYPE);
127e670a 719 } else {
25ca923b
JK
720 clear_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
721 ckpt->cp_pack_total_block_count = cpu_to_le32(2 +
722 data_sum_blocks + orphan_blocks);
127e670a
JK
723 }
724
725 if (sbi->n_orphans)
25ca923b 726 set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
127e670a 727 else
25ca923b 728 clear_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
127e670a
JK
729
730 /* update SIT/NAT bitmap */
731 get_sit_bitmap(sbi, __bitmap_ptr(sbi, SIT_BITMAP));
732 get_nat_bitmap(sbi, __bitmap_ptr(sbi, NAT_BITMAP));
733
734 crc32 = f2fs_crc32(ckpt, le32_to_cpu(ckpt->checksum_offset));
7e586fa0
JK
735 *((__le32 *)((unsigned char *)ckpt +
736 le32_to_cpu(ckpt->checksum_offset)))
127e670a
JK
737 = cpu_to_le32(crc32);
738
739 start_blk = __start_cp_addr(sbi);
740
741 /* write out checkpoint buffer at block 0 */
742 cp_page = grab_meta_page(sbi, start_blk++);
743 kaddr = page_address(cp_page);
744 memcpy(kaddr, ckpt, (1 << sbi->log_blocksize));
745 set_page_dirty(cp_page);
746 f2fs_put_page(cp_page, 1);
747
748 if (sbi->n_orphans) {
749 write_orphan_inodes(sbi, start_blk);
750 start_blk += orphan_blocks;
751 }
752
753 write_data_summaries(sbi, start_blk);
754 start_blk += data_sum_blocks;
755 if (is_umount) {
756 write_node_summaries(sbi, start_blk);
757 start_blk += NR_CURSEG_NODE_TYPE;
758 }
759
760 /* writeout checkpoint block */
761 cp_page = grab_meta_page(sbi, start_blk);
762 kaddr = page_address(cp_page);
763 memcpy(kaddr, ckpt, (1 << sbi->log_blocksize));
764 set_page_dirty(cp_page);
765 f2fs_put_page(cp_page, 1);
766
767 /* wait for previous submitted node/meta pages writeback */
fb51b5ef 768 wait_on_all_pages_writeback(sbi);
127e670a
JK
769
770 filemap_fdatawait_range(sbi->node_inode->i_mapping, 0, LONG_MAX);
771 filemap_fdatawait_range(sbi->meta_inode->i_mapping, 0, LONG_MAX);
772
773 /* update user_block_counts */
774 sbi->last_valid_block_count = sbi->total_valid_block_count;
775 sbi->alloc_valid_block_count = 0;
776
777 /* Here, we only have one bio having CP pack */
577e3495 778 sync_meta_pages(sbi, META_FLUSH, LONG_MAX);
127e670a 779
6bacf52f 780 if (unlikely(!is_set_ckpt_flags(ckpt, CP_ERROR_FLAG))) {
577e3495
JK
781 clear_prefree_segments(sbi);
782 F2FS_RESET_SB_DIRT(sbi);
783 }
127e670a
JK
784}
785
0a8165d7 786/*
127e670a
JK
787 * We guarantee that this checkpoint procedure should not fail.
788 */
43727527 789void write_checkpoint(struct f2fs_sb_info *sbi, bool is_umount)
127e670a
JK
790{
791 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
792 unsigned long long ckpt_ver;
793
2af4bd6c
NJ
794 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "start block_ops");
795
43727527
JK
796 mutex_lock(&sbi->cp_mutex);
797 block_operations(sbi);
127e670a 798
2af4bd6c
NJ
799 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "finish block_ops");
800
458e6197
JK
801 f2fs_submit_merged_bio(sbi, DATA, WRITE);
802 f2fs_submit_merged_bio(sbi, NODE, WRITE);
803 f2fs_submit_merged_bio(sbi, META, WRITE);
127e670a
JK
804
805 /*
806 * update checkpoint pack index
807 * Increase the version number so that
808 * SIT entries and seg summaries are written at correct place
809 */
d71b5564 810 ckpt_ver = cur_cp_version(ckpt);
127e670a
JK
811 ckpt->checkpoint_ver = cpu_to_le64(++ckpt_ver);
812
813 /* write cached NAT/SIT entries to NAT/SIT area */
814 flush_nat_entries(sbi);
815 flush_sit_entries(sbi);
816
127e670a
JK
817 /* unlock all the fs_lock[] in do_checkpoint() */
818 do_checkpoint(sbi, is_umount);
819
820 unblock_operations(sbi);
821 mutex_unlock(&sbi->cp_mutex);
2af4bd6c
NJ
822
823 trace_f2fs_write_checkpoint(sbi->sb, is_umount, "finish checkpoint");
127e670a
JK
824}
825
826void init_orphan_info(struct f2fs_sb_info *sbi)
827{
828 mutex_init(&sbi->orphan_inode_mutex);
829 INIT_LIST_HEAD(&sbi->orphan_inode_list);
830 sbi->n_orphans = 0;
0d47c1ad
GZ
831 /*
832 * considering 512 blocks in a segment 8 blocks are needed for cp
833 * and log segment summaries. Remaining blocks are used to keep
834 * orphan entries with the limitation one reserved segment
835 * for cp pack we can have max 1020*504 orphan entries
836 */
837 sbi->max_orphans = (sbi->blocks_per_seg - 2 - NR_CURSEG_TYPE)
838 * F2FS_ORPHANS_PER_BLOCK;
127e670a
JK
839}
840
6e6093a8 841int __init create_checkpoint_caches(void)
127e670a
JK
842{
843 orphan_entry_slab = f2fs_kmem_cache_create("f2fs_orphan_entry",
844 sizeof(struct orphan_inode_entry), NULL);
6bacf52f 845 if (!orphan_entry_slab)
127e670a
JK
846 return -ENOMEM;
847 inode_entry_slab = f2fs_kmem_cache_create("f2fs_dirty_dir_entry",
848 sizeof(struct dir_inode_entry), NULL);
6bacf52f 849 if (!inode_entry_slab) {
127e670a
JK
850 kmem_cache_destroy(orphan_entry_slab);
851 return -ENOMEM;
852 }
853 return 0;
854}
855
856void destroy_checkpoint_caches(void)
857{
858 kmem_cache_destroy(orphan_entry_slab);
859 kmem_cache_destroy(inode_entry_slab);
860}