projects / GitHub / MotorolaMobilityLLC / kernel-slsi.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
f2fs: call sync_fs when f2fs is idle
[GitHub/MotorolaMobilityLLC/kernel-slsi.git] / fs / f2fs / segment.c
CommitLineData
0a8165d7 1/*
351df4b2
JK		 2 * fs/f2fs/segment.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/f2fs_fs.h>
13#include <linux/bio.h>
14#include <linux/blkdev.h>
690e4a3e 15#include <linux/prefetch.h>
6b4afdd7 16#include <linux/kthread.h>
74de593a 17#include <linux/swap.h>
60b99b48 18#include <linux/timer.h>
351df4b2
JK		 19
20#include "f2fs.h"
21#include "segment.h"
22#include "node.h"
9e4ded3f 23#include "trace.h"
6ec178da 24#include <trace/events/f2fs.h>
351df4b2 25
9a7f143a
CL		 26#define __reverse_ffz(x) __reverse_ffs(~(x))
27
7fd9e544 28static struct kmem_cache *discard_entry_slab;
275b66b0 29static struct kmem_cache *bio_entry_slab;
184a5cd2 30static struct kmem_cache *sit_entry_set_slab;
88b88a66 31static struct kmem_cache *inmem_entry_slab;
7fd9e544 32
f96999c3
JK		 33static unsigned long __reverse_ulong(unsigned char *str)
34{
35 unsigned long tmp = 0;
36 int shift = 24, idx = 0;
37
38#if BITS_PER_LONG == 64
39 shift = 56;
40#endif
41 while (shift >= 0) {
42 tmp |= (unsigned long)str[idx++] << shift;
43 shift -= BITS_PER_BYTE;
44 }
45 return tmp;
46}
47
9a7f143a
CL		 48/*
49 * __reverse_ffs is copied from include/asm-generic/bitops/__ffs.h since
50 * MSB and LSB are reversed in a byte by f2fs_set_bit.
51 */
52static inline unsigned long __reverse_ffs(unsigned long word)
53{
54 int num = 0;
55
56#if BITS_PER_LONG == 64
f96999c3 57 if ((word & 0xffffffff00000000UL) == 0)
9a7f143a 58 num += 32;
f96999c3 59 else
9a7f143a 60 word >>= 32;
9a7f143a 61#endif
f96999c3 62 if ((word & 0xffff0000) == 0)
9a7f143a 63 num += 16;
f96999c3 64 else
9a7f143a 65 word >>= 16;
f96999c3
JK		 66
67 if ((word & 0xff00) == 0)
9a7f143a 68 num += 8;
f96999c3 69 else
9a7f143a 70 word >>= 8;
f96999c3 71
9a7f143a
CL		 72 if ((word & 0xf0) == 0)
73 num += 4;
74 else
75 word >>= 4;
f96999c3 76
9a7f143a
CL		 77 if ((word & 0xc) == 0)
78 num += 2;
79 else
80 word >>= 2;
f96999c3 81
9a7f143a
CL		 82 if ((word & 0x2) == 0)
83 num += 1;
84 return num;
85}
86
87/*
e1c42045 88 * __find_rev_next(_zero)_bit is copied from lib/find_next_bit.c because
9a7f143a 89 * f2fs_set_bit makes MSB and LSB reversed in a byte.
692223d1 90 * @size must be integral times of unsigned long.
9a7f143a 91 * Example:
f96999c3
JK		 92 * MSB <--> LSB
93 * f2fs_set_bit(0, bitmap) => 1000 0000
94 * f2fs_set_bit(7, bitmap) => 0000 0001
9a7f143a
CL		 95 */
96static unsigned long __find_rev_next_bit(const unsigned long *addr,
97 unsigned long size, unsigned long offset)
98{
99 const unsigned long *p = addr + BIT_WORD(offset);
692223d1 100 unsigned long result = size;
9a7f143a 101 unsigned long tmp;
9a7f143a
CL		 102
103 if (offset >= size)
104 return size;
105
692223d1 106 size -= (offset & ~(BITS_PER_LONG - 1));
9a7f143a 107 offset %= BITS_PER_LONG;
f96999c3 108
692223d1
FL		 109 while (1) {
110 if (*p == 0)
111 goto pass;
9a7f143a 112
f96999c3 113 tmp = __reverse_ulong((unsigned char *)p);
692223d1
FL		 114
115 tmp &= ~0UL >> offset;
116 if (size < BITS_PER_LONG)
117 tmp &= (~0UL << (BITS_PER_LONG - size));
9a7f143a 118 if (tmp)
692223d1
FL		 119 goto found;
120pass:
121 if (size <= BITS_PER_LONG)
122 break;
9a7f143a 123 size -= BITS_PER_LONG;
692223d1 124 offset = 0;
f96999c3 125 p++;
9a7f143a 126 }
692223d1
FL		 127 return result;
128found:
129 return result - size + __reverse_ffs(tmp);
9a7f143a
CL		 130}
131
132static unsigned long __find_rev_next_zero_bit(const unsigned long *addr,
133 unsigned long size, unsigned long offset)
134{
135 const unsigned long *p = addr + BIT_WORD(offset);
80609448 136 unsigned long result = size;
9a7f143a 137 unsigned long tmp;
9a7f143a
CL		 138
139 if (offset >= size)
140 return size;
141
80609448 142 size -= (offset & ~(BITS_PER_LONG - 1));
9a7f143a 143 offset %= BITS_PER_LONG;
80609448
JK		 144
145 while (1) {
146 if (*p == ~0UL)
147 goto pass;
148
f96999c3 149 tmp = __reverse_ulong((unsigned char *)p);
80609448
JK		 150
151 if (offset)
152 tmp |= ~0UL << (BITS_PER_LONG - offset);
153 if (size < BITS_PER_LONG)
154 tmp |= ~0UL >> size;
f96999c3 155 if (tmp != ~0UL)
80609448
JK		 156 goto found;
157pass:
158 if (size <= BITS_PER_LONG)
159 break;
9a7f143a 160 size -= BITS_PER_LONG;
80609448 161 offset = 0;
f96999c3 162 p++;
9a7f143a 163 }
80609448
JK		 164 return result;
165found:
166 return result - size + __reverse_ffz(tmp);
9a7f143a
CL		 167}
168
88b88a66
JK		 169void register_inmem_page(struct inode *inode, struct page *page)
170{
171 struct f2fs_inode_info *fi = F2FS_I(inode);
172 struct inmem_pages *new;
9be32d72 173
9e4ded3f 174 f2fs_trace_pid(page);
0722b101 175
decd36b6
CY		 176 set_page_private(page, (unsigned long)ATOMIC_WRITTEN_PAGE);
177 SetPagePrivate(page);
178
88b88a66
JK		 179 new = f2fs_kmem_cache_alloc(inmem_entry_slab, GFP_NOFS);
180
181 /* add atomic page indices to the list */
182 new->page = page;
183 INIT_LIST_HEAD(&new->list);
decd36b6 184
88b88a66
JK		 185 /* increase reference count with clean state */
186 mutex_lock(&fi->inmem_lock);
187 get_page(page);
188 list_add_tail(&new->list, &fi->inmem_pages);
8dcf2ff7 189 inc_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
88b88a66 190 mutex_unlock(&fi->inmem_lock);
8ce67cb0
JK		 191
192 trace_f2fs_register_inmem_page(page, INMEM);
88b88a66
JK		 193}
194
28bc106b
CY		 195static int __revoke_inmem_pages(struct inode *inode,
196 struct list_head *head, bool drop, bool recover)
29b96b54 197{
28bc106b 198 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
29b96b54 199 struct inmem_pages *cur, *tmp;
28bc106b 200 int err = 0;
29b96b54
CY		 201
202 list_for_each_entry_safe(cur, tmp, head, list) {
28bc106b
CY		 203 struct page *page = cur->page;
204
205 if (drop)
206 trace_f2fs_commit_inmem_page(page, INMEM_DROP);
207
208 lock_page(page);
29b96b54 209
28bc106b
CY		 210 if (recover) {
211 struct dnode_of_data dn;
212 struct node_info ni;
213
214 trace_f2fs_commit_inmem_page(page, INMEM_REVOKE);
215
216 set_new_dnode(&dn, inode, NULL, NULL, 0);
217 if (get_dnode_of_data(&dn, page->index, LOOKUP_NODE)) {
218 err = -EAGAIN;
219 goto next;
220 }
221 get_node_info(sbi, dn.nid, &ni);
222 f2fs_replace_block(sbi, &dn, dn.data_blkaddr,
223 cur->old_addr, ni.version, true, true);
224 f2fs_put_dnode(&dn);
225 }
226next:
63c52d78
JK		 227 /* we don't need to invalidate this in the sccessful status */
228 if (drop || recover)
229 ClearPageUptodate(page);
28bc106b 230 set_page_private(page, 0);
c81ced05 231 ClearPagePrivate(page);
28bc106b 232 f2fs_put_page(page, 1);
29b96b54
CY		 233
234 list_del(&cur->list);
235 kmem_cache_free(inmem_entry_slab, cur);
236 dec_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
237 }
28bc106b 238 return err;
29b96b54
CY		 239}
240
241void drop_inmem_pages(struct inode *inode)
242{
243 struct f2fs_inode_info *fi = F2FS_I(inode);
244
91942321 245 clear_inode_flag(inode, FI_ATOMIC_FILE);
26dc3d44 246
29b96b54 247 mutex_lock(&fi->inmem_lock);
28bc106b 248 __revoke_inmem_pages(inode, &fi->inmem_pages, true, false);
29b96b54
CY		 249 mutex_unlock(&fi->inmem_lock);
250}
251
28bc106b
CY		 252static int __commit_inmem_pages(struct inode *inode,
253 struct list_head *revoke_list)
88b88a66
JK		 254{
255 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
256 struct f2fs_inode_info *fi = F2FS_I(inode);
257 struct inmem_pages *cur, *tmp;
88b88a66 258 struct f2fs_io_info fio = {
05ca3632 259 .sbi = sbi,
88b88a66 260 .type = DATA,
04d328de
MC		 261 .op = REQ_OP_WRITE,
262 .op_flags = WRITE_SYNC | REQ_PRIO,
4375a336 263 .encrypted_page = NULL,
88b88a66 264 };
29b96b54 265 bool submit_bio = false;
edb27dee 266 int err = 0;
88b88a66 267
88b88a66 268 list_for_each_entry_safe(cur, tmp, &fi->inmem_pages, list) {
28bc106b
CY		 269 struct page *page = cur->page;
270
271 lock_page(page);
272 if (page->mapping == inode->i_mapping) {
273 trace_f2fs_commit_inmem_page(page, INMEM);
274
275 set_page_dirty(page);
276 f2fs_wait_on_page_writeback(page, DATA, true);
933439c8 277 if (clear_page_dirty_for_io(page)) {
29b96b54 278 inode_dec_dirty_pages(inode);
933439c8
CY		 279 remove_dirty_inode(inode);
280 }
28bc106b
CY		 281
282 fio.page = page;
29b96b54
CY		 283 err = do_write_data_page(&fio);
284 if (err) {
28bc106b 285 unlock_page(page);
29b96b54 286 break;
70c640b1 287 }
29b96b54 288
28bc106b
CY		 289 /* record old blkaddr for revoking */
290 cur->old_addr = fio.old_blkaddr;
decd36b6 291
28bc106b
CY		 292 submit_bio = true;
293 }
294 unlock_page(page);
295 list_move_tail(&cur->list, revoke_list);
88b88a66 296 }
29b96b54
CY		 297
298 if (submit_bio)
299 f2fs_submit_merged_bio_cond(sbi, inode, NULL, 0, DATA, WRITE);
28bc106b
CY		 300
301 if (!err)
302 __revoke_inmem_pages(inode, revoke_list, false, false);
303
29b96b54
CY		 304 return err;
305}
306
307int commit_inmem_pages(struct inode *inode)
308{
309 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
310 struct f2fs_inode_info *fi = F2FS_I(inode);
28bc106b
CY		 311 struct list_head revoke_list;
312 int err;
29b96b54 313
28bc106b 314 INIT_LIST_HEAD(&revoke_list);
29b96b54
CY		 315 f2fs_balance_fs(sbi, true);
316 f2fs_lock_op(sbi);
317
318 mutex_lock(&fi->inmem_lock);
28bc106b
CY		 319 err = __commit_inmem_pages(inode, &revoke_list);
320 if (err) {
321 int ret;
322 /*
323 * try to revoke all committed pages, but still we could fail
324 * due to no memory or other reason, if that happened, EAGAIN
325 * will be returned, which means in such case, transaction is
326 * already not integrity, caller should use journal to do the
327 * recovery or rewrite & commit last transaction. For other
328 * error number, revoking was done by filesystem itself.
329 */
330 ret = __revoke_inmem_pages(inode, &revoke_list, false, true);
331 if (ret)
332 err = ret;
333
334 /* drop all uncommitted pages */
335 __revoke_inmem_pages(inode, &fi->inmem_pages, true, false);
336 }
88b88a66
JK		 337 mutex_unlock(&fi->inmem_lock);
338
29b96b54 339 f2fs_unlock_op(sbi);
edb27dee 340 return err;
88b88a66
JK		 341}
342
0a8165d7 343/*
351df4b2
JK		 344 * This function balances dirty node and dentry pages.
345 * In addition, it controls garbage collection.
346 */
2c4db1a6 347void f2fs_balance_fs(struct f2fs_sb_info *sbi, bool need)
351df4b2 348{
0f348028
CY		 349#ifdef CONFIG_F2FS_FAULT_INJECTION
350 if (time_to_inject(sbi, FAULT_CHECKPOINT))
351 f2fs_stop_checkpoint(sbi, false);
352#endif
353
2c4db1a6
JK		 354 if (!need)
355 return;
e589c2c4
JK		 356
357 /* balance_fs_bg is able to be pending */
358 if (excess_cached_nats(sbi))
359 f2fs_balance_fs_bg(sbi);
360
351df4b2 361 /*
029cd28c
JK		 362 * We should do GC or end up with checkpoint, if there are so many dirty
363 * dir/node pages without enough free segments.
351df4b2 364 */
7f3037a5 365 if (has_not_enough_free_secs(sbi, 0, 0)) {
351df4b2 366 mutex_lock(&sbi->gc_mutex);
7702bdbe 367 f2fs_gc(sbi, false, false);
351df4b2
JK		 368 }
369}
370
4660f9c0
JK		 371void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi)
372{
1dcc336b 373 /* try to shrink extent cache when there is no enough memory */
554df79e
JK		 374 if (!available_free_memory(sbi, EXTENT_CACHE))
375 f2fs_shrink_extent_tree(sbi, EXTENT_CACHE_SHRINK_NUMBER);
1dcc336b 376
1b38dc8e
JK		 377 /* check the # of cached NAT entries */
378 if (!available_free_memory(sbi, NAT_ENTRIES))
379 try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK);
380
31696580 381 if (!available_free_memory(sbi, FREE_NIDS))
ad4edb83
JK		 382 try_to_free_nids(sbi, MAX_FREE_NIDS);
383 else
3a2ad567 384 build_free_nids(sbi, false);
31696580 385
f455c8a5
JK		 386 if (!is_idle(sbi))
387 return;
388
1b38dc8e
JK		 389 /* checkpoint is the only way to shrink partial cached entries */
390 if (!available_free_memory(sbi, NAT_ENTRIES) ||
60b99b48 391 !available_free_memory(sbi, INO_ENTRIES) ||
7d768d2c
CY		 392 excess_prefree_segs(sbi) ||
393 excess_dirty_nats(sbi) ||
f455c8a5 394 f2fs_time_over(sbi, CP_TIME)) {
e9f5b8b8
CY		 395 if (test_opt(sbi, DATA_FLUSH)) {
396 struct blk_plug plug;
397
398 blk_start_plug(&plug);
36b35a0d 399 sync_dirty_inodes(sbi, FILE_INODE);
e9f5b8b8
CY		 400 blk_finish_plug(&plug);
401 }
4660f9c0 402 f2fs_sync_fs(sbi->sb, true);
42190d2a 403 stat_inc_bg_cp_count(sbi->stat_info);
36b35a0d 404 }
4660f9c0
JK		 405}
406
3c62be17
JK		 407static int __submit_flush_wait(struct block_device *bdev)
408{
409 struct bio *bio = f2fs_bio_alloc(0);
410 int ret;
411
412 bio_set_op_attrs(bio, REQ_OP_WRITE, WRITE_FLUSH);
413 bio->bi_bdev = bdev;
414 ret = submit_bio_wait(bio);
415 bio_put(bio);
416 return ret;
417}
418
419static int submit_flush_wait(struct f2fs_sb_info *sbi)
420{
421 int ret = __submit_flush_wait(sbi->sb->s_bdev);
422 int i;
423
424 if (sbi->s_ndevs && !ret) {
425 for (i = 1; i < sbi->s_ndevs; i++) {
426 ret = __submit_flush_wait(FDEV(i).bdev);
427 if (ret)
428 break;
429 }
430 }
431 return ret;
432}
433
2163d198 434static int issue_flush_thread(void *data)
6b4afdd7
JK		 435{
436 struct f2fs_sb_info *sbi = data;
a688b9d9
GZ		 437 struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info;
438 wait_queue_head_t *q = &fcc->flush_wait_queue;
6b4afdd7
JK		 439repeat:
440 if (kthread_should_stop())
441 return 0;
442
721bd4d5 443 if (!llist_empty(&fcc->issue_list)) {
6b4afdd7
JK		 444 struct flush_cmd *cmd, *next;
445 int ret;
446
721bd4d5
GZ		 447 fcc->dispatch_list = llist_del_all(&fcc->issue_list);
448 fcc->dispatch_list = llist_reverse_order(fcc->dispatch_list);
449
3c62be17 450 ret = submit_flush_wait(sbi);
721bd4d5
GZ		 451 llist_for_each_entry_safe(cmd, next,
452 fcc->dispatch_list, llnode) {
6b4afdd7 453 cmd->ret = ret;
6b4afdd7
JK		 454 complete(&cmd->wait);
455 }
a688b9d9 456 fcc->dispatch_list = NULL;
6b4afdd7
JK		 457 }
458
a688b9d9 459 wait_event_interruptible(*q,
721bd4d5 460 kthread_should_stop() || !llist_empty(&fcc->issue_list));
6b4afdd7
JK		 461 goto repeat;
462}
463
464int f2fs_issue_flush(struct f2fs_sb_info *sbi)
465{
a688b9d9 466 struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info;
adf8d90b 467 struct flush_cmd cmd;
6b4afdd7 468
24a9ee0f
JK		 469 trace_f2fs_issue_flush(sbi->sb, test_opt(sbi, NOBARRIER),
470 test_opt(sbi, FLUSH_MERGE));
471
0f7b2abd
JK		 472 if (test_opt(sbi, NOBARRIER))
473 return 0;
474
0a87f664 475 if (!test_opt(sbi, FLUSH_MERGE) || !atomic_read(&fcc->submit_flush)) {
740432f8
JK		 476 int ret;
477
0a87f664 478 atomic_inc(&fcc->submit_flush);
3c62be17 479 ret = submit_flush_wait(sbi);
0a87f664 480 atomic_dec(&fcc->submit_flush);
740432f8
JK		 481 return ret;
482 }
6b4afdd7 483
adf8d90b 484 init_completion(&cmd.wait);
6b4afdd7 485
0a87f664 486 atomic_inc(&fcc->submit_flush);
721bd4d5 487 llist_add(&cmd.llnode, &fcc->issue_list);
6b4afdd7 488
a688b9d9
GZ		 489 if (!fcc->dispatch_list)
490 wake_up(&fcc->flush_wait_queue);
6b4afdd7 491
adf8d90b 492 wait_for_completion(&cmd.wait);
0a87f664 493 atomic_dec(&fcc->submit_flush);
adf8d90b
CY		 494
495 return cmd.ret;
6b4afdd7
JK		 496}
497
2163d198
GZ		 498int create_flush_cmd_control(struct f2fs_sb_info *sbi)
499{
500 dev_t dev = sbi->sb->s_bdev->bd_dev;
501 struct flush_cmd_control *fcc;
502 int err = 0;
503
504 fcc = kzalloc(sizeof(struct flush_cmd_control), GFP_KERNEL);
505 if (!fcc)
506 return -ENOMEM;
0a87f664 507 atomic_set(&fcc->submit_flush, 0);
2163d198 508 init_waitqueue_head(&fcc->flush_wait_queue);
721bd4d5 509 init_llist_head(&fcc->issue_list);
6b2920a5 510 SM_I(sbi)->cmd_control_info = fcc;
2163d198
GZ		 511 fcc->f2fs_issue_flush = kthread_run(issue_flush_thread, sbi,
512 "f2fs_flush-%u:%u", MAJOR(dev), MINOR(dev));
513 if (IS_ERR(fcc->f2fs_issue_flush)) {
514 err = PTR_ERR(fcc->f2fs_issue_flush);
515 kfree(fcc);
6b2920a5 516 SM_I(sbi)->cmd_control_info = NULL;
2163d198
GZ		 517 return err;
518 }
2163d198
GZ		 519
520 return err;
521}
522
523void destroy_flush_cmd_control(struct f2fs_sb_info *sbi)
524{
6b2920a5 525 struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info;
2163d198
GZ		 526
527 if (fcc && fcc->f2fs_issue_flush)
528 kthread_stop(fcc->f2fs_issue_flush);
529 kfree(fcc);
6b2920a5 530 SM_I(sbi)->cmd_control_info = NULL;
2163d198
GZ		 531}
532
351df4b2
JK		 533static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
534 enum dirty_type dirty_type)
535{
536 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
537
538 /* need not be added */
539 if (IS_CURSEG(sbi, segno))
540 return;
541
542 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type]))
543 dirty_i->nr_dirty[dirty_type]++;
544
545 if (dirty_type == DIRTY) {
546 struct seg_entry *sentry = get_seg_entry(sbi, segno);
4625d6aa 547 enum dirty_type t = sentry->type;
b2f2c390 548
ec325b52
JK		 549 if (unlikely(t >= DIRTY)) {
550 f2fs_bug_on(sbi, 1);
551 return;
552 }
4625d6aa
CL		 553 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t]))
554 dirty_i->nr_dirty[t]++;
351df4b2
JK		 555 }
556}
557
558static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
559 enum dirty_type dirty_type)
560{
561 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
562
563 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type]))
564 dirty_i->nr_dirty[dirty_type]--;
565
566 if (dirty_type == DIRTY) {
4625d6aa
CL		 567 struct seg_entry *sentry = get_seg_entry(sbi, segno);
568 enum dirty_type t = sentry->type;
569
570 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t]))
571 dirty_i->nr_dirty[t]--;
b2f2c390 572
5ec4e49f
JK		 573 if (get_valid_blocks(sbi, segno, sbi->segs_per_sec) == 0)
574 clear_bit(GET_SECNO(sbi, segno),
575 dirty_i->victim_secmap);
351df4b2
JK		 576 }
577}
578
0a8165d7 579/*
351df4b2
JK		 580 * Should not occur error such as -ENOMEM.
581 * Adding dirty entry into seglist is not critical operation.
582 * If a given segment is one of current working segments, it won't be added.
583 */
8d8451af 584static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK		 585{
586 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
587 unsigned short valid_blocks;
588
589 if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno))
590 return;
591
592 mutex_lock(&dirty_i->seglist_lock);
593
594 valid_blocks = get_valid_blocks(sbi, segno, 0);
595
596 if (valid_blocks == 0) {
597 __locate_dirty_segment(sbi, segno, PRE);
598 __remove_dirty_segment(sbi, segno, DIRTY);
599 } else if (valid_blocks < sbi->blocks_per_seg) {
600 __locate_dirty_segment(sbi, segno, DIRTY);
601 } else {
602 /* Recovery routine with SSR needs this */
603 __remove_dirty_segment(sbi, segno, DIRTY);
604 }
605
606 mutex_unlock(&dirty_i->seglist_lock);
351df4b2
JK		 607}
608
275b66b0
CY		 609static struct bio_entry *__add_bio_entry(struct f2fs_sb_info *sbi,
610 struct bio *bio)
611{
612 struct list_head *wait_list = &(SM_I(sbi)->wait_list);
613 struct bio_entry *be = f2fs_kmem_cache_alloc(bio_entry_slab, GFP_NOFS);
614
615 INIT_LIST_HEAD(&be->list);
616 be->bio = bio;
617 init_completion(&be->event);
618 list_add_tail(&be->list, wait_list);
619
620 return be;
621}
622
623void f2fs_wait_all_discard_bio(struct f2fs_sb_info *sbi)
624{
625 struct list_head *wait_list = &(SM_I(sbi)->wait_list);
626 struct bio_entry *be, *tmp;
627
628 list_for_each_entry_safe(be, tmp, wait_list, list) {
629 struct bio *bio = be->bio;
630 int err;
631
632 wait_for_completion_io(&be->event);
633 err = be->error;
634 if (err == -EOPNOTSUPP)
635 err = 0;
636
637 if (err)
638 f2fs_msg(sbi->sb, KERN_INFO,
639 "Issue discard failed, ret: %d", err);
640
641 bio_put(bio);
642 list_del(&be->list);
643 kmem_cache_free(bio_entry_slab, be);
644 }
645}
646
647static void f2fs_submit_bio_wait_endio(struct bio *bio)
648{
649 struct bio_entry *be = (struct bio_entry *)bio->bi_private;
650
651 be->error = bio->bi_error;
652 complete(&be->event);
653}
654
655/* this function is copied from blkdev_issue_discard from block/blk-lib.c */
f46e8809 656static int __f2fs_issue_discard_async(struct f2fs_sb_info *sbi,
3c62be17 657 struct block_device *bdev, block_t blkstart, block_t blklen)
275b66b0 658{
275b66b0
CY		 659 struct bio *bio = NULL;
660 int err;
661
f46e8809
DLM		 662 trace_f2fs_issue_discard(sbi->sb, blkstart, blklen);
663
3c62be17
JK		 664 if (sbi->s_ndevs) {
665 int devi = f2fs_target_device_index(sbi, blkstart);
666
667 blkstart -= FDEV(devi).start_blk;
668 }
f46e8809
DLM		 669 err = __blkdev_issue_discard(bdev,
670 SECTOR_FROM_BLOCK(blkstart),
671 SECTOR_FROM_BLOCK(blklen),
672 GFP_NOFS, 0, &bio);
275b66b0
CY		 673 if (!err && bio) {
674 struct bio_entry *be = __add_bio_entry(sbi, bio);
675
676 bio->bi_private = be;
677 bio->bi_end_io = f2fs_submit_bio_wait_endio;
678 bio->bi_opf |= REQ_SYNC;
679 submit_bio(bio);
680 }
681
682 return err;
683}
684
f46e8809 685#ifdef CONFIG_BLK_DEV_ZONED
3c62be17
JK		 686static int __f2fs_issue_discard_zone(struct f2fs_sb_info *sbi,
687 struct block_device *bdev, block_t blkstart, block_t blklen)
f46e8809 688{
f46e8809 689 sector_t nr_sects = SECTOR_FROM_BLOCK(blklen);
3c62be17
JK		 690 sector_t sector;
691 int devi = 0;
692
693 if (sbi->s_ndevs) {
694 devi = f2fs_target_device_index(sbi, blkstart);
695 blkstart -= FDEV(devi).start_blk;
696 }
697 sector = SECTOR_FROM_BLOCK(blkstart);
f46e8809 698
19c52651
AB		 699 if (sector & (bdev_zone_size(bdev) - 1) ||
700 nr_sects != bdev_zone_size(bdev)) {
f46e8809 701 f2fs_msg(sbi->sb, KERN_INFO,
3c62be17
JK		 702 "(%d) %s: Unaligned discard attempted (block %x + %x)",
703 devi, sbi->s_ndevs ? FDEV(devi).path: "",
704 blkstart, blklen);
f46e8809
DLM		 705 return -EIO;
706 }
707
708 /*
709 * We need to know the type of the zone: for conventional zones,
710 * use regular discard if the drive supports it. For sequential
711 * zones, reset the zone write pointer.
712 */
3c62be17 713 switch (get_blkz_type(sbi, bdev, blkstart)) {
f46e8809
DLM		 714
715 case BLK_ZONE_TYPE_CONVENTIONAL:
716 if (!blk_queue_discard(bdev_get_queue(bdev)))
717 return 0;
3c62be17 718 return __f2fs_issue_discard_async(sbi, bdev, blkstart, blklen);
f46e8809
DLM		 719 case BLK_ZONE_TYPE_SEQWRITE_REQ:
720 case BLK_ZONE_TYPE_SEQWRITE_PREF:
126606c7 721 trace_f2fs_issue_reset_zone(sbi->sb, blkstart);
f46e8809
DLM		 722 return blkdev_reset_zones(bdev, sector,
723 nr_sects, GFP_NOFS);
724 default:
725 /* Unknown zone type: broken device ? */
726 return -EIO;
727 }
728}
729#endif
730
3c62be17
JK		 731static int __issue_discard_async(struct f2fs_sb_info *sbi,
732 struct block_device *bdev, block_t blkstart, block_t blklen)
733{
734#ifdef CONFIG_BLK_DEV_ZONED
735 if (f2fs_sb_mounted_blkzoned(sbi->sb) &&
736 bdev_zoned_model(bdev) != BLK_ZONED_NONE)
737 return __f2fs_issue_discard_zone(sbi, bdev, blkstart, blklen);
738#endif
739 return __f2fs_issue_discard_async(sbi, bdev, blkstart, blklen);
740}
741
1e87a78d 742static int f2fs_issue_discard(struct f2fs_sb_info *sbi,
37208879
JK		 743 block_t blkstart, block_t blklen)
744{
3c62be17
JK		 745 sector_t start = blkstart, len = 0;
746 struct block_device *bdev;
a66cdd98
JK		 747 struct seg_entry *se;
748 unsigned int offset;
749 block_t i;
3c62be17
JK		 750 int err = 0;
751
752 bdev = f2fs_target_device(sbi, blkstart, NULL);
753
754 for (i = blkstart; i < blkstart + blklen; i++, len++) {
755 if (i != start) {
756 struct block_device *bdev2 =
757 f2fs_target_device(sbi, i, NULL);
758
759 if (bdev2 != bdev) {
760 err = __issue_discard_async(sbi, bdev,
761 start, len);
762 if (err)
763 return err;
764 bdev = bdev2;
765 start = i;
766 len = 0;
767 }
768 }
a66cdd98 769
a66cdd98
JK		 770 se = get_seg_entry(sbi, GET_SEGNO(sbi, i));
771 offset = GET_BLKOFF_FROM_SEG0(sbi, i);
772
773 if (!f2fs_test_and_set_bit(offset, se->discard_map))
774 sbi->discard_blks--;
775 }
f46e8809 776
3c62be17
JK		 777 if (len)
778 err = __issue_discard_async(sbi, bdev, start, len);
779 return err;
1e87a78d
JK		 780}
781
adf4983b 782static void __add_discard_entry(struct f2fs_sb_info *sbi,
a66cdd98
JK		 783 struct cp_control *cpc, struct seg_entry *se,
784 unsigned int start, unsigned int end)
b2955550
JK		 785{
786 struct list_head *head = &SM_I(sbi)->discard_list;
adf4983b
JK		 787 struct discard_entry *new, *last;
788
789 if (!list_empty(head)) {
790 last = list_last_entry(head, struct discard_entry, list);
791 if (START_BLOCK(sbi, cpc->trim_start) + start ==
792 last->blkaddr + last->len) {
793 last->len += end - start;
794 goto done;
795 }
796 }
797
798 new = f2fs_kmem_cache_alloc(discard_entry_slab, GFP_NOFS);
799 INIT_LIST_HEAD(&new->list);
800 new->blkaddr = START_BLOCK(sbi, cpc->trim_start) + start;
801 new->len = end - start;
802 list_add_tail(&new->list, head);
803done:
804 SM_I(sbi)->nr_discards += end - start;
adf4983b
JK		 805}
806
807static void add_discard_addrs(struct f2fs_sb_info *sbi, struct cp_control *cpc)
808{
b2955550
JK		 809 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
810 int max_blocks = sbi->blocks_per_seg;
4b2fecc8 811 struct seg_entry *se = get_seg_entry(sbi, cpc->trim_start);
b2955550
JK		 812 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
813 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
a66cdd98 814 unsigned long *discard_map = (unsigned long *)se->discard_map;
60a3b782 815 unsigned long *dmap = SIT_I(sbi)->tmp_map;
b2955550 816 unsigned int start = 0, end = -1;
4b2fecc8 817 bool force = (cpc->reason == CP_DISCARD);
b2955550
JK		 818 int i;
819
3e025740 820 if (se->valid_blocks == max_blocks || !f2fs_discard_en(sbi))
b2955550
JK		 821 return;
822
a66cdd98
JK		 823 if (!force) {
824 if (!test_opt(sbi, DISCARD) || !se->valid_blocks ||
912a83b5
DC		 825 SM_I(sbi)->nr_discards >= SM_I(sbi)->max_discards)
826 return;
4b2fecc8
JK		 827 }
828
b2955550
JK		 829 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
830 for (i = 0; i < entries; i++)
a66cdd98 831 dmap[i] = force ? ~ckpt_map[i] & ~discard_map[i] :
d7bc2484 832 (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i];
b2955550 833
4b2fecc8 834 while (force || SM_I(sbi)->nr_discards <= SM_I(sbi)->max_discards) {
b2955550
JK		 835 start = __find_rev_next_bit(dmap, max_blocks, end + 1);
836 if (start >= max_blocks)
837 break;
838
839 end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1);
c7b41e16
YH		 840 if (force && start && end != max_blocks
841 && (end - start) < cpc->trim_minlen)
842 continue;
843
a66cdd98 844 __add_discard_entry(sbi, cpc, se, start, end);
b2955550
JK		 845 }
846}
847
4b2fecc8
JK		 848void release_discard_addrs(struct f2fs_sb_info *sbi)
849{
850 struct list_head *head = &(SM_I(sbi)->discard_list);
851 struct discard_entry *entry, *this;
852
853 /* drop caches */
854 list_for_each_entry_safe(entry, this, head, list) {
855 list_del(&entry->list);
856 kmem_cache_free(discard_entry_slab, entry);
857 }
858}
859
0a8165d7 860/*
351df4b2
JK		 861 * Should call clear_prefree_segments after checkpoint is done.
862 */
863static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi)
864{
865 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
b65ee148 866 unsigned int segno;
351df4b2
JK		 867
868 mutex_lock(&dirty_i->seglist_lock);
7cd8558b 869 for_each_set_bit(segno, dirty_i->dirty_segmap[PRE], MAIN_SEGS(sbi))
351df4b2 870 __set_test_and_free(sbi, segno);
351df4b2
JK		 871 mutex_unlock(&dirty_i->seglist_lock);
872}
873
836b5a63 874void clear_prefree_segments(struct f2fs_sb_info *sbi, struct cp_control *cpc)
351df4b2 875{
b2955550 876 struct list_head *head = &(SM_I(sbi)->discard_list);
2d7b822a 877 struct discard_entry *entry, *this;
351df4b2 878 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
275b66b0 879 struct blk_plug plug;
29e59c14 880 unsigned long *prefree_map = dirty_i->dirty_segmap[PRE];
29e59c14 881 unsigned int start = 0, end = -1;
36abef4e 882 unsigned int secno, start_segno;
c24a0fd6 883 bool force = (cpc->reason == CP_DISCARD);
351df4b2 884
275b66b0
CY		 885 blk_start_plug(&plug);
886
351df4b2 887 mutex_lock(&dirty_i->seglist_lock);
29e59c14 888
351df4b2 889 while (1) {
29e59c14 890 int i;
7cd8558b
JK		 891 start = find_next_bit(prefree_map, MAIN_SEGS(sbi), end + 1);
892 if (start >= MAIN_SEGS(sbi))
351df4b2 893 break;
7cd8558b
JK		 894 end = find_next_zero_bit(prefree_map, MAIN_SEGS(sbi),
895 start + 1);
29e59c14
CL		 896
897 for (i = start; i < end; i++)
898 clear_bit(i, prefree_map);
899
900 dirty_i->nr_dirty[PRE] -= end - start;
901
c24a0fd6 902 if (force || !test_opt(sbi, DISCARD))
29e59c14 903 continue;
351df4b2 904
36abef4e
JK		 905 if (!test_opt(sbi, LFS) || sbi->segs_per_sec == 1) {
906 f2fs_issue_discard(sbi, START_BLOCK(sbi, start),
37208879 907 (end - start) << sbi->log_blocks_per_seg);
36abef4e
JK		 908 continue;
909 }
910next:
911 secno = GET_SECNO(sbi, start);
912 start_segno = secno * sbi->segs_per_sec;
913 if (!IS_CURSEC(sbi, secno) &&
914 !get_valid_blocks(sbi, start, sbi->segs_per_sec))
915 f2fs_issue_discard(sbi, START_BLOCK(sbi, start_segno),
916 sbi->segs_per_sec << sbi->log_blocks_per_seg);
917
918 start = start_segno + sbi->segs_per_sec;
919 if (start < end)
920 goto next;
351df4b2
JK		 921 }
922 mutex_unlock(&dirty_i->seglist_lock);
b2955550
JK		 923
924 /* send small discards */
2d7b822a 925 list_for_each_entry_safe(entry, this, head, list) {
c24a0fd6 926 if (force && entry->len < cpc->trim_minlen)
836b5a63 927 goto skip;
37208879 928 f2fs_issue_discard(sbi, entry->blkaddr, entry->len);
f56aa1c5 929 cpc->trimmed += entry->len;
836b5a63 930skip:
b2955550
JK		 931 list_del(&entry->list);
932 SM_I(sbi)->nr_discards -= entry->len;
933 kmem_cache_free(discard_entry_slab, entry);
934 }
275b66b0
CY		 935
936 blk_finish_plug(&plug);
351df4b2
JK		 937}
938
184a5cd2 939static bool __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK		 940{
941 struct sit_info *sit_i = SIT_I(sbi);
184a5cd2
CY		 942
943 if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap)) {
351df4b2 944 sit_i->dirty_sentries++;
184a5cd2
CY		 945 return false;
946 }
947
948 return true;
351df4b2
JK		 949}
950
951static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type,
952 unsigned int segno, int modified)
953{
954 struct seg_entry *se = get_seg_entry(sbi, segno);
955 se->type = type;
956 if (modified)
957 __mark_sit_entry_dirty(sbi, segno);
958}
959
960static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del)
961{
962 struct seg_entry *se;
963 unsigned int segno, offset;
964 long int new_vblocks;
965
966 segno = GET_SEGNO(sbi, blkaddr);
967
968 se = get_seg_entry(sbi, segno);
969 new_vblocks = se->valid_blocks + del;
491c0854 970 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
351df4b2 971
9850cf4a 972 f2fs_bug_on(sbi, (new_vblocks >> (sizeof(unsigned short) << 3) ||
351df4b2
JK		 973 (new_vblocks > sbi->blocks_per_seg)));
974
975 se->valid_blocks = new_vblocks;
976 se->mtime = get_mtime(sbi);
977 SIT_I(sbi)->max_mtime = se->mtime;
978
979 /* Update valid block bitmap */
980 if (del > 0) {
52aca074 981 if (f2fs_test_and_set_bit(offset, se->cur_valid_map))
05796763 982 f2fs_bug_on(sbi, 1);
3e025740
JK		 983 if (f2fs_discard_en(sbi) &&
984 !f2fs_test_and_set_bit(offset, se->discard_map))
a66cdd98 985 sbi->discard_blks--;
351df4b2 986 } else {
52aca074 987 if (!f2fs_test_and_clear_bit(offset, se->cur_valid_map))
05796763 988 f2fs_bug_on(sbi, 1);
3e025740
JK		 989 if (f2fs_discard_en(sbi) &&
990 f2fs_test_and_clear_bit(offset, se->discard_map))
a66cdd98 991 sbi->discard_blks++;
351df4b2
JK		 992 }
993 if (!f2fs_test_bit(offset, se->ckpt_valid_map))
994 se->ckpt_valid_blocks += del;
995
996 __mark_sit_entry_dirty(sbi, segno);
997
998 /* update total number of valid blocks to be written in ckpt area */
999 SIT_I(sbi)->written_valid_blocks += del;
1000
1001 if (sbi->segs_per_sec > 1)
1002 get_sec_entry(sbi, segno)->valid_blocks += del;
1003}
1004
5e443818 1005void refresh_sit_entry(struct f2fs_sb_info *sbi, block_t old, block_t new)
351df4b2 1006{
5e443818
JK		 1007 update_sit_entry(sbi, new, 1);
1008 if (GET_SEGNO(sbi, old) != NULL_SEGNO)
1009 update_sit_entry(sbi, old, -1);
1010
1011 locate_dirty_segment(sbi, GET_SEGNO(sbi, old));
1012 locate_dirty_segment(sbi, GET_SEGNO(sbi, new));
351df4b2
JK		 1013}
1014
1015void invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr)
1016{
1017 unsigned int segno = GET_SEGNO(sbi, addr);
1018 struct sit_info *sit_i = SIT_I(sbi);
1019
9850cf4a 1020 f2fs_bug_on(sbi, addr == NULL_ADDR);
351df4b2
JK		 1021 if (addr == NEW_ADDR)
1022 return;
1023
1024 /* add it into sit main buffer */
1025 mutex_lock(&sit_i->sentry_lock);
1026
1027 update_sit_entry(sbi, addr, -1);
1028
1029 /* add it into dirty seglist */
1030 locate_dirty_segment(sbi, segno);
1031
1032 mutex_unlock(&sit_i->sentry_lock);
1033}
1034
6e2c64ad
JK		 1035bool is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr)
1036{
1037 struct sit_info *sit_i = SIT_I(sbi);
1038 unsigned int segno, offset;
1039 struct seg_entry *se;
1040 bool is_cp = false;
1041
1042 if (blkaddr == NEW_ADDR || blkaddr == NULL_ADDR)
1043 return true;
1044
1045 mutex_lock(&sit_i->sentry_lock);
1046
1047 segno = GET_SEGNO(sbi, blkaddr);
1048 se = get_seg_entry(sbi, segno);
1049 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
1050
1051 if (f2fs_test_bit(offset, se->ckpt_valid_map))
1052 is_cp = true;
1053
1054 mutex_unlock(&sit_i->sentry_lock);
1055
1056 return is_cp;
1057}
1058
0a8165d7 1059/*
351df4b2
JK		 1060 * This function should be resided under the curseg_mutex lock
1061 */
1062static void __add_sum_entry(struct f2fs_sb_info *sbi, int type,
e79efe3b 1063 struct f2fs_summary *sum)
351df4b2
JK		 1064{
1065 struct curseg_info *curseg = CURSEG_I(sbi, type);
1066 void *addr = curseg->sum_blk;
e79efe3b 1067 addr += curseg->next_blkoff * sizeof(struct f2fs_summary);
351df4b2 1068 memcpy(addr, sum, sizeof(struct f2fs_summary));
351df4b2
JK		 1069}
1070
0a8165d7 1071/*
351df4b2
JK		 1072 * Calculate the number of current summary pages for writing
1073 */
3fa06d7b 1074int npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra)
351df4b2 1075{
351df4b2 1076 int valid_sum_count = 0;
9a47938b 1077 int i, sum_in_page;
351df4b2
JK		 1078
1079 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1080 if (sbi->ckpt->alloc_type[i] == SSR)
1081 valid_sum_count += sbi->blocks_per_seg;
3fa06d7b
CY		 1082 else {
1083 if (for_ra)
1084 valid_sum_count += le16_to_cpu(
1085 F2FS_CKPT(sbi)->cur_data_blkoff[i]);
1086 else
1087 valid_sum_count += curseg_blkoff(sbi, i);
1088 }
351df4b2
JK		 1089 }
1090
09cbfeaf 1091 sum_in_page = (PAGE_SIZE - 2 * SUM_JOURNAL_SIZE -
9a47938b
FL		 1092 SUM_FOOTER_SIZE) / SUMMARY_SIZE;
1093 if (valid_sum_count <= sum_in_page)
351df4b2 1094 return 1;
9a47938b 1095 else if ((valid_sum_count - sum_in_page) <=
09cbfeaf 1096 (PAGE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE)
351df4b2
JK		 1097 return 2;
1098 return 3;
1099}
1100
0a8165d7 1101/*
351df4b2
JK		 1102 * Caller should put this summary page
1103 */
1104struct page *get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno)
1105{
1106 return get_meta_page(sbi, GET_SUM_BLOCK(sbi, segno));
1107}
1108
381722d2 1109void update_meta_page(struct f2fs_sb_info *sbi, void *src, block_t blk_addr)
351df4b2
JK		 1110{
1111 struct page *page = grab_meta_page(sbi, blk_addr);
381722d2
CY		 1112 void *dst = page_address(page);
1113
1114 if (src)
09cbfeaf 1115 memcpy(dst, src, PAGE_SIZE);
381722d2 1116 else
09cbfeaf 1117 memset(dst, 0, PAGE_SIZE);
351df4b2
JK		 1118 set_page_dirty(page);
1119 f2fs_put_page(page, 1);
1120}
1121
381722d2
CY		 1122static void write_sum_page(struct f2fs_sb_info *sbi,
1123 struct f2fs_summary_block *sum_blk, block_t blk_addr)
1124{
1125 update_meta_page(sbi, (void *)sum_blk, blk_addr);
1126}
1127
b7ad7512
CY		 1128static void write_current_sum_page(struct f2fs_sb_info *sbi,
1129 int type, block_t blk_addr)
1130{
1131 struct curseg_info *curseg = CURSEG_I(sbi, type);
1132 struct page *page = grab_meta_page(sbi, blk_addr);
1133 struct f2fs_summary_block *src = curseg->sum_blk;
1134 struct f2fs_summary_block *dst;
1135
1136 dst = (struct f2fs_summary_block *)page_address(page);
1137
1138 mutex_lock(&curseg->curseg_mutex);
1139
1140 down_read(&curseg->journal_rwsem);
1141 memcpy(&dst->journal, curseg->journal, SUM_JOURNAL_SIZE);
1142 up_read(&curseg->journal_rwsem);
1143
1144 memcpy(dst->entries, src->entries, SUM_ENTRY_SIZE);
1145 memcpy(&dst->footer, &src->footer, SUM_FOOTER_SIZE);
1146
1147 mutex_unlock(&curseg->curseg_mutex);
1148
1149 set_page_dirty(page);
1150 f2fs_put_page(page, 1);
1151}
1152
60374688
JK		 1153static int is_next_segment_free(struct f2fs_sb_info *sbi, int type)
1154{
1155 struct curseg_info *curseg = CURSEG_I(sbi, type);
81fb5e87 1156 unsigned int segno = curseg->segno + 1;
60374688
JK		 1157 struct free_segmap_info *free_i = FREE_I(sbi);
1158
7cd8558b 1159 if (segno < MAIN_SEGS(sbi) && segno % sbi->segs_per_sec)
81fb5e87 1160 return !test_bit(segno, free_i->free_segmap);
60374688
JK		 1161 return 0;
1162}
1163
0a8165d7 1164/*
351df4b2
JK		 1165 * Find a new segment from the free segments bitmap to right order
1166 * This function should be returned with success, otherwise BUG
1167 */
1168static void get_new_segment(struct f2fs_sb_info *sbi,
1169 unsigned int *newseg, bool new_sec, int dir)
1170{
1171 struct free_segmap_info *free_i = FREE_I(sbi);
351df4b2 1172 unsigned int segno, secno, zoneno;
7cd8558b 1173 unsigned int total_zones = MAIN_SECS(sbi) / sbi->secs_per_zone;
351df4b2
JK		 1174 unsigned int hint = *newseg / sbi->segs_per_sec;
1175 unsigned int old_zoneno = GET_ZONENO_FROM_SEGNO(sbi, *newseg);
1176 unsigned int left_start = hint;
1177 bool init = true;
1178 int go_left = 0;
1179 int i;
1180
1a118ccf 1181 spin_lock(&free_i->segmap_lock);
351df4b2
JK		 1182
1183 if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) {
1184 segno = find_next_zero_bit(free_i->free_segmap,
0ab14356
CY		 1185 (hint + 1) * sbi->segs_per_sec, *newseg + 1);
1186 if (segno < (hint + 1) * sbi->segs_per_sec)
351df4b2
JK		 1187 goto got_it;
1188 }
1189find_other_zone:
7cd8558b
JK		 1190 secno = find_next_zero_bit(free_i->free_secmap, MAIN_SECS(sbi), hint);
1191 if (secno >= MAIN_SECS(sbi)) {
351df4b2
JK		 1192 if (dir == ALLOC_RIGHT) {
1193 secno = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK		 1194 MAIN_SECS(sbi), 0);
1195 f2fs_bug_on(sbi, secno >= MAIN_SECS(sbi));
351df4b2
JK		 1196 } else {
1197 go_left = 1;
1198 left_start = hint - 1;
1199 }
1200 }
1201 if (go_left == 0)
1202 goto skip_left;
1203
1204 while (test_bit(left_start, free_i->free_secmap)) {
1205 if (left_start > 0) {
1206 left_start--;
1207 continue;
1208 }
1209 left_start = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK		 1210 MAIN_SECS(sbi), 0);
1211 f2fs_bug_on(sbi, left_start >= MAIN_SECS(sbi));
351df4b2
JK		 1212 break;
1213 }
1214 secno = left_start;
1215skip_left:
1216 hint = secno;
1217 segno = secno * sbi->segs_per_sec;
1218 zoneno = secno / sbi->secs_per_zone;
1219
1220 /* give up on finding another zone */
1221 if (!init)
1222 goto got_it;
1223 if (sbi->secs_per_zone == 1)
1224 goto got_it;
1225 if (zoneno == old_zoneno)
1226 goto got_it;
1227 if (dir == ALLOC_LEFT) {
1228 if (!go_left && zoneno + 1 >= total_zones)
1229 goto got_it;
1230 if (go_left && zoneno == 0)
1231 goto got_it;
1232 }
1233 for (i = 0; i < NR_CURSEG_TYPE; i++)
1234 if (CURSEG_I(sbi, i)->zone == zoneno)
1235 break;
1236
1237 if (i < NR_CURSEG_TYPE) {
1238 /* zone is in user, try another */
1239 if (go_left)
1240 hint = zoneno * sbi->secs_per_zone - 1;
1241 else if (zoneno + 1 >= total_zones)
1242 hint = 0;
1243 else
1244 hint = (zoneno + 1) * sbi->secs_per_zone;
1245 init = false;
1246 goto find_other_zone;
1247 }
1248got_it:
1249 /* set it as dirty segment in free segmap */
9850cf4a 1250 f2fs_bug_on(sbi, test_bit(segno, free_i->free_segmap));
351df4b2
JK		 1251 __set_inuse(sbi, segno);
1252 *newseg = segno;
1a118ccf 1253 spin_unlock(&free_i->segmap_lock);
351df4b2
JK		 1254}
1255
1256static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified)
1257{
1258 struct curseg_info *curseg = CURSEG_I(sbi, type);
1259 struct summary_footer *sum_footer;
1260
1261 curseg->segno = curseg->next_segno;
1262 curseg->zone = GET_ZONENO_FROM_SEGNO(sbi, curseg->segno);
1263 curseg->next_blkoff = 0;
1264 curseg->next_segno = NULL_SEGNO;
1265
1266 sum_footer = &(curseg->sum_blk->footer);
1267 memset(sum_footer, 0, sizeof(struct summary_footer));
1268 if (IS_DATASEG(type))
1269 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA);
1270 if (IS_NODESEG(type))
1271 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE);
1272 __set_sit_entry_type(sbi, type, curseg->segno, modified);
1273}
1274
0a8165d7 1275/*
351df4b2
JK		 1276 * Allocate a current working segment.
1277 * This function always allocates a free segment in LFS manner.
1278 */
1279static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec)
1280{
1281 struct curseg_info *curseg = CURSEG_I(sbi, type);
1282 unsigned int segno = curseg->segno;
1283 int dir = ALLOC_LEFT;
1284
1285 write_sum_page(sbi, curseg->sum_blk,
81fb5e87 1286 GET_SUM_BLOCK(sbi, segno));
351df4b2
JK		 1287 if (type == CURSEG_WARM_DATA || type == CURSEG_COLD_DATA)
1288 dir = ALLOC_RIGHT;
1289
1290 if (test_opt(sbi, NOHEAP))
1291 dir = ALLOC_RIGHT;
1292
1293 get_new_segment(sbi, &segno, new_sec, dir);
1294 curseg->next_segno = segno;
1295 reset_curseg(sbi, type, 1);
1296 curseg->alloc_type = LFS;
1297}
1298
1299static void __next_free_blkoff(struct f2fs_sb_info *sbi,
1300 struct curseg_info *seg, block_t start)
1301{
1302 struct seg_entry *se = get_seg_entry(sbi, seg->segno);
e81c93cf 1303 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
60a3b782 1304 unsigned long *target_map = SIT_I(sbi)->tmp_map;
e81c93cf
CL		 1305 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
1306 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
1307 int i, pos;
1308
1309 for (i = 0; i < entries; i++)
1310 target_map[i] = ckpt_map[i] | cur_map[i];
1311
1312 pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start);
1313
1314 seg->next_blkoff = pos;
351df4b2
JK		 1315}
1316
0a8165d7 1317/*
351df4b2
JK		 1318 * If a segment is written by LFS manner, next block offset is just obtained
1319 * by increasing the current block offset. However, if a segment is written by
1320 * SSR manner, next block offset obtained by calling __next_free_blkoff
1321 */
1322static void __refresh_next_blkoff(struct f2fs_sb_info *sbi,
1323 struct curseg_info *seg)
1324{
1325 if (seg->alloc_type == SSR)
1326 __next_free_blkoff(sbi, seg, seg->next_blkoff + 1);
1327 else
1328 seg->next_blkoff++;
1329}
1330
0a8165d7 1331/*
e1c42045 1332 * This function always allocates a used segment(from dirty seglist) by SSR
351df4b2
JK		 1333 * manner, so it should recover the existing segment information of valid blocks
1334 */
1335static void change_curseg(struct f2fs_sb_info *sbi, int type, bool reuse)
1336{
1337 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1338 struct curseg_info *curseg = CURSEG_I(sbi, type);
1339 unsigned int new_segno = curseg->next_segno;
1340 struct f2fs_summary_block *sum_node;
1341 struct page *sum_page;
1342
1343 write_sum_page(sbi, curseg->sum_blk,
1344 GET_SUM_BLOCK(sbi, curseg->segno));
1345 __set_test_and_inuse(sbi, new_segno);
1346
1347 mutex_lock(&dirty_i->seglist_lock);
1348 __remove_dirty_segment(sbi, new_segno, PRE);
1349 __remove_dirty_segment(sbi, new_segno, DIRTY);
1350 mutex_unlock(&dirty_i->seglist_lock);
1351
1352 reset_curseg(sbi, type, 1);
1353 curseg->alloc_type = SSR;
1354 __next_free_blkoff(sbi, curseg, 0);
1355
1356 if (reuse) {
1357 sum_page = get_sum_page(sbi, new_segno);
1358 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
1359 memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE);
1360 f2fs_put_page(sum_page, 1);
1361 }
1362}
1363
43727527
JK		 1364static int get_ssr_segment(struct f2fs_sb_info *sbi, int type)
1365{
1366 struct curseg_info *curseg = CURSEG_I(sbi, type);
1367 const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops;
1368
7f3037a5 1369 if (IS_NODESEG(type) || !has_not_enough_free_secs(sbi, 0, 0))
43727527
JK		 1370 return v_ops->get_victim(sbi,
1371 &(curseg)->next_segno, BG_GC, type, SSR);
1372
1373 /* For data segments, let's do SSR more intensively */
1374 for (; type >= CURSEG_HOT_DATA; type--)
1375 if (v_ops->get_victim(sbi, &(curseg)->next_segno,
1376 BG_GC, type, SSR))
1377 return 1;
1378 return 0;
1379}
1380
351df4b2
JK		 1381/*
1382 * flush out current segment and replace it with new segment
1383 * This function should be returned with success, otherwise BUG
1384 */
1385static void allocate_segment_by_default(struct f2fs_sb_info *sbi,
1386 int type, bool force)
1387{
1388 struct curseg_info *curseg = CURSEG_I(sbi, type);
351df4b2 1389
7b405275 1390 if (force)
351df4b2 1391 new_curseg(sbi, type, true);
7b405275 1392 else if (type == CURSEG_WARM_NODE)
351df4b2 1393 new_curseg(sbi, type, false);
60374688
JK		 1394 else if (curseg->alloc_type == LFS && is_next_segment_free(sbi, type))
1395 new_curseg(sbi, type, false);
351df4b2
JK		 1396 else if (need_SSR(sbi) && get_ssr_segment(sbi, type))
1397 change_curseg(sbi, type, true);
1398 else
1399 new_curseg(sbi, type, false);
dcdfff65
JK		 1400
1401 stat_inc_seg_type(sbi, curseg);
351df4b2
JK		 1402}
1403
1404void allocate_new_segments(struct f2fs_sb_info *sbi)
1405{
6ae1be13
JK		 1406 struct curseg_info *curseg;
1407 unsigned int old_segno;
351df4b2
JK		 1408 int i;
1409
36abef4e
JK		 1410 if (test_opt(sbi, LFS))
1411 return;
1412
6ae1be13
JK		 1413 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1414 curseg = CURSEG_I(sbi, i);
1415 old_segno = curseg->segno;
1416 SIT_I(sbi)->s_ops->allocate_segment(sbi, i, true);
1417 locate_dirty_segment(sbi, old_segno);
1418 }
351df4b2
JK		 1419}
1420
1421static const struct segment_allocation default_salloc_ops = {
1422 .allocate_segment = allocate_segment_by_default,
1423};
1424
4b2fecc8
JK		 1425int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range)
1426{
f7ef9b83
JK		 1427 __u64 start = F2FS_BYTES_TO_BLK(range->start);
1428 __u64 end = start + F2FS_BYTES_TO_BLK(range->len) - 1;
4b2fecc8
JK		 1429 unsigned int start_segno, end_segno;
1430 struct cp_control cpc;
c34f42e2 1431 int err = 0;
4b2fecc8 1432
836b5a63 1433 if (start >= MAX_BLKADDR(sbi) || range->len < sbi->blocksize)
4b2fecc8
JK		 1434 return -EINVAL;
1435
9bd27ae4 1436 cpc.trimmed = 0;
7cd8558b 1437 if (end <= MAIN_BLKADDR(sbi))
4b2fecc8
JK		 1438 goto out;
1439
ed214a11
YH		 1440 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
1441 f2fs_msg(sbi->sb, KERN_WARNING,
1442 "Found FS corruption, run fsck to fix.");
1443 goto out;
1444 }
1445
4b2fecc8 1446 /* start/end segment number in main_area */
7cd8558b
JK		 1447 start_segno = (start <= MAIN_BLKADDR(sbi)) ? 0 : GET_SEGNO(sbi, start);
1448 end_segno = (end >= MAX_BLKADDR(sbi)) ? MAIN_SEGS(sbi) - 1 :
1449 GET_SEGNO(sbi, end);
4b2fecc8 1450 cpc.reason = CP_DISCARD;
836b5a63 1451 cpc.trim_minlen = max_t(__u64, 1, F2FS_BYTES_TO_BLK(range->minlen));
4b2fecc8
JK		 1452
1453 /* do checkpoint to issue discard commands safely */
bba681cb
JK		 1454 for (; start_segno <= end_segno; start_segno = cpc.trim_end + 1) {
1455 cpc.trim_start = start_segno;
a66cdd98
JK		 1456
1457 if (sbi->discard_blks == 0)
1458 break;
1459 else if (sbi->discard_blks < BATCHED_TRIM_BLOCKS(sbi))
1460 cpc.trim_end = end_segno;
1461 else
1462 cpc.trim_end = min_t(unsigned int,
1463 rounddown(start_segno +
bba681cb
JK		 1464 BATCHED_TRIM_SEGMENTS(sbi),
1465 sbi->segs_per_sec) - 1, end_segno);
1466
1467 mutex_lock(&sbi->gc_mutex);
c34f42e2 1468 err = write_checkpoint(sbi, &cpc);
bba681cb 1469 mutex_unlock(&sbi->gc_mutex);
e9328353
CY		 1470 if (err)
1471 break;
74fa5f3d
CY		 1472
1473 schedule();
bba681cb 1474 }
4b2fecc8 1475out:
f7ef9b83 1476 range->len = F2FS_BLK_TO_BYTES(cpc.trimmed);
c34f42e2 1477 return err;
4b2fecc8
JK		 1478}
1479
351df4b2
JK		 1480static bool __has_curseg_space(struct f2fs_sb_info *sbi, int type)
1481{
1482 struct curseg_info *curseg = CURSEG_I(sbi, type);
1483 if (curseg->next_blkoff < sbi->blocks_per_seg)
1484 return true;
1485 return false;
1486}
1487
1488static int __get_segment_type_2(struct page *page, enum page_type p_type)
1489{
1490 if (p_type == DATA)
1491 return CURSEG_HOT_DATA;
1492 else
1493 return CURSEG_HOT_NODE;
1494}
1495
1496static int __get_segment_type_4(struct page *page, enum page_type p_type)
1497{
1498 if (p_type == DATA) {
1499 struct inode *inode = page->mapping->host;
1500
1501 if (S_ISDIR(inode->i_mode))
1502 return CURSEG_HOT_DATA;
1503 else
1504 return CURSEG_COLD_DATA;
1505 } else {
a344b9fd
JK		 1506 if (IS_DNODE(page) && is_cold_node(page))
1507 return CURSEG_WARM_NODE;
351df4b2
JK		 1508 else
1509 return CURSEG_COLD_NODE;
1510 }
1511}
1512
1513static int __get_segment_type_6(struct page *page, enum page_type p_type)
1514{
1515 if (p_type == DATA) {
1516 struct inode *inode = page->mapping->host;
1517
1518 if (S_ISDIR(inode->i_mode))
1519 return CURSEG_HOT_DATA;
354a3399 1520 else if (is_cold_data(page) || file_is_cold(inode))
351df4b2
JK		 1521 return CURSEG_COLD_DATA;
1522 else
1523 return CURSEG_WARM_DATA;
1524 } else {
1525 if (IS_DNODE(page))
1526 return is_cold_node(page) ? CURSEG_WARM_NODE :
1527 CURSEG_HOT_NODE;
1528 else
1529 return CURSEG_COLD_NODE;
1530 }
1531}
1532
1533static int __get_segment_type(struct page *page, enum page_type p_type)
1534{
4081363f 1535 switch (F2FS_P_SB(page)->active_logs) {
351df4b2
JK		 1536 case 2:
1537 return __get_segment_type_2(page, p_type);
1538 case 4:
1539 return __get_segment_type_4(page, p_type);
351df4b2 1540 }
12a67146 1541 /* NR_CURSEG_TYPE(6) logs by default */
9850cf4a
JK		 1542 f2fs_bug_on(F2FS_P_SB(page),
1543 F2FS_P_SB(page)->active_logs != NR_CURSEG_TYPE);
12a67146 1544 return __get_segment_type_6(page, p_type);
351df4b2
JK		 1545}
1546
bfad7c2d
JK		 1547void allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
1548 block_t old_blkaddr, block_t *new_blkaddr,
1549 struct f2fs_summary *sum, int type)
351df4b2
JK		 1550{
1551 struct sit_info *sit_i = SIT_I(sbi);
6ae1be13 1552 struct curseg_info *curseg = CURSEG_I(sbi, type);
351df4b2
JK		 1553
1554 mutex_lock(&curseg->curseg_mutex);
21cb1d99 1555 mutex_lock(&sit_i->sentry_lock);
351df4b2
JK		 1556
1557 *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
351df4b2
JK		 1558
1559 /*
1560 * __add_sum_entry should be resided under the curseg_mutex
1561 * because, this function updates a summary entry in the
1562 * current summary block.
1563 */
e79efe3b 1564 __add_sum_entry(sbi, type, sum);
351df4b2 1565
351df4b2 1566 __refresh_next_blkoff(sbi, curseg);
dcdfff65
JK		 1567
1568 stat_inc_block_count(sbi, curseg);
351df4b2 1569
5e443818
JK		 1570 if (!__has_curseg_space(sbi, type))
1571 sit_i->s_ops->allocate_segment(sbi, type, false);
351df4b2
JK		 1572 /*
1573 * SIT information should be updated before segment allocation,
1574 * since SSR needs latest valid block information.
1575 */
1576 refresh_sit_entry(sbi, old_blkaddr, *new_blkaddr);
5e443818 1577
351df4b2
JK		 1578 mutex_unlock(&sit_i->sentry_lock);
1579
bfad7c2d 1580 if (page && IS_NODESEG(type))
351df4b2
JK		 1581 fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg));
1582
bfad7c2d
JK		 1583 mutex_unlock(&curseg->curseg_mutex);
1584}
1585
05ca3632 1586static void do_write_page(struct f2fs_summary *sum, struct f2fs_io_info *fio)
bfad7c2d 1587{
05ca3632 1588 int type = __get_segment_type(fio->page, fio->type);
bfad7c2d 1589
7dfeaa32
JK		 1590 if (fio->type == NODE || fio->type == DATA)
1591 mutex_lock(&fio->sbi->wio_mutex[fio->type]);
1592
7a9d7548
CY		 1593 allocate_data_block(fio->sbi, fio->page, fio->old_blkaddr,
1594 &fio->new_blkaddr, sum, type);
bfad7c2d 1595
351df4b2 1596 /* writeout dirty page into bdev */
05ca3632 1597 f2fs_submit_page_mbio(fio);
7dfeaa32
JK		 1598
1599 if (fio->type == NODE || fio->type == DATA)
1600 mutex_unlock(&fio->sbi->wio_mutex[fio->type]);
351df4b2
JK		 1601}
1602
577e3495 1603void write_meta_page(struct f2fs_sb_info *sbi, struct page *page)
351df4b2 1604{
458e6197 1605 struct f2fs_io_info fio = {
05ca3632 1606 .sbi = sbi,
458e6197 1607 .type = META,
04d328de
MC		 1608 .op = REQ_OP_WRITE,
1609 .op_flags = WRITE_SYNC | REQ_META | REQ_PRIO,
7a9d7548
CY		 1610 .old_blkaddr = page->index,
1611 .new_blkaddr = page->index,
05ca3632 1612 .page = page,
4375a336 1613 .encrypted_page = NULL,
458e6197
JK		 1614 };
1615
2b947003 1616 if (unlikely(page->index >= MAIN_BLKADDR(sbi)))
04d328de 1617 fio.op_flags &= ~REQ_META;
2b947003 1618
351df4b2 1619 set_page_writeback(page);
05ca3632 1620 f2fs_submit_page_mbio(&fio);
351df4b2
JK		 1621}
1622
05ca3632 1623void write_node_page(unsigned int nid, struct f2fs_io_info *fio)
351df4b2
JK		 1624{
1625 struct f2fs_summary sum;
05ca3632 1626
351df4b2 1627 set_summary(&sum, nid, 0, 0);
05ca3632 1628 do_write_page(&sum, fio);
351df4b2
JK		 1629}
1630
05ca3632 1631void write_data_page(struct dnode_of_data *dn, struct f2fs_io_info *fio)
351df4b2 1632{
05ca3632 1633 struct f2fs_sb_info *sbi = fio->sbi;
351df4b2
JK		 1634 struct f2fs_summary sum;
1635 struct node_info ni;
1636
9850cf4a 1637 f2fs_bug_on(sbi, dn->data_blkaddr == NULL_ADDR);
351df4b2
JK		 1638 get_node_info(sbi, dn->nid, &ni);
1639 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version);
05ca3632 1640 do_write_page(&sum, fio);
f28b3434 1641 f2fs_update_data_blkaddr(dn, fio->new_blkaddr);
351df4b2
JK		 1642}
1643
05ca3632 1644void rewrite_data_page(struct f2fs_io_info *fio)
351df4b2 1645{
7a9d7548 1646 fio->new_blkaddr = fio->old_blkaddr;
05ca3632
JK		 1647 stat_inc_inplace_blocks(fio->sbi);
1648 f2fs_submit_page_mbio(fio);
351df4b2
JK		 1649}
1650
4356e48e 1651void __f2fs_replace_block(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
19f106bc 1652 block_t old_blkaddr, block_t new_blkaddr,
28bc106b 1653 bool recover_curseg, bool recover_newaddr)
351df4b2
JK		 1654{
1655 struct sit_info *sit_i = SIT_I(sbi);
1656 struct curseg_info *curseg;
1657 unsigned int segno, old_cursegno;
1658 struct seg_entry *se;
1659 int type;
19f106bc 1660 unsigned short old_blkoff;
351df4b2
JK		 1661
1662 segno = GET_SEGNO(sbi, new_blkaddr);
1663 se = get_seg_entry(sbi, segno);
1664 type = se->type;
1665
19f106bc
CY		 1666 if (!recover_curseg) {
1667 /* for recovery flow */
1668 if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) {
1669 if (old_blkaddr == NULL_ADDR)
1670 type = CURSEG_COLD_DATA;
1671 else
1672 type = CURSEG_WARM_DATA;
1673 }
1674 } else {
1675 if (!IS_CURSEG(sbi, segno))
351df4b2
JK		 1676 type = CURSEG_WARM_DATA;
1677 }
19f106bc 1678
351df4b2
JK		 1679 curseg = CURSEG_I(sbi, type);
1680
1681 mutex_lock(&curseg->curseg_mutex);
1682 mutex_lock(&sit_i->sentry_lock);
1683
1684 old_cursegno = curseg->segno;
19f106bc 1685 old_blkoff = curseg->next_blkoff;
351df4b2
JK		 1686
1687 /* change the current segment */
1688 if (segno != curseg->segno) {
1689 curseg->next_segno = segno;
1690 change_curseg(sbi, type, true);
1691 }
1692
491c0854 1693 curseg->next_blkoff = GET_BLKOFF_FROM_SEG0(sbi, new_blkaddr);
e79efe3b 1694 __add_sum_entry(sbi, type, sum);
351df4b2 1695
28bc106b 1696 if (!recover_curseg || recover_newaddr)
6e2c64ad
JK		 1697 update_sit_entry(sbi, new_blkaddr, 1);
1698 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO)
1699 update_sit_entry(sbi, old_blkaddr, -1);
1700
1701 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
1702 locate_dirty_segment(sbi, GET_SEGNO(sbi, new_blkaddr));
1703
351df4b2 1704 locate_dirty_segment(sbi, old_cursegno);
351df4b2 1705
19f106bc
CY		 1706 if (recover_curseg) {
1707 if (old_cursegno != curseg->segno) {
1708 curseg->next_segno = old_cursegno;
1709 change_curseg(sbi, type, true);
1710 }
1711 curseg->next_blkoff = old_blkoff;
1712 }
1713
351df4b2
JK		 1714 mutex_unlock(&sit_i->sentry_lock);
1715 mutex_unlock(&curseg->curseg_mutex);
1716}
1717
528e3459
CY		 1718void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn,
1719 block_t old_addr, block_t new_addr,
28bc106b
CY		 1720 unsigned char version, bool recover_curseg,
1721 bool recover_newaddr)
528e3459
CY		 1722{
1723 struct f2fs_summary sum;
1724
1725 set_summary(&sum, dn->nid, dn->ofs_in_node, version);
1726
28bc106b
CY		 1727 __f2fs_replace_block(sbi, &sum, old_addr, new_addr,
1728 recover_curseg, recover_newaddr);
528e3459 1729
f28b3434 1730 f2fs_update_data_blkaddr(dn, new_addr);
528e3459
CY		 1731}
1732
93dfe2ac 1733void f2fs_wait_on_page_writeback(struct page *page,
fec1d657 1734 enum page_type type, bool ordered)
93dfe2ac 1735{
93dfe2ac 1736 if (PageWriteback(page)) {
4081363f
JK		 1737 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
1738
0c3a5797 1739 f2fs_submit_merged_bio_cond(sbi, NULL, page, 0, type, WRITE);
fec1d657
JK		 1740 if (ordered)
1741 wait_on_page_writeback(page);
1742 else
1743 wait_for_stable_page(page);
93dfe2ac
JK		 1744 }
1745}
1746
08b39fbd
CY		 1747void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *sbi,
1748 block_t blkaddr)
1749{
1750 struct page *cpage;
1751
5d4c0af4 1752 if (blkaddr == NEW_ADDR || blkaddr == NULL_ADDR)
08b39fbd
CY		 1753 return;
1754
08b39fbd
CY		 1755 cpage = find_lock_page(META_MAPPING(sbi), blkaddr);
1756 if (cpage) {
fec1d657 1757 f2fs_wait_on_page_writeback(cpage, DATA, true);
08b39fbd
CY		 1758 f2fs_put_page(cpage, 1);
1759 }
1760}
1761
351df4b2
JK		 1762static int read_compacted_summaries(struct f2fs_sb_info *sbi)
1763{
1764 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1765 struct curseg_info *seg_i;
1766 unsigned char *kaddr;
1767 struct page *page;
1768 block_t start;
1769 int i, j, offset;
1770
1771 start = start_sum_block(sbi);
1772
1773 page = get_meta_page(sbi, start++);
1774 kaddr = (unsigned char *)page_address(page);
1775
1776 /* Step 1: restore nat cache */
1777 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 1778 memcpy(seg_i->journal, kaddr, SUM_JOURNAL_SIZE);
351df4b2
JK		 1779
1780 /* Step 2: restore sit cache */
1781 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 1782 memcpy(seg_i->journal, kaddr + SUM_JOURNAL_SIZE, SUM_JOURNAL_SIZE);
351df4b2
JK		 1783 offset = 2 * SUM_JOURNAL_SIZE;
1784
1785 /* Step 3: restore summary entries */
1786 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1787 unsigned short blk_off;
1788 unsigned int segno;
1789
1790 seg_i = CURSEG_I(sbi, i);
1791 segno = le32_to_cpu(ckpt->cur_data_segno[i]);
1792 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]);
1793 seg_i->next_segno = segno;
1794 reset_curseg(sbi, i, 0);
1795 seg_i->alloc_type = ckpt->alloc_type[i];
1796 seg_i->next_blkoff = blk_off;
1797
1798 if (seg_i->alloc_type == SSR)
1799 blk_off = sbi->blocks_per_seg;
1800
1801 for (j = 0; j < blk_off; j++) {
1802 struct f2fs_summary *s;
1803 s = (struct f2fs_summary *)(kaddr + offset);
1804 seg_i->sum_blk->entries[j] = *s;
1805 offset += SUMMARY_SIZE;
09cbfeaf 1806 if (offset + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK		 1807 SUM_FOOTER_SIZE)
1808 continue;
1809
1810 f2fs_put_page(page, 1);
1811 page = NULL;
1812
1813 page = get_meta_page(sbi, start++);
1814 kaddr = (unsigned char *)page_address(page);
1815 offset = 0;
1816 }
1817 }
1818 f2fs_put_page(page, 1);
1819 return 0;
1820}
1821
1822static int read_normal_summaries(struct f2fs_sb_info *sbi, int type)
1823{
1824 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1825 struct f2fs_summary_block *sum;
1826 struct curseg_info *curseg;
1827 struct page *new;
1828 unsigned short blk_off;
1829 unsigned int segno = 0;
1830 block_t blk_addr = 0;
1831
1832 /* get segment number and block addr */
1833 if (IS_DATASEG(type)) {
1834 segno = le32_to_cpu(ckpt->cur_data_segno[type]);
1835 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type -
1836 CURSEG_HOT_DATA]);
119ee914 1837 if (__exist_node_summaries(sbi))
351df4b2
JK		 1838 blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type);
1839 else
1840 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type);
1841 } else {
1842 segno = le32_to_cpu(ckpt->cur_node_segno[type -
1843 CURSEG_HOT_NODE]);
1844 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type -
1845 CURSEG_HOT_NODE]);
119ee914 1846 if (__exist_node_summaries(sbi))
351df4b2
JK		 1847 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE,
1848 type - CURSEG_HOT_NODE);
1849 else
1850 blk_addr = GET_SUM_BLOCK(sbi, segno);
1851 }
1852
1853 new = get_meta_page(sbi, blk_addr);
1854 sum = (struct f2fs_summary_block *)page_address(new);
1855
1856 if (IS_NODESEG(type)) {
119ee914 1857 if (__exist_node_summaries(sbi)) {
351df4b2
JK		 1858 struct f2fs_summary *ns = &sum->entries[0];
1859 int i;
1860 for (i = 0; i < sbi->blocks_per_seg; i++, ns++) {
1861 ns->version = 0;
1862 ns->ofs_in_node = 0;
1863 }
1864 } else {
d653788a
GZ		 1865 int err;
1866
1867 err = restore_node_summary(sbi, segno, sum);
1868 if (err) {
351df4b2 1869 f2fs_put_page(new, 1);
d653788a 1870 return err;
351df4b2
JK		 1871 }
1872 }
1873 }
1874
1875 /* set uncompleted segment to curseg */
1876 curseg = CURSEG_I(sbi, type);
1877 mutex_lock(&curseg->curseg_mutex);
b7ad7512
CY		 1878
1879 /* update journal info */
1880 down_write(&curseg->journal_rwsem);
1881 memcpy(curseg->journal, &sum->journal, SUM_JOURNAL_SIZE);
1882 up_write(&curseg->journal_rwsem);
1883
1884 memcpy(curseg->sum_blk->entries, sum->entries, SUM_ENTRY_SIZE);
1885 memcpy(&curseg->sum_blk->footer, &sum->footer, SUM_FOOTER_SIZE);
351df4b2
JK		 1886 curseg->next_segno = segno;
1887 reset_curseg(sbi, type, 0);
1888 curseg->alloc_type = ckpt->alloc_type[type];
1889 curseg->next_blkoff = blk_off;
1890 mutex_unlock(&curseg->curseg_mutex);
1891 f2fs_put_page(new, 1);
1892 return 0;
1893}
1894
1895static int restore_curseg_summaries(struct f2fs_sb_info *sbi)
1896{
1897 int type = CURSEG_HOT_DATA;
e4fc5fbf 1898 int err;
351df4b2 1899
aaec2b1d 1900 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG)) {
3fa06d7b
CY		 1901 int npages = npages_for_summary_flush(sbi, true);
1902
1903 if (npages >= 2)
1904 ra_meta_pages(sbi, start_sum_block(sbi), npages,
26879fb1 1905 META_CP, true);
3fa06d7b 1906
351df4b2
JK		 1907 /* restore for compacted data summary */
1908 if (read_compacted_summaries(sbi))
1909 return -EINVAL;
1910 type = CURSEG_HOT_NODE;
1911 }
1912
119ee914 1913 if (__exist_node_summaries(sbi))
3fa06d7b 1914 ra_meta_pages(sbi, sum_blk_addr(sbi, NR_CURSEG_TYPE, type),
26879fb1 1915 NR_CURSEG_TYPE - type, META_CP, true);
3fa06d7b 1916
e4fc5fbf
CY		 1917 for (; type <= CURSEG_COLD_NODE; type++) {
1918 err = read_normal_summaries(sbi, type);
1919 if (err)
1920 return err;
1921 }
1922
351df4b2
JK		 1923 return 0;
1924}
1925
1926static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr)
1927{
1928 struct page *page;
1929 unsigned char *kaddr;
1930 struct f2fs_summary *summary;
1931 struct curseg_info *seg_i;
1932 int written_size = 0;
1933 int i, j;
1934
1935 page = grab_meta_page(sbi, blkaddr++);
1936 kaddr = (unsigned char *)page_address(page);
1937
1938 /* Step 1: write nat cache */
1939 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 1940 memcpy(kaddr, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK		 1941 written_size += SUM_JOURNAL_SIZE;
1942
1943 /* Step 2: write sit cache */
1944 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 1945 memcpy(kaddr + written_size, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK		 1946 written_size += SUM_JOURNAL_SIZE;
1947
351df4b2
JK		 1948 /* Step 3: write summary entries */
1949 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1950 unsigned short blkoff;
1951 seg_i = CURSEG_I(sbi, i);
1952 if (sbi->ckpt->alloc_type[i] == SSR)
1953 blkoff = sbi->blocks_per_seg;
1954 else
1955 blkoff = curseg_blkoff(sbi, i);
1956
1957 for (j = 0; j < blkoff; j++) {
1958 if (!page) {
1959 page = grab_meta_page(sbi, blkaddr++);
1960 kaddr = (unsigned char *)page_address(page);
1961 written_size = 0;
1962 }
1963 summary = (struct f2fs_summary *)(kaddr + written_size);
1964 *summary = seg_i->sum_blk->entries[j];
1965 written_size += SUMMARY_SIZE;
351df4b2 1966
09cbfeaf 1967 if (written_size + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK		 1968 SUM_FOOTER_SIZE)
1969 continue;
1970
e8d61a74 1971 set_page_dirty(page);
351df4b2
JK		 1972 f2fs_put_page(page, 1);
1973 page = NULL;
1974 }
1975 }
e8d61a74
CY		 1976 if (page) {
1977 set_page_dirty(page);
351df4b2 1978 f2fs_put_page(page, 1);
e8d61a74 1979 }
351df4b2
JK		 1980}
1981
1982static void write_normal_summaries(struct f2fs_sb_info *sbi,
1983 block_t blkaddr, int type)
1984{
1985 int i, end;
1986 if (IS_DATASEG(type))
1987 end = type + NR_CURSEG_DATA_TYPE;
1988 else
1989 end = type + NR_CURSEG_NODE_TYPE;
1990
b7ad7512
CY		 1991 for (i = type; i < end; i++)
1992 write_current_sum_page(sbi, i, blkaddr + (i - type));
351df4b2
JK		 1993}
1994
1995void write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
1996{
aaec2b1d 1997 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG))
351df4b2
JK		 1998 write_compacted_summaries(sbi, start_blk);
1999 else
2000 write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA);
2001}
2002
2003void write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
2004{
119ee914 2005 write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE);
351df4b2
JK		 2006}
2007
dfc08a12 2008int lookup_journal_in_cursum(struct f2fs_journal *journal, int type,
351df4b2
JK		 2009 unsigned int val, int alloc)
2010{
2011 int i;
2012
2013 if (type == NAT_JOURNAL) {
dfc08a12
CY		 2014 for (i = 0; i < nats_in_cursum(journal); i++) {
2015 if (le32_to_cpu(nid_in_journal(journal, i)) == val)
351df4b2
JK		 2016 return i;
2017 }
dfc08a12
CY		 2018 if (alloc && __has_cursum_space(journal, 1, NAT_JOURNAL))
2019 return update_nats_in_cursum(journal, 1);
351df4b2 2020 } else if (type == SIT_JOURNAL) {
dfc08a12
CY		 2021 for (i = 0; i < sits_in_cursum(journal); i++)
2022 if (le32_to_cpu(segno_in_journal(journal, i)) == val)
351df4b2 2023 return i;
dfc08a12
CY		 2024 if (alloc && __has_cursum_space(journal, 1, SIT_JOURNAL))
2025 return update_sits_in_cursum(journal, 1);
351df4b2
JK		 2026 }
2027 return -1;
2028}
2029
2030static struct page *get_current_sit_page(struct f2fs_sb_info *sbi,
2031 unsigned int segno)
2032{
2cc22186 2033 return get_meta_page(sbi, current_sit_addr(sbi, segno));
351df4b2
JK		 2034}
2035
2036static struct page *get_next_sit_page(struct f2fs_sb_info *sbi,
2037 unsigned int start)
2038{
2039 struct sit_info *sit_i = SIT_I(sbi);
2040 struct page *src_page, *dst_page;
2041 pgoff_t src_off, dst_off;
2042 void *src_addr, *dst_addr;
2043
2044 src_off = current_sit_addr(sbi, start);
2045 dst_off = next_sit_addr(sbi, src_off);
2046
2047 /* get current sit block page without lock */
2048 src_page = get_meta_page(sbi, src_off);
2049 dst_page = grab_meta_page(sbi, dst_off);
9850cf4a 2050 f2fs_bug_on(sbi, PageDirty(src_page));
351df4b2
JK		 2051
2052 src_addr = page_address(src_page);
2053 dst_addr = page_address(dst_page);
09cbfeaf 2054 memcpy(dst_addr, src_addr, PAGE_SIZE);
351df4b2
JK		 2055
2056 set_page_dirty(dst_page);
2057 f2fs_put_page(src_page, 1);
2058
2059 set_to_next_sit(sit_i, start);
2060
2061 return dst_page;
2062}
2063
184a5cd2
CY		 2064static struct sit_entry_set *grab_sit_entry_set(void)
2065{
2066 struct sit_entry_set *ses =
80c54505 2067 f2fs_kmem_cache_alloc(sit_entry_set_slab, GFP_NOFS);
184a5cd2
CY		 2068
2069 ses->entry_cnt = 0;
2070 INIT_LIST_HEAD(&ses->set_list);
2071 return ses;
2072}
2073
2074static void release_sit_entry_set(struct sit_entry_set *ses)
2075{
2076 list_del(&ses->set_list);
2077 kmem_cache_free(sit_entry_set_slab, ses);
2078}
2079
2080static void adjust_sit_entry_set(struct sit_entry_set *ses,
2081 struct list_head *head)
2082{
2083 struct sit_entry_set *next = ses;
2084
2085 if (list_is_last(&ses->set_list, head))
2086 return;
2087
2088 list_for_each_entry_continue(next, head, set_list)
2089 if (ses->entry_cnt <= next->entry_cnt)
2090 break;
2091
2092 list_move_tail(&ses->set_list, &next->set_list);
2093}
2094
2095static void add_sit_entry(unsigned int segno, struct list_head *head)
2096{
2097 struct sit_entry_set *ses;
2098 unsigned int start_segno = START_SEGNO(segno);
2099
2100 list_for_each_entry(ses, head, set_list) {
2101 if (ses->start_segno == start_segno) {
2102 ses->entry_cnt++;
2103 adjust_sit_entry_set(ses, head);
2104 return;
2105 }
2106 }
2107
2108 ses = grab_sit_entry_set();
2109
2110 ses->start_segno = start_segno;
2111 ses->entry_cnt++;
2112 list_add(&ses->set_list, head);
2113}
2114
2115static void add_sits_in_set(struct f2fs_sb_info *sbi)
2116{
2117 struct f2fs_sm_info *sm_info = SM_I(sbi);
2118 struct list_head *set_list = &sm_info->sit_entry_set;
2119 unsigned long *bitmap = SIT_I(sbi)->dirty_sentries_bitmap;
184a5cd2
CY		 2120 unsigned int segno;
2121
7cd8558b 2122 for_each_set_bit(segno, bitmap, MAIN_SEGS(sbi))
184a5cd2
CY		 2123 add_sit_entry(segno, set_list);
2124}
2125
2126static void remove_sits_in_journal(struct f2fs_sb_info *sbi)
351df4b2
JK		 2127{
2128 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2129 struct f2fs_journal *journal = curseg->journal;
351df4b2
JK		 2130 int i;
2131
b7ad7512 2132 down_write(&curseg->journal_rwsem);
dfc08a12 2133 for (i = 0; i < sits_in_cursum(journal); i++) {
184a5cd2
CY		 2134 unsigned int segno;
2135 bool dirtied;
2136
dfc08a12 2137 segno = le32_to_cpu(segno_in_journal(journal, i));
184a5cd2
CY		 2138 dirtied = __mark_sit_entry_dirty(sbi, segno);
2139
2140 if (!dirtied)
2141 add_sit_entry(segno, &SM_I(sbi)->sit_entry_set);
351df4b2 2142 }
dfc08a12 2143 update_sits_in_cursum(journal, -i);
b7ad7512 2144 up_write(&curseg->journal_rwsem);
351df4b2
JK		 2145}
2146
0a8165d7 2147/*
351df4b2
JK		 2148 * CP calls this function, which flushes SIT entries including sit_journal,
2149 * and moves prefree segs to free segs.
2150 */
4b2fecc8 2151void flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc)
351df4b2
JK		 2152{
2153 struct sit_info *sit_i = SIT_I(sbi);
2154 unsigned long *bitmap = sit_i->dirty_sentries_bitmap;
2155 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2156 struct f2fs_journal *journal = curseg->journal;
184a5cd2
CY		 2157 struct sit_entry_set *ses, *tmp;
2158 struct list_head *head = &SM_I(sbi)->sit_entry_set;
184a5cd2 2159 bool to_journal = true;
4b2fecc8 2160 struct seg_entry *se;
351df4b2 2161
351df4b2
JK		 2162 mutex_lock(&sit_i->sentry_lock);
2163
2b11a74b
WL		 2164 if (!sit_i->dirty_sentries)
2165 goto out;
2166
351df4b2 2167 /*
184a5cd2
CY		 2168 * add and account sit entries of dirty bitmap in sit entry
2169 * set temporarily
351df4b2 2170 */
184a5cd2 2171 add_sits_in_set(sbi);
351df4b2 2172
184a5cd2
CY		 2173 /*
2174 * if there are no enough space in journal to store dirty sit
2175 * entries, remove all entries from journal and add and account
2176 * them in sit entry set.
2177 */
dfc08a12 2178 if (!__has_cursum_space(journal, sit_i->dirty_sentries, SIT_JOURNAL))
184a5cd2 2179 remove_sits_in_journal(sbi);
b2955550 2180
184a5cd2
CY		 2181 /*
2182 * there are two steps to flush sit entries:
2183 * #1, flush sit entries to journal in current cold data summary block.
2184 * #2, flush sit entries to sit page.
2185 */
2186 list_for_each_entry_safe(ses, tmp, head, set_list) {
4a257ed6 2187 struct page *page = NULL;
184a5cd2
CY		 2188 struct f2fs_sit_block *raw_sit = NULL;
2189 unsigned int start_segno = ses->start_segno;
2190 unsigned int end = min(start_segno + SIT_ENTRY_PER_BLOCK,
7cd8558b 2191 (unsigned long)MAIN_SEGS(sbi));
184a5cd2
CY		 2192 unsigned int segno = start_segno;
2193
2194 if (to_journal &&
dfc08a12 2195 !__has_cursum_space(journal, ses->entry_cnt, SIT_JOURNAL))
184a5cd2
CY		 2196 to_journal = false;
2197
b7ad7512
CY		 2198 if (to_journal) {
2199 down_write(&curseg->journal_rwsem);
2200 } else {
184a5cd2
CY		 2201 page = get_next_sit_page(sbi, start_segno);
2202 raw_sit = page_address(page);
351df4b2 2203 }
351df4b2 2204
184a5cd2
CY		 2205 /* flush dirty sit entries in region of current sit set */
2206 for_each_set_bit_from(segno, bitmap, end) {
2207 int offset, sit_offset;
4b2fecc8
JK		 2208
2209 se = get_seg_entry(sbi, segno);
184a5cd2
CY		 2210
2211 /* add discard candidates */
d7bc2484 2212 if (cpc->reason != CP_DISCARD) {
4b2fecc8
JK		 2213 cpc->trim_start = segno;
2214 add_discard_addrs(sbi, cpc);
2215 }
184a5cd2
CY		 2216
2217 if (to_journal) {
dfc08a12 2218 offset = lookup_journal_in_cursum(journal,
184a5cd2
CY		 2219 SIT_JOURNAL, segno, 1);
2220 f2fs_bug_on(sbi, offset < 0);
dfc08a12 2221 segno_in_journal(journal, offset) =
184a5cd2
CY		 2222 cpu_to_le32(segno);
2223 seg_info_to_raw_sit(se,
dfc08a12 2224 &sit_in_journal(journal, offset));
184a5cd2
CY		 2225 } else {
2226 sit_offset = SIT_ENTRY_OFFSET(sit_i, segno);
2227 seg_info_to_raw_sit(se,
2228 &raw_sit->entries[sit_offset]);
2229 }
351df4b2 2230
184a5cd2
CY		 2231 __clear_bit(segno, bitmap);
2232 sit_i->dirty_sentries--;
2233 ses->entry_cnt--;
351df4b2
JK		 2234 }
2235
b7ad7512
CY		 2236 if (to_journal)
2237 up_write(&curseg->journal_rwsem);
2238 else
184a5cd2
CY		 2239 f2fs_put_page(page, 1);
2240
2241 f2fs_bug_on(sbi, ses->entry_cnt);
2242 release_sit_entry_set(ses);
351df4b2 2243 }
184a5cd2
CY		 2244
2245 f2fs_bug_on(sbi, !list_empty(head));
2246 f2fs_bug_on(sbi, sit_i->dirty_sentries);
184a5cd2 2247out:
4b2fecc8
JK		 2248 if (cpc->reason == CP_DISCARD) {
2249 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++)
2250 add_discard_addrs(sbi, cpc);
2251 }
351df4b2 2252 mutex_unlock(&sit_i->sentry_lock);
351df4b2 2253
351df4b2
JK		 2254 set_prefree_as_free_segments(sbi);
2255}
2256
2257static int build_sit_info(struct f2fs_sb_info *sbi)
2258{
2259 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
351df4b2
JK		 2260 struct sit_info *sit_i;
2261 unsigned int sit_segs, start;
2262 char *src_bitmap, *dst_bitmap;
2263 unsigned int bitmap_size;
2264
2265 /* allocate memory for SIT information */
2266 sit_i = kzalloc(sizeof(struct sit_info), GFP_KERNEL);
2267 if (!sit_i)
2268 return -ENOMEM;
2269
2270 SM_I(sbi)->sit_info = sit_i;
2271
39307a8e
JK		 2272 sit_i->sentries = f2fs_kvzalloc(MAIN_SEGS(sbi) *
2273 sizeof(struct seg_entry), GFP_KERNEL);
351df4b2
JK		 2274 if (!sit_i->sentries)
2275 return -ENOMEM;
2276
7cd8558b 2277 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
39307a8e 2278 sit_i->dirty_sentries_bitmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 2279 if (!sit_i->dirty_sentries_bitmap)
2280 return -ENOMEM;
2281
7cd8558b 2282 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2
JK		 2283 sit_i->sentries[start].cur_valid_map
2284 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2285 sit_i->sentries[start].ckpt_valid_map
2286 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
a66cdd98 2287 if (!sit_i->sentries[start].cur_valid_map ||
3e025740 2288 !sit_i->sentries[start].ckpt_valid_map)
351df4b2 2289 return -ENOMEM;
3e025740
JK		 2290
2291 if (f2fs_discard_en(sbi)) {
2292 sit_i->sentries[start].discard_map
2293 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2294 if (!sit_i->sentries[start].discard_map)
2295 return -ENOMEM;
2296 }
351df4b2
JK		 2297 }
2298
60a3b782
JK		 2299 sit_i->tmp_map = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2300 if (!sit_i->tmp_map)
2301 return -ENOMEM;
2302
351df4b2 2303 if (sbi->segs_per_sec > 1) {
39307a8e
JK		 2304 sit_i->sec_entries = f2fs_kvzalloc(MAIN_SECS(sbi) *
2305 sizeof(struct sec_entry), GFP_KERNEL);
351df4b2
JK		 2306 if (!sit_i->sec_entries)
2307 return -ENOMEM;
2308 }
2309
2310 /* get information related with SIT */
2311 sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1;
2312
2313 /* setup SIT bitmap from ckeckpoint pack */
2314 bitmap_size = __bitmap_size(sbi, SIT_BITMAP);
2315 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP);
2316
79b5793b 2317 dst_bitmap = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
351df4b2
JK		 2318 if (!dst_bitmap)
2319 return -ENOMEM;
351df4b2
JK		 2320
2321 /* init SIT information */
2322 sit_i->s_ops = &default_salloc_ops;
2323
2324 sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr);
2325 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg;
c79b7ff1 2326 sit_i->written_valid_blocks = 0;
351df4b2
JK		 2327 sit_i->sit_bitmap = dst_bitmap;
2328 sit_i->bitmap_size = bitmap_size;
2329 sit_i->dirty_sentries = 0;
2330 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK;
2331 sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time);
2332 sit_i->mounted_time = CURRENT_TIME_SEC.tv_sec;
2333 mutex_init(&sit_i->sentry_lock);
2334 return 0;
2335}
2336
2337static int build_free_segmap(struct f2fs_sb_info *sbi)
2338{
351df4b2
JK		 2339 struct free_segmap_info *free_i;
2340 unsigned int bitmap_size, sec_bitmap_size;
2341
2342 /* allocate memory for free segmap information */
2343 free_i = kzalloc(sizeof(struct free_segmap_info), GFP_KERNEL);
2344 if (!free_i)
2345 return -ENOMEM;
2346
2347 SM_I(sbi)->free_info = free_i;
2348
7cd8558b 2349 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
39307a8e 2350 free_i->free_segmap = f2fs_kvmalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 2351 if (!free_i->free_segmap)
2352 return -ENOMEM;
2353
7cd8558b 2354 sec_bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
39307a8e 2355 free_i->free_secmap = f2fs_kvmalloc(sec_bitmap_size, GFP_KERNEL);
351df4b2
JK		 2356 if (!free_i->free_secmap)
2357 return -ENOMEM;
2358
2359 /* set all segments as dirty temporarily */
2360 memset(free_i->free_segmap, 0xff, bitmap_size);
2361 memset(free_i->free_secmap, 0xff, sec_bitmap_size);
2362
2363 /* init free segmap information */
7cd8558b 2364 free_i->start_segno = GET_SEGNO_FROM_SEG0(sbi, MAIN_BLKADDR(sbi));
351df4b2
JK		 2365 free_i->free_segments = 0;
2366 free_i->free_sections = 0;
1a118ccf 2367 spin_lock_init(&free_i->segmap_lock);
351df4b2
JK		 2368 return 0;
2369}
2370
2371static int build_curseg(struct f2fs_sb_info *sbi)
2372{
1042d60f 2373 struct curseg_info *array;
351df4b2
JK		 2374 int i;
2375
b434babf 2376 array = kcalloc(NR_CURSEG_TYPE, sizeof(*array), GFP_KERNEL);
351df4b2
JK		 2377 if (!array)
2378 return -ENOMEM;
2379
2380 SM_I(sbi)->curseg_array = array;
2381
2382 for (i = 0; i < NR_CURSEG_TYPE; i++) {
2383 mutex_init(&array[i].curseg_mutex);
09cbfeaf 2384 array[i].sum_blk = kzalloc(PAGE_SIZE, GFP_KERNEL);
351df4b2
JK		 2385 if (!array[i].sum_blk)
2386 return -ENOMEM;
b7ad7512
CY		 2387 init_rwsem(&array[i].journal_rwsem);
2388 array[i].journal = kzalloc(sizeof(struct f2fs_journal),
2389 GFP_KERNEL);
2390 if (!array[i].journal)
2391 return -ENOMEM;
351df4b2
JK		 2392 array[i].segno = NULL_SEGNO;
2393 array[i].next_blkoff = 0;
2394 }
2395 return restore_curseg_summaries(sbi);
2396}
2397
2398static void build_sit_entries(struct f2fs_sb_info *sbi)
2399{
2400 struct sit_info *sit_i = SIT_I(sbi);
2401 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2402 struct f2fs_journal *journal = curseg->journal;
9c094040
YH		 2403 struct seg_entry *se;
2404 struct f2fs_sit_entry sit;
74de593a
CY		 2405 int sit_blk_cnt = SIT_BLK_CNT(sbi);
2406 unsigned int i, start, end;
2407 unsigned int readed, start_blk = 0;
351df4b2 2408
74de593a 2409 do {
664ba972
JK		 2410 readed = ra_meta_pages(sbi, start_blk, BIO_MAX_PAGES,
2411 META_SIT, true);
74de593a
CY		 2412
2413 start = start_blk * sit_i->sents_per_block;
2414 end = (start_blk + readed) * sit_i->sents_per_block;
2415
7cd8558b 2416 for (; start < end && start < MAIN_SEGS(sbi); start++) {
74de593a 2417 struct f2fs_sit_block *sit_blk;
74de593a
CY		 2418 struct page *page;
2419
9c094040 2420 se = &sit_i->sentries[start];
74de593a
CY		 2421 page = get_current_sit_page(sbi, start);
2422 sit_blk = (struct f2fs_sit_block *)page_address(page);
2423 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)];
2424 f2fs_put_page(page, 1);
d600af23 2425
74de593a
CY		 2426 check_block_count(sbi, start, &sit);
2427 seg_info_from_raw_sit(se, &sit);
a66cdd98
JK		 2428
2429 /* build discard map only one time */
3e025740
JK		 2430 if (f2fs_discard_en(sbi)) {
2431 memcpy(se->discard_map, se->cur_valid_map,
2432 SIT_VBLOCK_MAP_SIZE);
2433 sbi->discard_blks += sbi->blocks_per_seg -
2434 se->valid_blocks;
2435 }
a66cdd98 2436
d600af23
CY		 2437 if (sbi->segs_per_sec > 1)
2438 get_sec_entry(sbi, start)->valid_blocks +=
2439 se->valid_blocks;
351df4b2 2440 }
74de593a
CY		 2441 start_blk += readed;
2442 } while (start_blk < sit_blk_cnt);
d600af23
CY		 2443
2444 down_read(&curseg->journal_rwsem);
2445 for (i = 0; i < sits_in_cursum(journal); i++) {
d600af23
CY		 2446 unsigned int old_valid_blocks;
2447
2448 start = le32_to_cpu(segno_in_journal(journal, i));
2449 se = &sit_i->sentries[start];
2450 sit = sit_in_journal(journal, i);
2451
2452 old_valid_blocks = se->valid_blocks;
2453
2454 check_block_count(sbi, start, &sit);
2455 seg_info_from_raw_sit(se, &sit);
2456
2457 if (f2fs_discard_en(sbi)) {
2458 memcpy(se->discard_map, se->cur_valid_map,
2459 SIT_VBLOCK_MAP_SIZE);
2460 sbi->discard_blks += old_valid_blocks -
2461 se->valid_blocks;
2462 }
2463
2464 if (sbi->segs_per_sec > 1)
2465 get_sec_entry(sbi, start)->valid_blocks +=
2466 se->valid_blocks - old_valid_blocks;
2467 }
2468 up_read(&curseg->journal_rwsem);
351df4b2
JK		 2469}
2470
2471static void init_free_segmap(struct f2fs_sb_info *sbi)
2472{
2473 unsigned int start;
2474 int type;
2475
7cd8558b 2476 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2
JK		 2477 struct seg_entry *sentry = get_seg_entry(sbi, start);
2478 if (!sentry->valid_blocks)
2479 __set_free(sbi, start);
c79b7ff1
JK		 2480 else
2481 SIT_I(sbi)->written_valid_blocks +=
2482 sentry->valid_blocks;
351df4b2
JK		 2483 }
2484
2485 /* set use the current segments */
2486 for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) {
2487 struct curseg_info *curseg_t = CURSEG_I(sbi, type);
2488 __set_test_and_inuse(sbi, curseg_t->segno);
2489 }
2490}
2491
2492static void init_dirty_segmap(struct f2fs_sb_info *sbi)
2493{
2494 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2495 struct free_segmap_info *free_i = FREE_I(sbi);
7cd8558b 2496 unsigned int segno = 0, offset = 0;
351df4b2
JK		 2497 unsigned short valid_blocks;
2498
8736fbf0 2499 while (1) {
351df4b2 2500 /* find dirty segment based on free segmap */
7cd8558b
JK		 2501 segno = find_next_inuse(free_i, MAIN_SEGS(sbi), offset);
2502 if (segno >= MAIN_SEGS(sbi))
351df4b2
JK		 2503 break;
2504 offset = segno + 1;
2505 valid_blocks = get_valid_blocks(sbi, segno, 0);
ec325b52 2506 if (valid_blocks == sbi->blocks_per_seg || !valid_blocks)
351df4b2 2507 continue;
ec325b52
JK		 2508 if (valid_blocks > sbi->blocks_per_seg) {
2509 f2fs_bug_on(sbi, 1);
2510 continue;
2511 }
351df4b2
JK		 2512 mutex_lock(&dirty_i->seglist_lock);
2513 __locate_dirty_segment(sbi, segno, DIRTY);
2514 mutex_unlock(&dirty_i->seglist_lock);
2515 }
2516}
2517
5ec4e49f 2518static int init_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 2519{
2520 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
7cd8558b 2521 unsigned int bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
351df4b2 2522
39307a8e 2523 dirty_i->victim_secmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
5ec4e49f 2524 if (!dirty_i->victim_secmap)
351df4b2
JK		 2525 return -ENOMEM;
2526 return 0;
2527}
2528
2529static int build_dirty_segmap(struct f2fs_sb_info *sbi)
2530{
2531 struct dirty_seglist_info *dirty_i;
2532 unsigned int bitmap_size, i;
2533
2534 /* allocate memory for dirty segments list information */
2535 dirty_i = kzalloc(sizeof(struct dirty_seglist_info), GFP_KERNEL);
2536 if (!dirty_i)
2537 return -ENOMEM;
2538
2539 SM_I(sbi)->dirty_info = dirty_i;
2540 mutex_init(&dirty_i->seglist_lock);
2541
7cd8558b 2542 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
351df4b2
JK		 2543
2544 for (i = 0; i < NR_DIRTY_TYPE; i++) {
39307a8e 2545 dirty_i->dirty_segmap[i] = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 2546 if (!dirty_i->dirty_segmap[i])
2547 return -ENOMEM;
2548 }
2549
2550 init_dirty_segmap(sbi);
5ec4e49f 2551 return init_victim_secmap(sbi);
351df4b2
JK		 2552}
2553
0a8165d7 2554/*
351df4b2
JK		 2555 * Update min, max modified time for cost-benefit GC algorithm
2556 */
2557static void init_min_max_mtime(struct f2fs_sb_info *sbi)
2558{
2559 struct sit_info *sit_i = SIT_I(sbi);
2560 unsigned int segno;
2561
2562 mutex_lock(&sit_i->sentry_lock);
2563
2564 sit_i->min_mtime = LLONG_MAX;
2565
7cd8558b 2566 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
351df4b2
JK		 2567 unsigned int i;
2568 unsigned long long mtime = 0;
2569
2570 for (i = 0; i < sbi->segs_per_sec; i++)
2571 mtime += get_seg_entry(sbi, segno + i)->mtime;
2572
2573 mtime = div_u64(mtime, sbi->segs_per_sec);
2574
2575 if (sit_i->min_mtime > mtime)
2576 sit_i->min_mtime = mtime;
2577 }
2578 sit_i->max_mtime = get_mtime(sbi);
2579 mutex_unlock(&sit_i->sentry_lock);
2580}
2581
2582int build_segment_manager(struct f2fs_sb_info *sbi)
2583{
2584 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
2585 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1042d60f 2586 struct f2fs_sm_info *sm_info;
351df4b2
JK		 2587 int err;
2588
2589 sm_info = kzalloc(sizeof(struct f2fs_sm_info), GFP_KERNEL);
2590 if (!sm_info)
2591 return -ENOMEM;
2592
2593 /* init sm info */
2594 sbi->sm_info = sm_info;
351df4b2
JK		 2595 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr);
2596 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr);
2597 sm_info->segment_count = le32_to_cpu(raw_super->segment_count);
2598 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count);
2599 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count);
2600 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main);
2601 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr);
58c41035
JK		 2602 sm_info->rec_prefree_segments = sm_info->main_segments *
2603 DEF_RECLAIM_PREFREE_SEGMENTS / 100;
44a83499
JK		 2604 if (sm_info->rec_prefree_segments > DEF_MAX_RECLAIM_PREFREE_SEGMENTS)
2605 sm_info->rec_prefree_segments = DEF_MAX_RECLAIM_PREFREE_SEGMENTS;
2606
52763a4b
JK		 2607 if (!test_opt(sbi, LFS))
2608 sm_info->ipu_policy = 1 << F2FS_IPU_FSYNC;
216fbd64 2609 sm_info->min_ipu_util = DEF_MIN_IPU_UTIL;
c1ce1b02 2610 sm_info->min_fsync_blocks = DEF_MIN_FSYNC_BLOCKS;
351df4b2 2611
7fd9e544 2612 INIT_LIST_HEAD(&sm_info->discard_list);
275b66b0 2613 INIT_LIST_HEAD(&sm_info->wait_list);
7fd9e544
JK		 2614 sm_info->nr_discards = 0;
2615 sm_info->max_discards = 0;
2616
bba681cb
JK		 2617 sm_info->trim_sections = DEF_BATCHED_TRIM_SECTIONS;
2618
184a5cd2
CY		 2619 INIT_LIST_HEAD(&sm_info->sit_entry_set);
2620
b270ad6f 2621 if (test_opt(sbi, FLUSH_MERGE) && !f2fs_readonly(sbi->sb)) {
2163d198
GZ		 2622 err = create_flush_cmd_control(sbi);
2623 if (err)
a688b9d9 2624 return err;
6b4afdd7
JK		 2625 }
2626
351df4b2
JK		 2627 err = build_sit_info(sbi);
2628 if (err)
2629 return err;
2630 err = build_free_segmap(sbi);
2631 if (err)
2632 return err;
2633 err = build_curseg(sbi);
2634 if (err)
2635 return err;
2636
2637 /* reinit free segmap based on SIT */
2638 build_sit_entries(sbi);
2639
2640 init_free_segmap(sbi);
2641 err = build_dirty_segmap(sbi);
2642 if (err)
2643 return err;
2644
2645 init_min_max_mtime(sbi);
2646 return 0;
2647}
2648
2649static void discard_dirty_segmap(struct f2fs_sb_info *sbi,
2650 enum dirty_type dirty_type)
2651{
2652 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2653
2654 mutex_lock(&dirty_i->seglist_lock);
39307a8e 2655 kvfree(dirty_i->dirty_segmap[dirty_type]);
351df4b2
JK		 2656 dirty_i->nr_dirty[dirty_type] = 0;
2657 mutex_unlock(&dirty_i->seglist_lock);
2658}
2659
5ec4e49f 2660static void destroy_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 2661{
2662 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
39307a8e 2663 kvfree(dirty_i->victim_secmap);
351df4b2
JK		 2664}
2665
2666static void destroy_dirty_segmap(struct f2fs_sb_info *sbi)
2667{
2668 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2669 int i;
2670
2671 if (!dirty_i)
2672 return;
2673
2674 /* discard pre-free/dirty segments list */
2675 for (i = 0; i < NR_DIRTY_TYPE; i++)
2676 discard_dirty_segmap(sbi, i);
2677
5ec4e49f 2678 destroy_victim_secmap(sbi);
351df4b2
JK		 2679 SM_I(sbi)->dirty_info = NULL;
2680 kfree(dirty_i);
2681}
2682
2683static void destroy_curseg(struct f2fs_sb_info *sbi)
2684{
2685 struct curseg_info *array = SM_I(sbi)->curseg_array;
2686 int i;
2687
2688 if (!array)
2689 return;
2690 SM_I(sbi)->curseg_array = NULL;
b7ad7512 2691 for (i = 0; i < NR_CURSEG_TYPE; i++) {
351df4b2 2692 kfree(array[i].sum_blk);
b7ad7512
CY		 2693 kfree(array[i].journal);
2694 }
351df4b2
JK		 2695 kfree(array);
2696}
2697
2698static void destroy_free_segmap(struct f2fs_sb_info *sbi)
2699{
2700 struct free_segmap_info *free_i = SM_I(sbi)->free_info;
2701 if (!free_i)
2702 return;
2703 SM_I(sbi)->free_info = NULL;
39307a8e
JK		 2704 kvfree(free_i->free_segmap);
2705 kvfree(free_i->free_secmap);
351df4b2
JK		 2706 kfree(free_i);
2707}
2708
2709static void destroy_sit_info(struct f2fs_sb_info *sbi)
2710{
2711 struct sit_info *sit_i = SIT_I(sbi);
2712 unsigned int start;
2713
2714 if (!sit_i)
2715 return;
2716
2717 if (sit_i->sentries) {
7cd8558b 2718 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2
JK		 2719 kfree(sit_i->sentries[start].cur_valid_map);
2720 kfree(sit_i->sentries[start].ckpt_valid_map);
a66cdd98 2721 kfree(sit_i->sentries[start].discard_map);
351df4b2
JK		 2722 }
2723 }
60a3b782
JK		 2724 kfree(sit_i->tmp_map);
2725
39307a8e
JK		 2726 kvfree(sit_i->sentries);
2727 kvfree(sit_i->sec_entries);
2728 kvfree(sit_i->dirty_sentries_bitmap);
351df4b2
JK		 2729
2730 SM_I(sbi)->sit_info = NULL;
2731 kfree(sit_i->sit_bitmap);
2732 kfree(sit_i);
2733}
2734
2735void destroy_segment_manager(struct f2fs_sb_info *sbi)
2736{
2737 struct f2fs_sm_info *sm_info = SM_I(sbi);
a688b9d9 2738
3b03f724
CY		 2739 if (!sm_info)
2740 return;
2163d198 2741 destroy_flush_cmd_control(sbi);
351df4b2
JK		 2742 destroy_dirty_segmap(sbi);
2743 destroy_curseg(sbi);
2744 destroy_free_segmap(sbi);
2745 destroy_sit_info(sbi);
2746 sbi->sm_info = NULL;
2747 kfree(sm_info);
2748}
7fd9e544
JK		 2749
2750int __init create_segment_manager_caches(void)
2751{
2752 discard_entry_slab = f2fs_kmem_cache_create("discard_entry",
e8512d2e 2753 sizeof(struct discard_entry));
7fd9e544 2754 if (!discard_entry_slab)
184a5cd2
CY		 2755 goto fail;
2756
275b66b0
CY		 2757 bio_entry_slab = f2fs_kmem_cache_create("bio_entry",
2758 sizeof(struct bio_entry));
2759 if (!bio_entry_slab)
6ab2a308 2760 goto destroy_discard_entry;
275b66b0 2761
184a5cd2 2762 sit_entry_set_slab = f2fs_kmem_cache_create("sit_entry_set",
c9ee0085 2763 sizeof(struct sit_entry_set));
184a5cd2 2764 if (!sit_entry_set_slab)
275b66b0 2765 goto destroy_bio_entry;
88b88a66
JK		 2766
2767 inmem_entry_slab = f2fs_kmem_cache_create("inmem_page_entry",
2768 sizeof(struct inmem_pages));
2769 if (!inmem_entry_slab)
2770 goto destroy_sit_entry_set;
7fd9e544 2771 return 0;
184a5cd2 2772
88b88a66
JK		 2773destroy_sit_entry_set:
2774 kmem_cache_destroy(sit_entry_set_slab);
275b66b0
CY		 2775destroy_bio_entry:
2776 kmem_cache_destroy(bio_entry_slab);
6ab2a308 2777destroy_discard_entry:
184a5cd2
CY		 2778 kmem_cache_destroy(discard_entry_slab);
2779fail:
2780 return -ENOMEM;
7fd9e544
JK		 2781}
2782
2783void destroy_segment_manager_caches(void)
2784{
184a5cd2 2785 kmem_cache_destroy(sit_entry_set_slab);
275b66b0 2786 kmem_cache_destroy(bio_entry_slab);
7fd9e544 2787 kmem_cache_destroy(discard_entry_slab);
88b88a66 2788 kmem_cache_destroy(inmem_entry_slab);
7fd9e544 2789}
Motorola kernel-slsi