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