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