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