]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - fs/f2fs/segment.c
projects / mirror_ubuntu-bionic-kernel.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
f2fs: use rb-tree to track pending discard commands
[mirror_ubuntu-bionic-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>
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;
b01a9201 29static struct kmem_cache *discard_cmd_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
245 mutex_lock(&fi->inmem_lock);
28bc106b 246 __revoke_inmem_pages(inode, &fi->inmem_pages, true, false);
29b96b54 247 mutex_unlock(&fi->inmem_lock);
5fe45743
CY		 248
249 clear_inode_flag(inode, FI_ATOMIC_FILE);
250 stat_dec_atomic_write(inode);
29b96b54
CY		 251}
252
8c242db9
JK		 253void drop_inmem_page(struct inode *inode, struct page *page)
254{
255 struct f2fs_inode_info *fi = F2FS_I(inode);
256 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
257 struct list_head *head = &fi->inmem_pages;
258 struct inmem_pages *cur = NULL;
259
260 f2fs_bug_on(sbi, !IS_ATOMIC_WRITTEN_PAGE(page));
261
262 mutex_lock(&fi->inmem_lock);
263 list_for_each_entry(cur, head, list) {
264 if (cur->page == page)
265 break;
266 }
267
268 f2fs_bug_on(sbi, !cur || cur->page != page);
269 list_del(&cur->list);
270 mutex_unlock(&fi->inmem_lock);
271
272 dec_page_count(sbi, F2FS_INMEM_PAGES);
273 kmem_cache_free(inmem_entry_slab, cur);
274
275 ClearPageUptodate(page);
276 set_page_private(page, 0);
277 ClearPagePrivate(page);
278 f2fs_put_page(page, 0);
279
280 trace_f2fs_commit_inmem_page(page, INMEM_INVALIDATE);
281}
282
28bc106b
CY		 283static int __commit_inmem_pages(struct inode *inode,
284 struct list_head *revoke_list)
88b88a66
JK		 285{
286 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
287 struct f2fs_inode_info *fi = F2FS_I(inode);
288 struct inmem_pages *cur, *tmp;
88b88a66 289 struct f2fs_io_info fio = {
05ca3632 290 .sbi = sbi,
88b88a66 291 .type = DATA,
04d328de 292 .op = REQ_OP_WRITE,
70fd7614 293 .op_flags = REQ_SYNC | REQ_PRIO,
4375a336 294 .encrypted_page = NULL,
88b88a66 295 };
942fd319 296 pgoff_t last_idx = ULONG_MAX;
edb27dee 297 int err = 0;
88b88a66 298
88b88a66 299 list_for_each_entry_safe(cur, tmp, &fi->inmem_pages, list) {
28bc106b
CY		 300 struct page *page = cur->page;
301
302 lock_page(page);
303 if (page->mapping == inode->i_mapping) {
304 trace_f2fs_commit_inmem_page(page, INMEM);
305
306 set_page_dirty(page);
307 f2fs_wait_on_page_writeback(page, DATA, true);
933439c8 308 if (clear_page_dirty_for_io(page)) {
29b96b54 309 inode_dec_dirty_pages(inode);
933439c8
CY		 310 remove_dirty_inode(inode);
311 }
28bc106b
CY		 312
313 fio.page = page;
29b96b54
CY		 314 err = do_write_data_page(&fio);
315 if (err) {
28bc106b 316 unlock_page(page);
29b96b54 317 break;
70c640b1 318 }
29b96b54 319
28bc106b
CY		 320 /* record old blkaddr for revoking */
321 cur->old_addr = fio.old_blkaddr;
942fd319 322 last_idx = page->index;
28bc106b
CY		 323 }
324 unlock_page(page);
325 list_move_tail(&cur->list, revoke_list);
88b88a66 326 }
29b96b54 327
942fd319
JK		 328 if (last_idx != ULONG_MAX)
329 f2fs_submit_merged_bio_cond(sbi, inode, 0, last_idx,
330 DATA, WRITE);
28bc106b
CY		 331
332 if (!err)
333 __revoke_inmem_pages(inode, revoke_list, false, false);
334
29b96b54
CY		 335 return err;
336}
337
338int commit_inmem_pages(struct inode *inode)
339{
340 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
341 struct f2fs_inode_info *fi = F2FS_I(inode);
28bc106b
CY		 342 struct list_head revoke_list;
343 int err;
29b96b54 344
28bc106b 345 INIT_LIST_HEAD(&revoke_list);
29b96b54
CY		 346 f2fs_balance_fs(sbi, true);
347 f2fs_lock_op(sbi);
348
5fe45743
CY		 349 set_inode_flag(inode, FI_ATOMIC_COMMIT);
350
29b96b54 351 mutex_lock(&fi->inmem_lock);
28bc106b
CY		 352 err = __commit_inmem_pages(inode, &revoke_list);
353 if (err) {
354 int ret;
355 /*
356 * try to revoke all committed pages, but still we could fail
357 * due to no memory or other reason, if that happened, EAGAIN
358 * will be returned, which means in such case, transaction is
359 * already not integrity, caller should use journal to do the
360 * recovery or rewrite & commit last transaction. For other
361 * error number, revoking was done by filesystem itself.
362 */
363 ret = __revoke_inmem_pages(inode, &revoke_list, false, true);
364 if (ret)
365 err = ret;
366
367 /* drop all uncommitted pages */
368 __revoke_inmem_pages(inode, &fi->inmem_pages, true, false);
369 }
88b88a66
JK		 370 mutex_unlock(&fi->inmem_lock);
371
5fe45743
CY		 372 clear_inode_flag(inode, FI_ATOMIC_COMMIT);
373
29b96b54 374 f2fs_unlock_op(sbi);
edb27dee 375 return err;
88b88a66
JK		 376}
377
0a8165d7 378/*
351df4b2
JK		 379 * This function balances dirty node and dentry pages.
380 * In addition, it controls garbage collection.
381 */
2c4db1a6 382void f2fs_balance_fs(struct f2fs_sb_info *sbi, bool need)
351df4b2 383{
0f348028 384#ifdef CONFIG_F2FS_FAULT_INJECTION
55523519
CY		 385 if (time_to_inject(sbi, FAULT_CHECKPOINT)) {
386 f2fs_show_injection_info(FAULT_CHECKPOINT);
0f348028 387 f2fs_stop_checkpoint(sbi, false);
55523519 388 }
0f348028
CY		 389#endif
390
2c4db1a6
JK		 391 if (!need)
392 return;
e589c2c4
JK		 393
394 /* balance_fs_bg is able to be pending */
395 if (excess_cached_nats(sbi))
396 f2fs_balance_fs_bg(sbi);
397
351df4b2 398 /*
029cd28c
JK		 399 * We should do GC or end up with checkpoint, if there are so many dirty
400 * dir/node pages without enough free segments.
351df4b2 401 */
7f3037a5 402 if (has_not_enough_free_secs(sbi, 0, 0)) {
351df4b2 403 mutex_lock(&sbi->gc_mutex);
7702bdbe 404 f2fs_gc(sbi, false, false);
351df4b2
JK		 405 }
406}
407
4660f9c0
JK		 408void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi)
409{
1dcc336b 410 /* try to shrink extent cache when there is no enough memory */
554df79e
JK		 411 if (!available_free_memory(sbi, EXTENT_CACHE))
412 f2fs_shrink_extent_tree(sbi, EXTENT_CACHE_SHRINK_NUMBER);
1dcc336b 413
1b38dc8e
JK		 414 /* check the # of cached NAT entries */
415 if (!available_free_memory(sbi, NAT_ENTRIES))
416 try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK);
417
31696580 418 if (!available_free_memory(sbi, FREE_NIDS))
ad4edb83
JK		 419 try_to_free_nids(sbi, MAX_FREE_NIDS);
420 else
22ad0b6a 421 build_free_nids(sbi, false, false);
31696580 422
f455c8a5
JK		 423 if (!is_idle(sbi))
424 return;
31696580 425
1b38dc8e
JK		 426 /* checkpoint is the only way to shrink partial cached entries */
427 if (!available_free_memory(sbi, NAT_ENTRIES) ||
60b99b48 428 !available_free_memory(sbi, INO_ENTRIES) ||
7d768d2c
CY		 429 excess_prefree_segs(sbi) ||
430 excess_dirty_nats(sbi) ||
f455c8a5 431 f2fs_time_over(sbi, CP_TIME)) {
e9f5b8b8
CY		 432 if (test_opt(sbi, DATA_FLUSH)) {
433 struct blk_plug plug;
434
435 blk_start_plug(&plug);
36b35a0d 436 sync_dirty_inodes(sbi, FILE_INODE);
e9f5b8b8
CY		 437 blk_finish_plug(&plug);
438 }
4660f9c0 439 f2fs_sync_fs(sbi->sb, true);
42190d2a 440 stat_inc_bg_cp_count(sbi->stat_info);
36b35a0d 441 }
4660f9c0
JK		 442}
443
20fda56b
KM		 444static int __submit_flush_wait(struct f2fs_sb_info *sbi,
445 struct block_device *bdev)
3c62be17
JK		 446{
447 struct bio *bio = f2fs_bio_alloc(0);
448 int ret;
449
09cb6464 450 bio->bi_opf = REQ_OP_WRITE | REQ_PREFLUSH;
3c62be17
JK		 451 bio->bi_bdev = bdev;
452 ret = submit_bio_wait(bio);
453 bio_put(bio);
20fda56b
KM		 454
455 trace_f2fs_issue_flush(bdev, test_opt(sbi, NOBARRIER),
456 test_opt(sbi, FLUSH_MERGE), ret);
3c62be17
JK		 457 return ret;
458}
459
460static int submit_flush_wait(struct f2fs_sb_info *sbi)
461{
20fda56b 462 int ret = __submit_flush_wait(sbi, sbi->sb->s_bdev);
3c62be17
JK		 463 int i;
464
20fda56b
KM		 465 if (!sbi->s_ndevs || ret)
466 return ret;
467
468 for (i = 1; i < sbi->s_ndevs; i++) {
469 ret = __submit_flush_wait(sbi, FDEV(i).bdev);
470 if (ret)
471 break;
3c62be17
JK		 472 }
473 return ret;
474}
475
2163d198 476static int issue_flush_thread(void *data)
6b4afdd7
JK		 477{
478 struct f2fs_sb_info *sbi = data;
b01a9201 479 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
a688b9d9 480 wait_queue_head_t *q = &fcc->flush_wait_queue;
6b4afdd7
JK		 481repeat:
482 if (kthread_should_stop())
483 return 0;
484
721bd4d5 485 if (!llist_empty(&fcc->issue_list)) {
6b4afdd7
JK		 486 struct flush_cmd *cmd, *next;
487 int ret;
488
721bd4d5
GZ		 489 fcc->dispatch_list = llist_del_all(&fcc->issue_list);
490 fcc->dispatch_list = llist_reverse_order(fcc->dispatch_list);
491
3c62be17 492 ret = submit_flush_wait(sbi);
8b8dd65f
CY		 493 atomic_inc(&fcc->issued_flush);
494
721bd4d5
GZ		 495 llist_for_each_entry_safe(cmd, next,
496 fcc->dispatch_list, llnode) {
6b4afdd7 497 cmd->ret = ret;
6b4afdd7
JK		 498 complete(&cmd->wait);
499 }
a688b9d9 500 fcc->dispatch_list = NULL;
6b4afdd7
JK		 501 }
502
a688b9d9 503 wait_event_interruptible(*q,
721bd4d5 504 kthread_should_stop() || !llist_empty(&fcc->issue_list));
6b4afdd7
JK		 505 goto repeat;
506}
507
508int f2fs_issue_flush(struct f2fs_sb_info *sbi)
509{
b01a9201 510 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
adf8d90b 511 struct flush_cmd cmd;
8b8dd65f 512 int ret;
6b4afdd7 513
0f7b2abd
JK		 514 if (test_opt(sbi, NOBARRIER))
515 return 0;
516
8b8dd65f
CY		 517 if (!test_opt(sbi, FLUSH_MERGE)) {
518 ret = submit_flush_wait(sbi);
519 atomic_inc(&fcc->issued_flush);
520 return ret;
521 }
740432f8 522
8b8dd65f
CY		 523 if (!atomic_read(&fcc->issing_flush)) {
524 atomic_inc(&fcc->issing_flush);
3c62be17 525 ret = submit_flush_wait(sbi);
8b8dd65f
CY		 526 atomic_dec(&fcc->issing_flush);
527
528 atomic_inc(&fcc->issued_flush);
740432f8
JK		 529 return ret;
530 }
6b4afdd7 531
adf8d90b 532 init_completion(&cmd.wait);
6b4afdd7 533
8b8dd65f 534 atomic_inc(&fcc->issing_flush);
721bd4d5 535 llist_add(&cmd.llnode, &fcc->issue_list);
6b4afdd7 536
a688b9d9
GZ		 537 if (!fcc->dispatch_list)
538 wake_up(&fcc->flush_wait_queue);
6b4afdd7 539
5eba8c5d
JK		 540 if (fcc->f2fs_issue_flush) {
541 wait_for_completion(&cmd.wait);
8b8dd65f 542 atomic_dec(&fcc->issing_flush);
5eba8c5d
JK		 543 } else {
544 llist_del_all(&fcc->issue_list);
8b8dd65f 545 atomic_set(&fcc->issing_flush, 0);
5eba8c5d 546 }
adf8d90b
CY		 547
548 return cmd.ret;
6b4afdd7
JK		 549}
550
2163d198
GZ		 551int create_flush_cmd_control(struct f2fs_sb_info *sbi)
552{
553 dev_t dev = sbi->sb->s_bdev->bd_dev;
554 struct flush_cmd_control *fcc;
555 int err = 0;
556
b01a9201
JK		 557 if (SM_I(sbi)->fcc_info) {
558 fcc = SM_I(sbi)->fcc_info;
5eba8c5d
JK		 559 goto init_thread;
560 }
561
2163d198
GZ		 562 fcc = kzalloc(sizeof(struct flush_cmd_control), GFP_KERNEL);
563 if (!fcc)
564 return -ENOMEM;
8b8dd65f
CY		 565 atomic_set(&fcc->issued_flush, 0);
566 atomic_set(&fcc->issing_flush, 0);
2163d198 567 init_waitqueue_head(&fcc->flush_wait_queue);
721bd4d5 568 init_llist_head(&fcc->issue_list);
b01a9201 569 SM_I(sbi)->fcc_info = fcc;
5eba8c5d 570init_thread:
2163d198
GZ		 571 fcc->f2fs_issue_flush = kthread_run(issue_flush_thread, sbi,
572 "f2fs_flush-%u:%u", MAJOR(dev), MINOR(dev));
573 if (IS_ERR(fcc->f2fs_issue_flush)) {
574 err = PTR_ERR(fcc->f2fs_issue_flush);
575 kfree(fcc);
b01a9201 576 SM_I(sbi)->fcc_info = NULL;
2163d198
GZ		 577 return err;
578 }
2163d198
GZ		 579
580 return err;
581}
582
5eba8c5d 583void destroy_flush_cmd_control(struct f2fs_sb_info *sbi, bool free)
2163d198 584{
b01a9201 585 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
2163d198 586
5eba8c5d
JK		 587 if (fcc && fcc->f2fs_issue_flush) {
588 struct task_struct *flush_thread = fcc->f2fs_issue_flush;
589
590 fcc->f2fs_issue_flush = NULL;
591 kthread_stop(flush_thread);
592 }
593 if (free) {
594 kfree(fcc);
b01a9201 595 SM_I(sbi)->fcc_info = NULL;
5eba8c5d 596 }
2163d198
GZ		 597}
598
351df4b2
JK		 599static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
600 enum dirty_type dirty_type)
601{
602 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
603
604 /* need not be added */
605 if (IS_CURSEG(sbi, segno))
606 return;
607
608 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type]))
609 dirty_i->nr_dirty[dirty_type]++;
610
611 if (dirty_type == DIRTY) {
612 struct seg_entry *sentry = get_seg_entry(sbi, segno);
4625d6aa 613 enum dirty_type t = sentry->type;
b2f2c390 614
ec325b52
JK		 615 if (unlikely(t >= DIRTY)) {
616 f2fs_bug_on(sbi, 1);
617 return;
618 }
4625d6aa
CL		 619 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t]))
620 dirty_i->nr_dirty[t]++;
351df4b2
JK		 621 }
622}
623
624static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
625 enum dirty_type dirty_type)
626{
627 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
628
629 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type]))
630 dirty_i->nr_dirty[dirty_type]--;
631
632 if (dirty_type == DIRTY) {
4625d6aa
CL		 633 struct seg_entry *sentry = get_seg_entry(sbi, segno);
634 enum dirty_type t = sentry->type;
635
636 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t]))
637 dirty_i->nr_dirty[t]--;
b2f2c390 638
302bd348 639 if (get_valid_blocks(sbi, segno, true) == 0)
4ddb1a4d 640 clear_bit(GET_SEC_FROM_SEG(sbi, segno),
5ec4e49f 641 dirty_i->victim_secmap);
351df4b2
JK		 642 }
643}
644
0a8165d7 645/*
351df4b2
JK		 646 * Should not occur error such as -ENOMEM.
647 * Adding dirty entry into seglist is not critical operation.
648 * If a given segment is one of current working segments, it won't be added.
649 */
8d8451af 650static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK		 651{
652 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
653 unsigned short valid_blocks;
654
655 if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno))
656 return;
657
658 mutex_lock(&dirty_i->seglist_lock);
659
302bd348 660 valid_blocks = get_valid_blocks(sbi, segno, false);
351df4b2
JK		 661
662 if (valid_blocks == 0) {
663 __locate_dirty_segment(sbi, segno, PRE);
664 __remove_dirty_segment(sbi, segno, DIRTY);
665 } else if (valid_blocks < sbi->blocks_per_seg) {
666 __locate_dirty_segment(sbi, segno, DIRTY);
667 } else {
668 /* Recovery routine with SSR needs this */
669 __remove_dirty_segment(sbi, segno, DIRTY);
670 }
671
672 mutex_unlock(&dirty_i->seglist_lock);
351df4b2
JK		 673}
674
004b6862 675static struct discard_cmd *__create_discard_cmd(struct f2fs_sb_info *sbi,
c81abe34
JK		 676 struct block_device *bdev, block_t lstart,
677 block_t start, block_t len)
275b66b0 678{
0b54fb84 679 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
22d375dd 680 struct list_head *pend_list = &(dcc->discard_pend_list);
b01a9201 681 struct discard_cmd *dc;
275b66b0 682
b01a9201
JK		 683 dc = f2fs_kmem_cache_alloc(discard_cmd_slab, GFP_NOFS);
684 INIT_LIST_HEAD(&dc->list);
c81abe34 685 dc->bdev = bdev;
b01a9201 686 dc->lstart = lstart;
c81abe34 687 dc->start = start;
b01a9201 688 dc->len = len;
15469963 689 dc->state = D_PREP;
c81abe34 690 dc->error = 0;
b01a9201 691 init_completion(&dc->wait);
22d375dd 692 list_add_tail(&dc->list, pend_list);
5f32366a 693 atomic_inc(&dcc->discard_cmd_cnt);
004b6862
CY		 694
695 return dc;
696}
697
698static struct discard_cmd *__attach_discard_cmd(struct f2fs_sb_info *sbi,
699 struct block_device *bdev, block_t lstart,
700 block_t start, block_t len,
701 struct rb_node *parent, struct rb_node **p)
702{
703 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
704 struct discard_cmd *dc;
705
706 dc = __create_discard_cmd(sbi, bdev, lstart, start, len);
707
708 rb_link_node(&dc->rb_node, parent, p);
709 rb_insert_color(&dc->rb_node, &dcc->root);
710
711 return dc;
15469963
JK		 712}
713
004b6862
CY		 714static void __detach_discard_cmd(struct discard_cmd_control *dcc,
715 struct discard_cmd *dc)
15469963 716{
dcc9165d 717 if (dc->state == D_DONE)
004b6862
CY		 718 atomic_dec(&dcc->issing_discard);
719
720 list_del(&dc->list);
721 rb_erase(&dc->rb_node, &dcc->root);
722
723 kmem_cache_free(discard_cmd_slab, dc);
724
725 atomic_dec(&dcc->discard_cmd_cnt);
726}
727
728static void __remove_discard_cmd(struct f2fs_sb_info *sbi,
729 struct discard_cmd *dc)
730{
731 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
dcc9165d 732
c81abe34
JK		 733 if (dc->error == -EOPNOTSUPP)
734 dc->error = 0;
15469963 735
c81abe34 736 if (dc->error)
15469963 737 f2fs_msg(sbi->sb, KERN_INFO,
c81abe34 738 "Issue discard failed, ret: %d", dc->error);
004b6862 739 __detach_discard_cmd(dcc, dc);
275b66b0
CY		 740}
741
c81abe34
JK		 742static void f2fs_submit_discard_endio(struct bio *bio)
743{
744 struct discard_cmd *dc = (struct discard_cmd *)bio->bi_private;
745
c81abe34
JK		 746 dc->error = bio->bi_error;
747 dc->state = D_DONE;
fa64a003 748 complete(&dc->wait);
c81abe34
JK		 749 bio_put(bio);
750}
751
752/* this function is copied from blkdev_issue_discard from block/blk-lib.c */
753static void __submit_discard_cmd(struct f2fs_sb_info *sbi,
754 struct discard_cmd *dc)
755{
756 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
757 struct bio *bio = NULL;
758
759 if (dc->state != D_PREP)
760 return;
761
762 dc->error = __blkdev_issue_discard(dc->bdev,
763 SECTOR_FROM_BLOCK(dc->start),
764 SECTOR_FROM_BLOCK(dc->len),
765 GFP_NOFS, 0, &bio);
766 if (!dc->error) {
767 /* should keep before submission to avoid D_DONE right away */
768 dc->state = D_SUBMIT;
8b8dd65f
CY		 769 atomic_inc(&dcc->issued_discard);
770 atomic_inc(&dcc->issing_discard);
c81abe34
JK		 771 if (bio) {
772 bio->bi_private = dc;
773 bio->bi_end_io = f2fs_submit_discard_endio;
774 bio->bi_opf |= REQ_SYNC;
775 submit_bio(bio);
22d375dd 776 list_move_tail(&dc->list, &dcc->discard_wait_list);
c81abe34
JK		 777 }
778 } else {
779 __remove_discard_cmd(sbi, dc);
780 }
781}
782
004b6862
CY		 783static struct discard_cmd *__insert_discard_tree(struct f2fs_sb_info *sbi,
784 struct block_device *bdev, block_t lstart,
785 block_t start, block_t len,
786 struct rb_node **insert_p,
787 struct rb_node *insert_parent)
c81abe34 788{
004b6862
CY		 789 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
790 struct rb_node **p = &dcc->root.rb_node;
791 struct rb_node *parent = NULL;
792 struct discard_cmd *dc = NULL;
793
794 if (insert_p && insert_parent) {
795 parent = insert_parent;
796 p = insert_p;
797 goto do_insert;
798 }
c81abe34 799
004b6862
CY		 800 p = __lookup_rb_tree_for_insert(sbi, &dcc->root, &parent, lstart);
801do_insert:
802 dc = __attach_discard_cmd(sbi, bdev, lstart, start, len, parent, p);
803 if (!dc)
804 return NULL;
c81abe34 805
004b6862 806 return dc;
c81abe34
JK		 807}
808
3d6a650f
YH		 809static void __punch_discard_cmd(struct f2fs_sb_info *sbi,
810 struct discard_cmd *dc, block_t blkaddr)
811{
004b6862
CY		 812 struct discard_info di = dc->di;
813 bool modified = false;
3d6a650f 814
004b6862 815 if (dc->state == D_DONE || dc->len == 1) {
3d6a650f
YH		 816 __remove_discard_cmd(sbi, dc);
817 return;
818 }
819
004b6862 820 if (blkaddr > di.lstart) {
3d6a650f 821 dc->len = blkaddr - dc->lstart;
004b6862
CY		 822 modified = true;
823 }
824
825 if (blkaddr < di.lstart + di.len - 1) {
826 if (modified) {
827 __insert_discard_tree(sbi, dc->bdev, blkaddr + 1,
828 di.start + blkaddr + 1 - di.lstart,
829 di.lstart + di.len - 1 - blkaddr,
830 NULL, NULL);
831 } else {
832 dc->lstart++;
833 dc->len--;
834 dc->start++;
835 }
3d6a650f
YH		 836 }
837}
838
004b6862
CY		 839static void __update_discard_tree_range(struct f2fs_sb_info *sbi,
840 struct block_device *bdev, block_t lstart,
841 block_t start, block_t len)
275b66b0 842{
0b54fb84 843 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
004b6862
CY		 844 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
845 struct discard_cmd *dc;
846 struct discard_info di = {0};
847 struct rb_node **insert_p = NULL, *insert_parent = NULL;
848 block_t end = lstart + len;
275b66b0 849
15469963 850 mutex_lock(&dcc->cmd_lock);
40465257 851
004b6862
CY		 852 dc = (struct discard_cmd *)__lookup_rb_tree_ret(&dcc->root,
853 NULL, lstart,
854 (struct rb_entry **)&prev_dc,
855 (struct rb_entry **)&next_dc,
856 &insert_p, &insert_parent, true);
857 if (dc)
858 prev_dc = dc;
859
860 if (!prev_dc) {
861 di.lstart = lstart;
862 di.len = next_dc ? next_dc->lstart - lstart : len;
863 di.len = min(di.len, len);
864 di.start = start;
22d375dd 865 }
15469963 866
004b6862
CY		 867 while (1) {
868 struct rb_node *node;
869 bool merged = false;
870 struct discard_cmd *tdc = NULL;
871
872 if (prev_dc) {
873 di.lstart = prev_dc->lstart + prev_dc->len;
874 if (di.lstart < lstart)
875 di.lstart = lstart;
876 if (di.lstart >= end)
877 break;
878
879 if (!next_dc || next_dc->lstart > end)
880 di.len = end - di.lstart;
881 else
882 di.len = next_dc->lstart - di.lstart;
883 di.start = start + di.lstart - lstart;
884 }
885
886 if (!di.len)
887 goto next;
888
889 if (prev_dc && prev_dc->state == D_PREP &&
890 prev_dc->bdev == bdev &&
891 __is_discard_back_mergeable(&di, &prev_dc->di)) {
892 prev_dc->di.len += di.len;
893 di = prev_dc->di;
894 tdc = prev_dc;
895 merged = true;
896 }
897
898 if (next_dc && next_dc->state == D_PREP &&
899 next_dc->bdev == bdev &&
900 __is_discard_front_mergeable(&di, &next_dc->di)) {
901 next_dc->di.lstart = di.lstart;
902 next_dc->di.len += di.len;
903 next_dc->di.start = di.start;
904 if (tdc)
905 __remove_discard_cmd(sbi, tdc);
906
907 merged = true;
4e6a8d9b 908 }
004b6862
CY		 909
910 if (!merged)
911 __insert_discard_tree(sbi, bdev, di.lstart, di.start,
912 di.len, NULL, NULL);
913 next:
914 prev_dc = next_dc;
915 if (!prev_dc)
916 break;
917
918 node = rb_next(&prev_dc->rb_node);
919 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);
920 }
921
922 mutex_unlock(&dcc->cmd_lock);
923}
924
925static int __queue_discard_cmd(struct f2fs_sb_info *sbi,
926 struct block_device *bdev, block_t blkstart, block_t blklen)
927{
928 block_t lblkstart = blkstart;
929
930 trace_f2fs_issue_discard(bdev, blkstart, blklen);
931
932 if (sbi->s_ndevs) {
933 int devi = f2fs_target_device_index(sbi, blkstart);
934
935 blkstart -= FDEV(devi).start_blk;
936 }
937 __update_discard_tree_range(sbi, bdev, lblkstart, blkstart, blklen);
938 wake_up(&SM_I(sbi)->dcc_info->discard_wait_queue);
939 return 0;
940}
941
942/* This should be covered by global mutex, &sit_i->sentry_lock */
943void f2fs_wait_discard_bio(struct f2fs_sb_info *sbi, block_t blkaddr)
944{
945 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
946 struct discard_cmd *dc;
947
948 mutex_lock(&dcc->cmd_lock);
949
950 dc = (struct discard_cmd *)__lookup_rb_tree(&dcc->root, NULL, blkaddr);
951 if (dc) {
952 if (dc->state != D_PREP)
953 wait_for_completion_io(&dc->wait);
954 __punch_discard_cmd(sbi, dc, blkaddr);
275b66b0 955 }
40465257 956
d431413f
CY		 957 mutex_unlock(&dcc->cmd_lock);
958}
959
960/* This comes from f2fs_put_super */
961void f2fs_wait_discard_bios(struct f2fs_sb_info *sbi)
962{
963 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
964 struct list_head *pend_list = &(dcc->discard_pend_list);
965 struct list_head *wait_list = &(dcc->discard_wait_list);
966 struct discard_cmd *dc, *tmp;
967 struct blk_plug plug;
968
969 mutex_lock(&dcc->cmd_lock);
970
971 blk_start_plug(&plug);
972 list_for_each_entry_safe(dc, tmp, pend_list, list)
973 __submit_discard_cmd(sbi, dc);
974 blk_finish_plug(&plug);
975
976 list_for_each_entry_safe(dc, tmp, wait_list, list) {
977 wait_for_completion_io(&dc->wait);
978 __remove_discard_cmd(sbi, dc);
40465257 979 }
d431413f 980
15469963 981 mutex_unlock(&dcc->cmd_lock);
275b66b0
CY		 982}
983
15469963
JK		 984static int issue_discard_thread(void *data)
985{
986 struct f2fs_sb_info *sbi = data;
987 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
988 wait_queue_head_t *q = &dcc->discard_wait_queue;
22d375dd
CY		 989 struct list_head *pend_list = &dcc->discard_pend_list;
990 struct list_head *wait_list = &dcc->discard_wait_list;
15469963
JK		 991 struct discard_cmd *dc, *tmp;
992 struct blk_plug plug;
993 int iter = 0;
994repeat:
995 if (kthread_should_stop())
996 return 0;
997
15469963 998 mutex_lock(&dcc->cmd_lock);
a54455f5 999 blk_start_plug(&plug);
22d375dd
CY		 1000 list_for_each_entry_safe(dc, tmp, pend_list, list) {
1001 f2fs_bug_on(sbi, dc->state != D_PREP);
c81abe34
JK		 1002
1003 if (is_idle(sbi))
1004 __submit_discard_cmd(sbi, dc);
1005
22d375dd 1006 if (iter++ > DISCARD_ISSUE_RATE)
c81abe34 1007 break;
22d375dd 1008 }
a54455f5 1009 blk_finish_plug(&plug);
22d375dd
CY		 1010
1011 list_for_each_entry_safe(dc, tmp, wait_list, list) {
fa64a003
CY		 1012 if (dc->state == D_DONE) {
1013 wait_for_completion_io(&dc->wait);
15469963 1014 __remove_discard_cmd(sbi, dc);
fa64a003 1015 }
15469963
JK		 1016 }
1017 mutex_unlock(&dcc->cmd_lock);
1018
15469963
JK		 1019 iter = 0;
1020 congestion_wait(BLK_RW_SYNC, HZ/50);
1021
22d375dd
CY		 1022 wait_event_interruptible(*q, kthread_should_stop() ||
1023 !list_empty(pend_list) || !list_empty(wait_list));
15469963
JK		 1024 goto repeat;
1025}
1026
f46e8809 1027#ifdef CONFIG_BLK_DEV_ZONED
3c62be17
JK		 1028static int __f2fs_issue_discard_zone(struct f2fs_sb_info *sbi,
1029 struct block_device *bdev, block_t blkstart, block_t blklen)
f46e8809 1030{
92592285 1031 sector_t sector, nr_sects;
10a875f8 1032 block_t lblkstart = blkstart;
3c62be17
JK		 1033 int devi = 0;
1034
1035 if (sbi->s_ndevs) {
1036 devi = f2fs_target_device_index(sbi, blkstart);
1037 blkstart -= FDEV(devi).start_blk;
1038 }
f46e8809
DLM		 1039
1040 /*
1041 * We need to know the type of the zone: for conventional zones,
1042 * use regular discard if the drive supports it. For sequential
1043 * zones, reset the zone write pointer.
1044 */
3c62be17 1045 switch (get_blkz_type(sbi, bdev, blkstart)) {
f46e8809
DLM		 1046
1047 case BLK_ZONE_TYPE_CONVENTIONAL:
1048 if (!blk_queue_discard(bdev_get_queue(bdev)))
1049 return 0;
c81abe34 1050 return __queue_discard_cmd(sbi, bdev, lblkstart, blklen);
f46e8809
DLM		 1051 case BLK_ZONE_TYPE_SEQWRITE_REQ:
1052 case BLK_ZONE_TYPE_SEQWRITE_PREF:
92592285
JK		 1053 sector = SECTOR_FROM_BLOCK(blkstart);
1054 nr_sects = SECTOR_FROM_BLOCK(blklen);
1055
1056 if (sector & (bdev_zone_sectors(bdev) - 1) ||
1057 nr_sects != bdev_zone_sectors(bdev)) {
1058 f2fs_msg(sbi->sb, KERN_INFO,
1059 "(%d) %s: Unaligned discard attempted (block %x + %x)",
1060 devi, sbi->s_ndevs ? FDEV(devi).path: "",
1061 blkstart, blklen);
1062 return -EIO;
1063 }
d50aaeec 1064 trace_f2fs_issue_reset_zone(bdev, blkstart);
f46e8809
DLM		 1065 return blkdev_reset_zones(bdev, sector,
1066 nr_sects, GFP_NOFS);
1067 default:
1068 /* Unknown zone type: broken device ? */
1069 return -EIO;
1070 }
1071}
1072#endif
1073
3c62be17
JK		 1074static int __issue_discard_async(struct f2fs_sb_info *sbi,
1075 struct block_device *bdev, block_t blkstart, block_t blklen)
1076{
1077#ifdef CONFIG_BLK_DEV_ZONED
1078 if (f2fs_sb_mounted_blkzoned(sbi->sb) &&
1079 bdev_zoned_model(bdev) != BLK_ZONED_NONE)
1080 return __f2fs_issue_discard_zone(sbi, bdev, blkstart, blklen);
1081#endif
c81abe34 1082 return __queue_discard_cmd(sbi, bdev, blkstart, blklen);
3c62be17
JK		 1083}
1084
1e87a78d 1085static int f2fs_issue_discard(struct f2fs_sb_info *sbi,
37208879
JK		 1086 block_t blkstart, block_t blklen)
1087{
3c62be17
JK		 1088 sector_t start = blkstart, len = 0;
1089 struct block_device *bdev;
a66cdd98
JK		 1090 struct seg_entry *se;
1091 unsigned int offset;
1092 block_t i;
3c62be17
JK		 1093 int err = 0;
1094
1095 bdev = f2fs_target_device(sbi, blkstart, NULL);
1096
1097 for (i = blkstart; i < blkstart + blklen; i++, len++) {
1098 if (i != start) {
1099 struct block_device *bdev2 =
1100 f2fs_target_device(sbi, i, NULL);
1101
1102 if (bdev2 != bdev) {
1103 err = __issue_discard_async(sbi, bdev,
1104 start, len);
1105 if (err)
1106 return err;
1107 bdev = bdev2;
1108 start = i;
1109 len = 0;
1110 }
1111 }
a66cdd98 1112
a66cdd98
JK		 1113 se = get_seg_entry(sbi, GET_SEGNO(sbi, i));
1114 offset = GET_BLKOFF_FROM_SEG0(sbi, i);
1115
1116 if (!f2fs_test_and_set_bit(offset, se->discard_map))
1117 sbi->discard_blks--;
1118 }
f46e8809 1119
3c62be17
JK		 1120 if (len)
1121 err = __issue_discard_async(sbi, bdev, start, len);
1122 return err;
1e87a78d
JK		 1123}
1124
25290fa5
JK		 1125static bool add_discard_addrs(struct f2fs_sb_info *sbi, struct cp_control *cpc,
1126 bool check_only)
adf4983b 1127{
b2955550
JK		 1128 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
1129 int max_blocks = sbi->blocks_per_seg;
4b2fecc8 1130 struct seg_entry *se = get_seg_entry(sbi, cpc->trim_start);
b2955550
JK		 1131 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
1132 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
a66cdd98 1133 unsigned long *discard_map = (unsigned long *)se->discard_map;
60a3b782 1134 unsigned long *dmap = SIT_I(sbi)->tmp_map;
b2955550 1135 unsigned int start = 0, end = -1;
4b2fecc8 1136 bool force = (cpc->reason == CP_DISCARD);
a7eeb823
CY		 1137 struct discard_entry *de = NULL;
1138 struct list_head *head = &SM_I(sbi)->dcc_info->discard_entry_list;
b2955550
JK		 1139 int i;
1140
3e025740 1141 if (se->valid_blocks == max_blocks || !f2fs_discard_en(sbi))
25290fa5 1142 return false;
b2955550 1143
a66cdd98
JK		 1144 if (!force) {
1145 if (!test_opt(sbi, DISCARD) || !se->valid_blocks ||
0b54fb84
JK		 1146 SM_I(sbi)->dcc_info->nr_discards >=
1147 SM_I(sbi)->dcc_info->max_discards)
25290fa5 1148 return false;
4b2fecc8
JK		 1149 }
1150
b2955550
JK		 1151 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
1152 for (i = 0; i < entries; i++)
a66cdd98 1153 dmap[i] = force ? ~ckpt_map[i] & ~discard_map[i] :
d7bc2484 1154 (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i];
b2955550 1155
0b54fb84
JK		 1156 while (force || SM_I(sbi)->dcc_info->nr_discards <=
1157 SM_I(sbi)->dcc_info->max_discards) {
b2955550
JK		 1158 start = __find_rev_next_bit(dmap, max_blocks, end + 1);
1159 if (start >= max_blocks)
1160 break;
1161
1162 end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1);
c7b41e16
YH		 1163 if (force && start && end != max_blocks
1164 && (end - start) < cpc->trim_minlen)
1165 continue;
1166
25290fa5
JK		 1167 if (check_only)
1168 return true;
1169
a7eeb823
CY		 1170 if (!de) {
1171 de = f2fs_kmem_cache_alloc(discard_entry_slab,
1172 GFP_F2FS_ZERO);
1173 de->start_blkaddr = START_BLOCK(sbi, cpc->trim_start);
1174 list_add_tail(&de->list, head);
1175 }
1176
1177 for (i = start; i < end; i++)
1178 __set_bit_le(i, (void *)de->discard_map);
1179
1180 SM_I(sbi)->dcc_info->nr_discards += end - start;
b2955550 1181 }
25290fa5 1182 return false;
b2955550
JK		 1183}
1184
4b2fecc8
JK		 1185void release_discard_addrs(struct f2fs_sb_info *sbi)
1186{
0b54fb84 1187 struct list_head *head = &(SM_I(sbi)->dcc_info->discard_entry_list);
4b2fecc8
JK		 1188 struct discard_entry *entry, *this;
1189
1190 /* drop caches */
1191 list_for_each_entry_safe(entry, this, head, list) {
1192 list_del(&entry->list);
1193 kmem_cache_free(discard_entry_slab, entry);
1194 }
1195}
1196
0a8165d7 1197/*
351df4b2
JK		 1198 * Should call clear_prefree_segments after checkpoint is done.
1199 */
1200static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi)
1201{
1202 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
b65ee148 1203 unsigned int segno;
351df4b2
JK		 1204
1205 mutex_lock(&dirty_i->seglist_lock);
7cd8558b 1206 for_each_set_bit(segno, dirty_i->dirty_segmap[PRE], MAIN_SEGS(sbi))
351df4b2 1207 __set_test_and_free(sbi, segno);
351df4b2
JK		 1208 mutex_unlock(&dirty_i->seglist_lock);
1209}
1210
836b5a63 1211void clear_prefree_segments(struct f2fs_sb_info *sbi, struct cp_control *cpc)
351df4b2 1212{
0b54fb84 1213 struct list_head *head = &(SM_I(sbi)->dcc_info->discard_entry_list);
2d7b822a 1214 struct discard_entry *entry, *this;
351df4b2 1215 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
29e59c14 1216 unsigned long *prefree_map = dirty_i->dirty_segmap[PRE];
29e59c14 1217 unsigned int start = 0, end = -1;
36abef4e 1218 unsigned int secno, start_segno;
c24a0fd6 1219 bool force = (cpc->reason == CP_DISCARD);
351df4b2
JK		 1220
1221 mutex_lock(&dirty_i->seglist_lock);
29e59c14 1222
351df4b2 1223 while (1) {
29e59c14 1224 int i;
7cd8558b
JK		 1225 start = find_next_bit(prefree_map, MAIN_SEGS(sbi), end + 1);
1226 if (start >= MAIN_SEGS(sbi))
351df4b2 1227 break;
7cd8558b
JK		 1228 end = find_next_zero_bit(prefree_map, MAIN_SEGS(sbi),
1229 start + 1);
29e59c14
CL		 1230
1231 for (i = start; i < end; i++)
1232 clear_bit(i, prefree_map);
1233
1234 dirty_i->nr_dirty[PRE] -= end - start;
1235
650d3c4e 1236 if (!test_opt(sbi, DISCARD))
29e59c14 1237 continue;
351df4b2 1238
650d3c4e
YH		 1239 if (force && start >= cpc->trim_start &&
1240 (end - 1) <= cpc->trim_end)
1241 continue;
1242
36abef4e
JK		 1243 if (!test_opt(sbi, LFS) || sbi->segs_per_sec == 1) {
1244 f2fs_issue_discard(sbi, START_BLOCK(sbi, start),
37208879 1245 (end - start) << sbi->log_blocks_per_seg);
36abef4e
JK		 1246 continue;
1247 }
1248next:
4ddb1a4d
JK		 1249 secno = GET_SEC_FROM_SEG(sbi, start);
1250 start_segno = GET_SEG_FROM_SEC(sbi, secno);
36abef4e 1251 if (!IS_CURSEC(sbi, secno) &&
302bd348 1252 !get_valid_blocks(sbi, start, true))
36abef4e
JK		 1253 f2fs_issue_discard(sbi, START_BLOCK(sbi, start_segno),
1254 sbi->segs_per_sec << sbi->log_blocks_per_seg);
1255
1256 start = start_segno + sbi->segs_per_sec;
1257 if (start < end)
1258 goto next;
8b107f5b
JK		 1259 else
1260 end = start - 1;
351df4b2
JK		 1261 }
1262 mutex_unlock(&dirty_i->seglist_lock);
b2955550
JK		 1263
1264 /* send small discards */
2d7b822a 1265 list_for_each_entry_safe(entry, this, head, list) {
a7eeb823
CY		 1266 unsigned int cur_pos = 0, next_pos, len, total_len = 0;
1267 bool is_valid = test_bit_le(0, entry->discard_map);
1268
1269find_next:
1270 if (is_valid) {
1271 next_pos = find_next_zero_bit_le(entry->discard_map,
1272 sbi->blocks_per_seg, cur_pos);
1273 len = next_pos - cur_pos;
1274
1275 if (force && len < cpc->trim_minlen)
1276 goto skip;
1277
1278 f2fs_issue_discard(sbi, entry->start_blkaddr + cur_pos,
1279 len);
1280 cpc->trimmed += len;
1281 total_len += len;
1282 } else {
1283 next_pos = find_next_bit_le(entry->discard_map,
1284 sbi->blocks_per_seg, cur_pos);
1285 }
836b5a63 1286skip:
a7eeb823
CY		 1287 cur_pos = next_pos;
1288 is_valid = !is_valid;
1289
1290 if (cur_pos < sbi->blocks_per_seg)
1291 goto find_next;
1292
b2955550 1293 list_del(&entry->list);
a7eeb823 1294 SM_I(sbi)->dcc_info->nr_discards -= total_len;
b2955550
JK		 1295 kmem_cache_free(discard_entry_slab, entry);
1296 }
351df4b2
JK		 1297}
1298
8ed59745 1299static int create_discard_cmd_control(struct f2fs_sb_info *sbi)
0b54fb84 1300{
15469963 1301 dev_t dev = sbi->sb->s_bdev->bd_dev;
0b54fb84
JK		 1302 struct discard_cmd_control *dcc;
1303 int err = 0;
1304
1305 if (SM_I(sbi)->dcc_info) {
1306 dcc = SM_I(sbi)->dcc_info;
1307 goto init_thread;
1308 }
1309
1310 dcc = kzalloc(sizeof(struct discard_cmd_control), GFP_KERNEL);
1311 if (!dcc)
1312 return -ENOMEM;
1313
1314 INIT_LIST_HEAD(&dcc->discard_entry_list);
22d375dd
CY		 1315 INIT_LIST_HEAD(&dcc->discard_pend_list);
1316 INIT_LIST_HEAD(&dcc->discard_wait_list);
15469963 1317 mutex_init(&dcc->cmd_lock);
8b8dd65f
CY		 1318 atomic_set(&dcc->issued_discard, 0);
1319 atomic_set(&dcc->issing_discard, 0);
5f32366a 1320 atomic_set(&dcc->discard_cmd_cnt, 0);
0b54fb84
JK		 1321 dcc->nr_discards = 0;
1322 dcc->max_discards = 0;
004b6862 1323 dcc->root = RB_ROOT;
0b54fb84 1324
15469963 1325 init_waitqueue_head(&dcc->discard_wait_queue);
0b54fb84
JK		 1326 SM_I(sbi)->dcc_info = dcc;
1327init_thread:
15469963
JK		 1328 dcc->f2fs_issue_discard = kthread_run(issue_discard_thread, sbi,
1329 "f2fs_discard-%u:%u", MAJOR(dev), MINOR(dev));
1330 if (IS_ERR(dcc->f2fs_issue_discard)) {
1331 err = PTR_ERR(dcc->f2fs_issue_discard);
1332 kfree(dcc);
1333 SM_I(sbi)->dcc_info = NULL;
1334 return err;
1335 }
1336
0b54fb84
JK		 1337 return err;
1338}
1339
f099405f 1340static void destroy_discard_cmd_control(struct f2fs_sb_info *sbi)
0b54fb84
JK		 1341{
1342 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1343
f099405f
CY		 1344 if (!dcc)
1345 return;
1346
1347 if (dcc->f2fs_issue_discard) {
15469963
JK		 1348 struct task_struct *discard_thread = dcc->f2fs_issue_discard;
1349
1350 dcc->f2fs_issue_discard = NULL;
1351 kthread_stop(discard_thread);
1352 }
f099405f
CY		 1353
1354 kfree(dcc);
1355 SM_I(sbi)->dcc_info = NULL;
0b54fb84
JK		 1356}
1357
184a5cd2 1358static bool __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK		 1359{
1360 struct sit_info *sit_i = SIT_I(sbi);
184a5cd2
CY		 1361
1362 if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap)) {
351df4b2 1363 sit_i->dirty_sentries++;
184a5cd2
CY		 1364 return false;
1365 }
1366
1367 return true;
351df4b2
JK		 1368}
1369
1370static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type,
1371 unsigned int segno, int modified)
1372{
1373 struct seg_entry *se = get_seg_entry(sbi, segno);
1374 se->type = type;
1375 if (modified)
1376 __mark_sit_entry_dirty(sbi, segno);
1377}
1378
1379static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del)
1380{
1381 struct seg_entry *se;
1382 unsigned int segno, offset;
1383 long int new_vblocks;
1384
1385 segno = GET_SEGNO(sbi, blkaddr);
1386
1387 se = get_seg_entry(sbi, segno);
1388 new_vblocks = se->valid_blocks + del;
491c0854 1389 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
351df4b2 1390
9850cf4a 1391 f2fs_bug_on(sbi, (new_vblocks >> (sizeof(unsigned short) << 3) ||
351df4b2
JK		 1392 (new_vblocks > sbi->blocks_per_seg)));
1393
1394 se->valid_blocks = new_vblocks;
1395 se->mtime = get_mtime(sbi);
1396 SIT_I(sbi)->max_mtime = se->mtime;
1397
1398 /* Update valid block bitmap */
1399 if (del > 0) {
355e7891
CY		 1400 if (f2fs_test_and_set_bit(offset, se->cur_valid_map)) {
1401#ifdef CONFIG_F2FS_CHECK_FS
1402 if (f2fs_test_and_set_bit(offset,
1403 se->cur_valid_map_mir))
1404 f2fs_bug_on(sbi, 1);
1405 else
1406 WARN_ON(1);
1407#else
05796763 1408 f2fs_bug_on(sbi, 1);
355e7891
CY		 1409#endif
1410 }
3e025740
JK		 1411 if (f2fs_discard_en(sbi) &&
1412 !f2fs_test_and_set_bit(offset, se->discard_map))
a66cdd98 1413 sbi->discard_blks--;
720037f9
JK		 1414
1415 /* don't overwrite by SSR to keep node chain */
1416 if (se->type == CURSEG_WARM_NODE) {
1417 if (!f2fs_test_and_set_bit(offset, se->ckpt_valid_map))
1418 se->ckpt_valid_blocks++;
1419 }
351df4b2 1420 } else {
355e7891
CY		 1421 if (!f2fs_test_and_clear_bit(offset, se->cur_valid_map)) {
1422#ifdef CONFIG_F2FS_CHECK_FS
1423 if (!f2fs_test_and_clear_bit(offset,
1424 se->cur_valid_map_mir))
1425 f2fs_bug_on(sbi, 1);
1426 else
1427 WARN_ON(1);
1428#else
05796763 1429 f2fs_bug_on(sbi, 1);
355e7891
CY		 1430#endif
1431 }
3e025740
JK		 1432 if (f2fs_discard_en(sbi) &&
1433 f2fs_test_and_clear_bit(offset, se->discard_map))
a66cdd98 1434 sbi->discard_blks++;
351df4b2
JK		 1435 }
1436 if (!f2fs_test_bit(offset, se->ckpt_valid_map))
1437 se->ckpt_valid_blocks += del;
1438
1439 __mark_sit_entry_dirty(sbi, segno);
1440
1441 /* update total number of valid blocks to be written in ckpt area */
1442 SIT_I(sbi)->written_valid_blocks += del;
1443
1444 if (sbi->segs_per_sec > 1)
1445 get_sec_entry(sbi, segno)->valid_blocks += del;
1446}
1447
5e443818 1448void refresh_sit_entry(struct f2fs_sb_info *sbi, block_t old, block_t new)
351df4b2 1449{
5e443818
JK		 1450 update_sit_entry(sbi, new, 1);
1451 if (GET_SEGNO(sbi, old) != NULL_SEGNO)
1452 update_sit_entry(sbi, old, -1);
1453
1454 locate_dirty_segment(sbi, GET_SEGNO(sbi, old));
1455 locate_dirty_segment(sbi, GET_SEGNO(sbi, new));
351df4b2
JK		 1456}
1457
1458void invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr)
1459{
1460 unsigned int segno = GET_SEGNO(sbi, addr);
1461 struct sit_info *sit_i = SIT_I(sbi);
1462
9850cf4a 1463 f2fs_bug_on(sbi, addr == NULL_ADDR);
351df4b2
JK		 1464 if (addr == NEW_ADDR)
1465 return;
1466
1467 /* add it into sit main buffer */
1468 mutex_lock(&sit_i->sentry_lock);
1469
1470 update_sit_entry(sbi, addr, -1);
1471
1472 /* add it into dirty seglist */
1473 locate_dirty_segment(sbi, segno);
1474
1475 mutex_unlock(&sit_i->sentry_lock);
1476}
1477
6e2c64ad
JK		 1478bool is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr)
1479{
1480 struct sit_info *sit_i = SIT_I(sbi);
1481 unsigned int segno, offset;
1482 struct seg_entry *se;
1483 bool is_cp = false;
1484
1485 if (blkaddr == NEW_ADDR || blkaddr == NULL_ADDR)
1486 return true;
1487
1488 mutex_lock(&sit_i->sentry_lock);
1489
1490 segno = GET_SEGNO(sbi, blkaddr);
1491 se = get_seg_entry(sbi, segno);
1492 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
1493
1494 if (f2fs_test_bit(offset, se->ckpt_valid_map))
1495 is_cp = true;
1496
1497 mutex_unlock(&sit_i->sentry_lock);
1498
1499 return is_cp;
1500}
1501
0a8165d7 1502/*
351df4b2
JK		 1503 * This function should be resided under the curseg_mutex lock
1504 */
1505static void __add_sum_entry(struct f2fs_sb_info *sbi, int type,
e79efe3b 1506 struct f2fs_summary *sum)
351df4b2
JK		 1507{
1508 struct curseg_info *curseg = CURSEG_I(sbi, type);
1509 void *addr = curseg->sum_blk;
e79efe3b 1510 addr += curseg->next_blkoff * sizeof(struct f2fs_summary);
351df4b2 1511 memcpy(addr, sum, sizeof(struct f2fs_summary));
351df4b2
JK		 1512}
1513
0a8165d7 1514/*
351df4b2
JK		 1515 * Calculate the number of current summary pages for writing
1516 */
3fa06d7b 1517int npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra)
351df4b2 1518{
351df4b2 1519 int valid_sum_count = 0;
9a47938b 1520 int i, sum_in_page;
351df4b2
JK		 1521
1522 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1523 if (sbi->ckpt->alloc_type[i] == SSR)
1524 valid_sum_count += sbi->blocks_per_seg;
3fa06d7b
CY		 1525 else {
1526 if (for_ra)
1527 valid_sum_count += le16_to_cpu(
1528 F2FS_CKPT(sbi)->cur_data_blkoff[i]);
1529 else
1530 valid_sum_count += curseg_blkoff(sbi, i);
1531 }
351df4b2
JK		 1532 }
1533
09cbfeaf 1534 sum_in_page = (PAGE_SIZE - 2 * SUM_JOURNAL_SIZE -
9a47938b
FL		 1535 SUM_FOOTER_SIZE) / SUMMARY_SIZE;
1536 if (valid_sum_count <= sum_in_page)
351df4b2 1537 return 1;
9a47938b 1538 else if ((valid_sum_count - sum_in_page) <=
09cbfeaf 1539 (PAGE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE)
351df4b2
JK		 1540 return 2;
1541 return 3;
1542}
1543
0a8165d7 1544/*
351df4b2
JK		 1545 * Caller should put this summary page
1546 */
1547struct page *get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno)
1548{
1549 return get_meta_page(sbi, GET_SUM_BLOCK(sbi, segno));
1550}
1551
381722d2 1552void update_meta_page(struct f2fs_sb_info *sbi, void *src, block_t blk_addr)
351df4b2
JK		 1553{
1554 struct page *page = grab_meta_page(sbi, blk_addr);
381722d2
CY		 1555 void *dst = page_address(page);
1556
1557 if (src)
09cbfeaf 1558 memcpy(dst, src, PAGE_SIZE);
381722d2 1559 else
09cbfeaf 1560 memset(dst, 0, PAGE_SIZE);
351df4b2
JK		 1561 set_page_dirty(page);
1562 f2fs_put_page(page, 1);
1563}
1564
381722d2
CY		 1565static void write_sum_page(struct f2fs_sb_info *sbi,
1566 struct f2fs_summary_block *sum_blk, block_t blk_addr)
1567{
1568 update_meta_page(sbi, (void *)sum_blk, blk_addr);
1569}
1570
b7ad7512
CY		 1571static void write_current_sum_page(struct f2fs_sb_info *sbi,
1572 int type, block_t blk_addr)
1573{
1574 struct curseg_info *curseg = CURSEG_I(sbi, type);
1575 struct page *page = grab_meta_page(sbi, blk_addr);
1576 struct f2fs_summary_block *src = curseg->sum_blk;
1577 struct f2fs_summary_block *dst;
1578
1579 dst = (struct f2fs_summary_block *)page_address(page);
1580
1581 mutex_lock(&curseg->curseg_mutex);
1582
1583 down_read(&curseg->journal_rwsem);
1584 memcpy(&dst->journal, curseg->journal, SUM_JOURNAL_SIZE);
1585 up_read(&curseg->journal_rwsem);
1586
1587 memcpy(dst->entries, src->entries, SUM_ENTRY_SIZE);
1588 memcpy(&dst->footer, &src->footer, SUM_FOOTER_SIZE);
1589
1590 mutex_unlock(&curseg->curseg_mutex);
1591
1592 set_page_dirty(page);
1593 f2fs_put_page(page, 1);
1594}
1595
0a8165d7 1596/*
351df4b2
JK		 1597 * Find a new segment from the free segments bitmap to right order
1598 * This function should be returned with success, otherwise BUG
1599 */
1600static void get_new_segment(struct f2fs_sb_info *sbi,
1601 unsigned int *newseg, bool new_sec, int dir)
1602{
1603 struct free_segmap_info *free_i = FREE_I(sbi);
351df4b2 1604 unsigned int segno, secno, zoneno;
7cd8558b 1605 unsigned int total_zones = MAIN_SECS(sbi) / sbi->secs_per_zone;
4ddb1a4d
JK		 1606 unsigned int hint = GET_SEC_FROM_SEG(sbi, *newseg);
1607 unsigned int old_zoneno = GET_ZONE_FROM_SEG(sbi, *newseg);
351df4b2
JK		 1608 unsigned int left_start = hint;
1609 bool init = true;
1610 int go_left = 0;
1611 int i;
1612
1a118ccf 1613 spin_lock(&free_i->segmap_lock);
351df4b2
JK		 1614
1615 if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) {
1616 segno = find_next_zero_bit(free_i->free_segmap,
4ddb1a4d
JK		 1617 GET_SEG_FROM_SEC(sbi, hint + 1), *newseg + 1);
1618 if (segno < GET_SEG_FROM_SEC(sbi, hint + 1))
351df4b2
JK		 1619 goto got_it;
1620 }
1621find_other_zone:
7cd8558b
JK		 1622 secno = find_next_zero_bit(free_i->free_secmap, MAIN_SECS(sbi), hint);
1623 if (secno >= MAIN_SECS(sbi)) {
351df4b2
JK		 1624 if (dir == ALLOC_RIGHT) {
1625 secno = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK		 1626 MAIN_SECS(sbi), 0);
1627 f2fs_bug_on(sbi, secno >= MAIN_SECS(sbi));
351df4b2
JK		 1628 } else {
1629 go_left = 1;
1630 left_start = hint - 1;
1631 }
1632 }
1633 if (go_left == 0)
1634 goto skip_left;
1635
1636 while (test_bit(left_start, free_i->free_secmap)) {
1637 if (left_start > 0) {
1638 left_start--;
1639 continue;
1640 }
1641 left_start = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK		 1642 MAIN_SECS(sbi), 0);
1643 f2fs_bug_on(sbi, left_start >= MAIN_SECS(sbi));
351df4b2
JK		 1644 break;
1645 }
1646 secno = left_start;
1647skip_left:
1648 hint = secno;
4ddb1a4d
JK		 1649 segno = GET_SEG_FROM_SEC(sbi, secno);
1650 zoneno = GET_ZONE_FROM_SEC(sbi, secno);
351df4b2
JK		 1651
1652 /* give up on finding another zone */
1653 if (!init)
1654 goto got_it;
1655 if (sbi->secs_per_zone == 1)
1656 goto got_it;
1657 if (zoneno == old_zoneno)
1658 goto got_it;
1659 if (dir == ALLOC_LEFT) {
1660 if (!go_left && zoneno + 1 >= total_zones)
1661 goto got_it;
1662 if (go_left && zoneno == 0)
1663 goto got_it;
1664 }
1665 for (i = 0; i < NR_CURSEG_TYPE; i++)
1666 if (CURSEG_I(sbi, i)->zone == zoneno)
1667 break;
1668
1669 if (i < NR_CURSEG_TYPE) {
1670 /* zone is in user, try another */
1671 if (go_left)
1672 hint = zoneno * sbi->secs_per_zone - 1;
1673 else if (zoneno + 1 >= total_zones)
1674 hint = 0;
1675 else
1676 hint = (zoneno + 1) * sbi->secs_per_zone;
1677 init = false;
1678 goto find_other_zone;
1679 }
1680got_it:
1681 /* set it as dirty segment in free segmap */
9850cf4a 1682 f2fs_bug_on(sbi, test_bit(segno, free_i->free_segmap));
351df4b2
JK		 1683 __set_inuse(sbi, segno);
1684 *newseg = segno;
1a118ccf 1685 spin_unlock(&free_i->segmap_lock);
351df4b2
JK		 1686}
1687
1688static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified)
1689{
1690 struct curseg_info *curseg = CURSEG_I(sbi, type);
1691 struct summary_footer *sum_footer;
1692
1693 curseg->segno = curseg->next_segno;
4ddb1a4d 1694 curseg->zone = GET_ZONE_FROM_SEG(sbi, curseg->segno);
351df4b2
JK		 1695 curseg->next_blkoff = 0;
1696 curseg->next_segno = NULL_SEGNO;
1697
1698 sum_footer = &(curseg->sum_blk->footer);
1699 memset(sum_footer, 0, sizeof(struct summary_footer));
1700 if (IS_DATASEG(type))
1701 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA);
1702 if (IS_NODESEG(type))
1703 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE);
1704 __set_sit_entry_type(sbi, type, curseg->segno, modified);
1705}
1706
7a20b8a6
JK		 1707static unsigned int __get_next_segno(struct f2fs_sb_info *sbi, int type)
1708{
1709 if (type == CURSEG_HOT_DATA || IS_NODESEG(type))
1710 return 0;
1711
1712 return CURSEG_I(sbi, type)->segno;
1713}
1714
0a8165d7 1715/*
351df4b2
JK		 1716 * Allocate a current working segment.
1717 * This function always allocates a free segment in LFS manner.
1718 */
1719static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec)
1720{
1721 struct curseg_info *curseg = CURSEG_I(sbi, type);
1722 unsigned int segno = curseg->segno;
1723 int dir = ALLOC_LEFT;
1724
1725 write_sum_page(sbi, curseg->sum_blk,
81fb5e87 1726 GET_SUM_BLOCK(sbi, segno));
351df4b2
JK		 1727 if (type == CURSEG_WARM_DATA || type == CURSEG_COLD_DATA)
1728 dir = ALLOC_RIGHT;
1729
1730 if (test_opt(sbi, NOHEAP))
1731 dir = ALLOC_RIGHT;
1732
7a20b8a6 1733 segno = __get_next_segno(sbi, type);
351df4b2
JK		 1734 get_new_segment(sbi, &segno, new_sec, dir);
1735 curseg->next_segno = segno;
1736 reset_curseg(sbi, type, 1);
1737 curseg->alloc_type = LFS;
1738}
1739
1740static void __next_free_blkoff(struct f2fs_sb_info *sbi,
1741 struct curseg_info *seg, block_t start)
1742{
1743 struct seg_entry *se = get_seg_entry(sbi, seg->segno);
e81c93cf 1744 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
60a3b782 1745 unsigned long *target_map = SIT_I(sbi)->tmp_map;
e81c93cf
CL		 1746 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
1747 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
1748 int i, pos;
1749
1750 for (i = 0; i < entries; i++)
1751 target_map[i] = ckpt_map[i] | cur_map[i];
1752
1753 pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start);
1754
1755 seg->next_blkoff = pos;
351df4b2
JK		 1756}
1757
0a8165d7 1758/*
351df4b2
JK		 1759 * If a segment is written by LFS manner, next block offset is just obtained
1760 * by increasing the current block offset. However, if a segment is written by
1761 * SSR manner, next block offset obtained by calling __next_free_blkoff
1762 */
1763static void __refresh_next_blkoff(struct f2fs_sb_info *sbi,
1764 struct curseg_info *seg)
1765{
1766 if (seg->alloc_type == SSR)
1767 __next_free_blkoff(sbi, seg, seg->next_blkoff + 1);
1768 else
1769 seg->next_blkoff++;
1770}
1771
0a8165d7 1772/*
e1c42045 1773 * This function always allocates a used segment(from dirty seglist) by SSR
351df4b2
JK		 1774 * manner, so it should recover the existing segment information of valid blocks
1775 */
1776static void change_curseg(struct f2fs_sb_info *sbi, int type, bool reuse)
1777{
1778 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1779 struct curseg_info *curseg = CURSEG_I(sbi, type);
1780 unsigned int new_segno = curseg->next_segno;
1781 struct f2fs_summary_block *sum_node;
1782 struct page *sum_page;
1783
1784 write_sum_page(sbi, curseg->sum_blk,
1785 GET_SUM_BLOCK(sbi, curseg->segno));
1786 __set_test_and_inuse(sbi, new_segno);
1787
1788 mutex_lock(&dirty_i->seglist_lock);
1789 __remove_dirty_segment(sbi, new_segno, PRE);
1790 __remove_dirty_segment(sbi, new_segno, DIRTY);
1791 mutex_unlock(&dirty_i->seglist_lock);
1792
1793 reset_curseg(sbi, type, 1);
1794 curseg->alloc_type = SSR;
1795 __next_free_blkoff(sbi, curseg, 0);
1796
1797 if (reuse) {
1798 sum_page = get_sum_page(sbi, new_segno);
1799 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
1800 memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE);
1801 f2fs_put_page(sum_page, 1);
1802 }
1803}
1804
43727527
JK		 1805static int get_ssr_segment(struct f2fs_sb_info *sbi, int type)
1806{
1807 struct curseg_info *curseg = CURSEG_I(sbi, type);
1808 const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops;
d27c3d89
CY		 1809 int i, cnt;
1810 bool reversed = false;
c192f7a4
JK		 1811
1812 /* need_SSR() already forces to do this */
1813 if (v_ops->get_victim(sbi, &(curseg)->next_segno, BG_GC, type, SSR))
1814 return 1;
43727527 1815
70d625cb
JK		 1816 /* For node segments, let's do SSR more intensively */
1817 if (IS_NODESEG(type)) {
d27c3d89
CY		 1818 if (type >= CURSEG_WARM_NODE) {
1819 reversed = true;
1820 i = CURSEG_COLD_NODE;
1821 } else {
1822 i = CURSEG_HOT_NODE;
1823 }
1824 cnt = NR_CURSEG_NODE_TYPE;
70d625cb 1825 } else {
d27c3d89
CY		 1826 if (type >= CURSEG_WARM_DATA) {
1827 reversed = true;
1828 i = CURSEG_COLD_DATA;
1829 } else {
1830 i = CURSEG_HOT_DATA;
1831 }
1832 cnt = NR_CURSEG_DATA_TYPE;
70d625cb 1833 }
43727527 1834
d27c3d89 1835 for (; cnt-- > 0; reversed ? i-- : i++) {
c192f7a4
JK		 1836 if (i == type)
1837 continue;
43727527 1838 if (v_ops->get_victim(sbi, &(curseg)->next_segno,
c192f7a4 1839 BG_GC, i, SSR))
43727527 1840 return 1;
c192f7a4 1841 }
43727527
JK		 1842 return 0;
1843}
1844
351df4b2
JK		 1845/*
1846 * flush out current segment and replace it with new segment
1847 * This function should be returned with success, otherwise BUG
1848 */
1849static void allocate_segment_by_default(struct f2fs_sb_info *sbi,
1850 int type, bool force)
1851{
7b405275 1852 if (force)
351df4b2 1853 new_curseg(sbi, type, true);
5b6c6be2
JK		 1854 else if (!is_set_ckpt_flags(sbi, CP_CRC_RECOVERY_FLAG) &&
1855 type == CURSEG_WARM_NODE)
351df4b2
JK		 1856 new_curseg(sbi, type, false);
1857 else if (need_SSR(sbi) && get_ssr_segment(sbi, type))
1858 change_curseg(sbi, type, true);
1859 else
1860 new_curseg(sbi, type, false);
dcdfff65 1861
d0db7703 1862 stat_inc_seg_type(sbi, CURSEG_I(sbi, type));
351df4b2
JK		 1863}
1864
1865void allocate_new_segments(struct f2fs_sb_info *sbi)
1866{
6ae1be13
JK		 1867 struct curseg_info *curseg;
1868 unsigned int old_segno;
351df4b2
JK		 1869 int i;
1870
6ae1be13
JK		 1871 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1872 curseg = CURSEG_I(sbi, i);
1873 old_segno = curseg->segno;
1874 SIT_I(sbi)->s_ops->allocate_segment(sbi, i, true);
1875 locate_dirty_segment(sbi, old_segno);
1876 }
351df4b2
JK		 1877}
1878
1879static const struct segment_allocation default_salloc_ops = {
1880 .allocate_segment = allocate_segment_by_default,
1881};
1882
25290fa5
JK		 1883bool exist_trim_candidates(struct f2fs_sb_info *sbi, struct cp_control *cpc)
1884{
1885 __u64 trim_start = cpc->trim_start;
1886 bool has_candidate = false;
1887
1888 mutex_lock(&SIT_I(sbi)->sentry_lock);
1889 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++) {
1890 if (add_discard_addrs(sbi, cpc, true)) {
1891 has_candidate = true;
1892 break;
1893 }
1894 }
1895 mutex_unlock(&SIT_I(sbi)->sentry_lock);
1896
1897 cpc->trim_start = trim_start;
1898 return has_candidate;
1899}
1900
4b2fecc8
JK		 1901int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range)
1902{
f7ef9b83
JK		 1903 __u64 start = F2FS_BYTES_TO_BLK(range->start);
1904 __u64 end = start + F2FS_BYTES_TO_BLK(range->len) - 1;
4b2fecc8
JK		 1905 unsigned int start_segno, end_segno;
1906 struct cp_control cpc;
c34f42e2 1907 int err = 0;
4b2fecc8 1908
836b5a63 1909 if (start >= MAX_BLKADDR(sbi) || range->len < sbi->blocksize)
4b2fecc8
JK		 1910 return -EINVAL;
1911
9bd27ae4 1912 cpc.trimmed = 0;
7cd8558b 1913 if (end <= MAIN_BLKADDR(sbi))
4b2fecc8
JK		 1914 goto out;
1915
ed214a11
YH		 1916 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
1917 f2fs_msg(sbi->sb, KERN_WARNING,
1918 "Found FS corruption, run fsck to fix.");
1919 goto out;
1920 }
1921
4b2fecc8 1922 /* start/end segment number in main_area */
7cd8558b
JK		 1923 start_segno = (start <= MAIN_BLKADDR(sbi)) ? 0 : GET_SEGNO(sbi, start);
1924 end_segno = (end >= MAX_BLKADDR(sbi)) ? MAIN_SEGS(sbi) - 1 :
1925 GET_SEGNO(sbi, end);
4b2fecc8 1926 cpc.reason = CP_DISCARD;
836b5a63 1927 cpc.trim_minlen = max_t(__u64, 1, F2FS_BYTES_TO_BLK(range->minlen));
4b2fecc8
JK		 1928
1929 /* do checkpoint to issue discard commands safely */
bba681cb
JK		 1930 for (; start_segno <= end_segno; start_segno = cpc.trim_end + 1) {
1931 cpc.trim_start = start_segno;
a66cdd98
JK		 1932
1933 if (sbi->discard_blks == 0)
1934 break;
1935 else if (sbi->discard_blks < BATCHED_TRIM_BLOCKS(sbi))
1936 cpc.trim_end = end_segno;
1937 else
1938 cpc.trim_end = min_t(unsigned int,
1939 rounddown(start_segno +
bba681cb
JK		 1940 BATCHED_TRIM_SEGMENTS(sbi),
1941 sbi->segs_per_sec) - 1, end_segno);
1942
1943 mutex_lock(&sbi->gc_mutex);
c34f42e2 1944 err = write_checkpoint(sbi, &cpc);
bba681cb 1945 mutex_unlock(&sbi->gc_mutex);
e9328353
CY		 1946 if (err)
1947 break;
74fa5f3d
CY		 1948
1949 schedule();
bba681cb 1950 }
4b2fecc8 1951out:
f7ef9b83 1952 range->len = F2FS_BLK_TO_BYTES(cpc.trimmed);
c34f42e2 1953 return err;
4b2fecc8
JK		 1954}
1955
351df4b2
JK		 1956static bool __has_curseg_space(struct f2fs_sb_info *sbi, int type)
1957{
1958 struct curseg_info *curseg = CURSEG_I(sbi, type);
1959 if (curseg->next_blkoff < sbi->blocks_per_seg)
1960 return true;
1961 return false;
1962}
1963
1964static int __get_segment_type_2(struct page *page, enum page_type p_type)
1965{
1966 if (p_type == DATA)
1967 return CURSEG_HOT_DATA;
1968 else
1969 return CURSEG_HOT_NODE;
1970}
1971
1972static int __get_segment_type_4(struct page *page, enum page_type p_type)
1973{
1974 if (p_type == DATA) {
1975 struct inode *inode = page->mapping->host;
1976
1977 if (S_ISDIR(inode->i_mode))
1978 return CURSEG_HOT_DATA;
1979 else
1980 return CURSEG_COLD_DATA;
1981 } else {
a344b9fd
JK		 1982 if (IS_DNODE(page) && is_cold_node(page))
1983 return CURSEG_WARM_NODE;
351df4b2
JK		 1984 else
1985 return CURSEG_COLD_NODE;
1986 }
1987}
1988
1989static int __get_segment_type_6(struct page *page, enum page_type p_type)
1990{
1991 if (p_type == DATA) {
1992 struct inode *inode = page->mapping->host;
1993
ef095d19 1994 if (is_cold_data(page) || file_is_cold(inode))
351df4b2 1995 return CURSEG_COLD_DATA;
ef095d19
JK		 1996 if (is_inode_flag_set(inode, FI_HOT_DATA))
1997 return CURSEG_HOT_DATA;
1998 return CURSEG_WARM_DATA;
351df4b2
JK		 1999 } else {
2000 if (IS_DNODE(page))
2001 return is_cold_node(page) ? CURSEG_WARM_NODE :
2002 CURSEG_HOT_NODE;
ef095d19 2003 return CURSEG_COLD_NODE;
351df4b2
JK		 2004 }
2005}
2006
2007static int __get_segment_type(struct page *page, enum page_type p_type)
2008{
4081363f 2009 switch (F2FS_P_SB(page)->active_logs) {
351df4b2
JK		 2010 case 2:
2011 return __get_segment_type_2(page, p_type);
2012 case 4:
2013 return __get_segment_type_4(page, p_type);
351df4b2 2014 }
12a67146 2015 /* NR_CURSEG_TYPE(6) logs by default */
9850cf4a
JK		 2016 f2fs_bug_on(F2FS_P_SB(page),
2017 F2FS_P_SB(page)->active_logs != NR_CURSEG_TYPE);
12a67146 2018 return __get_segment_type_6(page, p_type);
351df4b2
JK		 2019}
2020
bfad7c2d
JK		 2021void allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
2022 block_t old_blkaddr, block_t *new_blkaddr,
2023 struct f2fs_summary *sum, int type)
351df4b2
JK		 2024{
2025 struct sit_info *sit_i = SIT_I(sbi);
6ae1be13 2026 struct curseg_info *curseg = CURSEG_I(sbi, type);
351df4b2
JK		 2027
2028 mutex_lock(&curseg->curseg_mutex);
21cb1d99 2029 mutex_lock(&sit_i->sentry_lock);
351df4b2
JK		 2030
2031 *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
351df4b2 2032
4e6a8d9b
JK		 2033 f2fs_wait_discard_bio(sbi, *new_blkaddr);
2034
351df4b2
JK		 2035 /*
2036 * __add_sum_entry should be resided under the curseg_mutex
2037 * because, this function updates a summary entry in the
2038 * current summary block.
2039 */
e79efe3b 2040 __add_sum_entry(sbi, type, sum);
351df4b2 2041
351df4b2 2042 __refresh_next_blkoff(sbi, curseg);
dcdfff65
JK		 2043
2044 stat_inc_block_count(sbi, curseg);
351df4b2 2045
c6f82fe9
JK		 2046 if (!__has_curseg_space(sbi, type))
2047 sit_i->s_ops->allocate_segment(sbi, type, false);
351df4b2 2048 /*
c6f82fe9
JK		 2049 * SIT information should be updated after segment allocation,
2050 * since we need to keep dirty segments precisely under SSR.
351df4b2
JK		 2051 */
2052 refresh_sit_entry(sbi, old_blkaddr, *new_blkaddr);
5e443818 2053
351df4b2
JK		 2054 mutex_unlock(&sit_i->sentry_lock);
2055
bfad7c2d 2056 if (page && IS_NODESEG(type))
351df4b2
JK		 2057 fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg));
2058
bfad7c2d
JK		 2059 mutex_unlock(&curseg->curseg_mutex);
2060}
2061
05ca3632 2062static void do_write_page(struct f2fs_summary *sum, struct f2fs_io_info *fio)
bfad7c2d 2063{
05ca3632 2064 int type = __get_segment_type(fio->page, fio->type);
0a595eba 2065 int err;
bfad7c2d 2066
7dfeaa32
JK		 2067 if (fio->type == NODE || fio->type == DATA)
2068 mutex_lock(&fio->sbi->wio_mutex[fio->type]);
0a595eba 2069reallocate:
7a9d7548
CY		 2070 allocate_data_block(fio->sbi, fio->page, fio->old_blkaddr,
2071 &fio->new_blkaddr, sum, type);
bfad7c2d 2072
351df4b2 2073 /* writeout dirty page into bdev */
0a595eba
JK		 2074 err = f2fs_submit_page_mbio(fio);
2075 if (err == -EAGAIN) {
2076 fio->old_blkaddr = fio->new_blkaddr;
2077 goto reallocate;
2078 }
7dfeaa32
JK		 2079
2080 if (fio->type == NODE || fio->type == DATA)
2081 mutex_unlock(&fio->sbi->wio_mutex[fio->type]);
351df4b2
JK		 2082}
2083
577e3495 2084void write_meta_page(struct f2fs_sb_info *sbi, struct page *page)
351df4b2 2085{
458e6197 2086 struct f2fs_io_info fio = {
05ca3632 2087 .sbi = sbi,
458e6197 2088 .type = META,
04d328de 2089 .op = REQ_OP_WRITE,
70fd7614 2090 .op_flags = REQ_SYNC | REQ_META | REQ_PRIO,
7a9d7548
CY		 2091 .old_blkaddr = page->index,
2092 .new_blkaddr = page->index,
05ca3632 2093 .page = page,
4375a336 2094 .encrypted_page = NULL,
458e6197
JK		 2095 };
2096
2b947003 2097 if (unlikely(page->index >= MAIN_BLKADDR(sbi)))
04d328de 2098 fio.op_flags &= ~REQ_META;
2b947003 2099
351df4b2 2100 set_page_writeback(page);
05ca3632 2101 f2fs_submit_page_mbio(&fio);
351df4b2
JK		 2102}
2103
05ca3632 2104void write_node_page(unsigned int nid, struct f2fs_io_info *fio)
351df4b2
JK		 2105{
2106 struct f2fs_summary sum;
05ca3632 2107
351df4b2 2108 set_summary(&sum, nid, 0, 0);
05ca3632 2109 do_write_page(&sum, fio);
351df4b2
JK		 2110}
2111
05ca3632 2112void write_data_page(struct dnode_of_data *dn, struct f2fs_io_info *fio)
351df4b2 2113{
05ca3632 2114 struct f2fs_sb_info *sbi = fio->sbi;
351df4b2
JK		 2115 struct f2fs_summary sum;
2116 struct node_info ni;
2117
9850cf4a 2118 f2fs_bug_on(sbi, dn->data_blkaddr == NULL_ADDR);
351df4b2
JK		 2119 get_node_info(sbi, dn->nid, &ni);
2120 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version);
05ca3632 2121 do_write_page(&sum, fio);
f28b3434 2122 f2fs_update_data_blkaddr(dn, fio->new_blkaddr);
351df4b2
JK		 2123}
2124
d1b3e72d 2125int rewrite_data_page(struct f2fs_io_info *fio)
351df4b2 2126{
7a9d7548 2127 fio->new_blkaddr = fio->old_blkaddr;
05ca3632 2128 stat_inc_inplace_blocks(fio->sbi);
d1b3e72d 2129 return f2fs_submit_page_bio(fio);
351df4b2
JK		 2130}
2131
4356e48e 2132void __f2fs_replace_block(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
19f106bc 2133 block_t old_blkaddr, block_t new_blkaddr,
28bc106b 2134 bool recover_curseg, bool recover_newaddr)
351df4b2
JK		 2135{
2136 struct sit_info *sit_i = SIT_I(sbi);
2137 struct curseg_info *curseg;
2138 unsigned int segno, old_cursegno;
2139 struct seg_entry *se;
2140 int type;
19f106bc 2141 unsigned short old_blkoff;
351df4b2
JK		 2142
2143 segno = GET_SEGNO(sbi, new_blkaddr);
2144 se = get_seg_entry(sbi, segno);
2145 type = se->type;
2146
19f106bc
CY		 2147 if (!recover_curseg) {
2148 /* for recovery flow */
2149 if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) {
2150 if (old_blkaddr == NULL_ADDR)
2151 type = CURSEG_COLD_DATA;
2152 else
2153 type = CURSEG_WARM_DATA;
2154 }
2155 } else {
2156 if (!IS_CURSEG(sbi, segno))
351df4b2
JK		 2157 type = CURSEG_WARM_DATA;
2158 }
19f106bc 2159
351df4b2
JK		 2160 curseg = CURSEG_I(sbi, type);
2161
2162 mutex_lock(&curseg->curseg_mutex);
2163 mutex_lock(&sit_i->sentry_lock);
2164
2165 old_cursegno = curseg->segno;
19f106bc 2166 old_blkoff = curseg->next_blkoff;
351df4b2
JK		 2167
2168 /* change the current segment */
2169 if (segno != curseg->segno) {
2170 curseg->next_segno = segno;
2171 change_curseg(sbi, type, true);
2172 }
2173
491c0854 2174 curseg->next_blkoff = GET_BLKOFF_FROM_SEG0(sbi, new_blkaddr);
e79efe3b 2175 __add_sum_entry(sbi, type, sum);
351df4b2 2176
28bc106b 2177 if (!recover_curseg || recover_newaddr)
6e2c64ad
JK		 2178 update_sit_entry(sbi, new_blkaddr, 1);
2179 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO)
2180 update_sit_entry(sbi, old_blkaddr, -1);
2181
2182 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
2183 locate_dirty_segment(sbi, GET_SEGNO(sbi, new_blkaddr));
2184
351df4b2 2185 locate_dirty_segment(sbi, old_cursegno);
351df4b2 2186
19f106bc
CY		 2187 if (recover_curseg) {
2188 if (old_cursegno != curseg->segno) {
2189 curseg->next_segno = old_cursegno;
2190 change_curseg(sbi, type, true);
2191 }
2192 curseg->next_blkoff = old_blkoff;
2193 }
2194
351df4b2
JK		 2195 mutex_unlock(&sit_i->sentry_lock);
2196 mutex_unlock(&curseg->curseg_mutex);
2197}
2198
528e3459
CY		 2199void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn,
2200 block_t old_addr, block_t new_addr,
28bc106b
CY		 2201 unsigned char version, bool recover_curseg,
2202 bool recover_newaddr)
528e3459
CY		 2203{
2204 struct f2fs_summary sum;
2205
2206 set_summary(&sum, dn->nid, dn->ofs_in_node, version);
2207
28bc106b
CY		 2208 __f2fs_replace_block(sbi, &sum, old_addr, new_addr,
2209 recover_curseg, recover_newaddr);
528e3459 2210
f28b3434 2211 f2fs_update_data_blkaddr(dn, new_addr);
528e3459
CY		 2212}
2213
93dfe2ac 2214void f2fs_wait_on_page_writeback(struct page *page,
fec1d657 2215 enum page_type type, bool ordered)
93dfe2ac 2216{
93dfe2ac 2217 if (PageWriteback(page)) {
4081363f
JK		 2218 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
2219
942fd319
JK		 2220 f2fs_submit_merged_bio_cond(sbi, page->mapping->host,
2221 0, page->index, type, WRITE);
fec1d657
JK		 2222 if (ordered)
2223 wait_on_page_writeback(page);
2224 else
2225 wait_for_stable_page(page);
93dfe2ac
JK		 2226 }
2227}
2228
08b39fbd
CY		 2229void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *sbi,
2230 block_t blkaddr)
2231{
2232 struct page *cpage;
2233
5d4c0af4 2234 if (blkaddr == NEW_ADDR || blkaddr == NULL_ADDR)
08b39fbd
CY		 2235 return;
2236
08b39fbd
CY		 2237 cpage = find_lock_page(META_MAPPING(sbi), blkaddr);
2238 if (cpage) {
fec1d657 2239 f2fs_wait_on_page_writeback(cpage, DATA, true);
08b39fbd
CY		 2240 f2fs_put_page(cpage, 1);
2241 }
2242}
2243
351df4b2
JK		 2244static int read_compacted_summaries(struct f2fs_sb_info *sbi)
2245{
2246 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
2247 struct curseg_info *seg_i;
2248 unsigned char *kaddr;
2249 struct page *page;
2250 block_t start;
2251 int i, j, offset;
2252
2253 start = start_sum_block(sbi);
2254
2255 page = get_meta_page(sbi, start++);
2256 kaddr = (unsigned char *)page_address(page);
2257
2258 /* Step 1: restore nat cache */
2259 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 2260 memcpy(seg_i->journal, kaddr, SUM_JOURNAL_SIZE);
351df4b2
JK		 2261
2262 /* Step 2: restore sit cache */
2263 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2264 memcpy(seg_i->journal, kaddr + SUM_JOURNAL_SIZE, SUM_JOURNAL_SIZE);
351df4b2
JK		 2265 offset = 2 * SUM_JOURNAL_SIZE;
2266
2267 /* Step 3: restore summary entries */
2268 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
2269 unsigned short blk_off;
2270 unsigned int segno;
2271
2272 seg_i = CURSEG_I(sbi, i);
2273 segno = le32_to_cpu(ckpt->cur_data_segno[i]);
2274 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]);
2275 seg_i->next_segno = segno;
2276 reset_curseg(sbi, i, 0);
2277 seg_i->alloc_type = ckpt->alloc_type[i];
2278 seg_i->next_blkoff = blk_off;
2279
2280 if (seg_i->alloc_type == SSR)
2281 blk_off = sbi->blocks_per_seg;
2282
2283 for (j = 0; j < blk_off; j++) {
2284 struct f2fs_summary *s;
2285 s = (struct f2fs_summary *)(kaddr + offset);
2286 seg_i->sum_blk->entries[j] = *s;
2287 offset += SUMMARY_SIZE;
09cbfeaf 2288 if (offset + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK		 2289 SUM_FOOTER_SIZE)
2290 continue;
2291
2292 f2fs_put_page(page, 1);
2293 page = NULL;
2294
2295 page = get_meta_page(sbi, start++);
2296 kaddr = (unsigned char *)page_address(page);
2297 offset = 0;
2298 }
2299 }
2300 f2fs_put_page(page, 1);
2301 return 0;
2302}
2303
2304static int read_normal_summaries(struct f2fs_sb_info *sbi, int type)
2305{
2306 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
2307 struct f2fs_summary_block *sum;
2308 struct curseg_info *curseg;
2309 struct page *new;
2310 unsigned short blk_off;
2311 unsigned int segno = 0;
2312 block_t blk_addr = 0;
2313
2314 /* get segment number and block addr */
2315 if (IS_DATASEG(type)) {
2316 segno = le32_to_cpu(ckpt->cur_data_segno[type]);
2317 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type -
2318 CURSEG_HOT_DATA]);
119ee914 2319 if (__exist_node_summaries(sbi))
351df4b2
JK		 2320 blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type);
2321 else
2322 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type);
2323 } else {
2324 segno = le32_to_cpu(ckpt->cur_node_segno[type -
2325 CURSEG_HOT_NODE]);
2326 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type -
2327 CURSEG_HOT_NODE]);
119ee914 2328 if (__exist_node_summaries(sbi))
351df4b2
JK		 2329 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE,
2330 type - CURSEG_HOT_NODE);
2331 else
2332 blk_addr = GET_SUM_BLOCK(sbi, segno);
2333 }
2334
2335 new = get_meta_page(sbi, blk_addr);
2336 sum = (struct f2fs_summary_block *)page_address(new);
2337
2338 if (IS_NODESEG(type)) {
119ee914 2339 if (__exist_node_summaries(sbi)) {
351df4b2
JK		 2340 struct f2fs_summary *ns = &sum->entries[0];
2341 int i;
2342 for (i = 0; i < sbi->blocks_per_seg; i++, ns++) {
2343 ns->version = 0;
2344 ns->ofs_in_node = 0;
2345 }
2346 } else {
d653788a
GZ		 2347 int err;
2348
2349 err = restore_node_summary(sbi, segno, sum);
2350 if (err) {
351df4b2 2351 f2fs_put_page(new, 1);
d653788a 2352 return err;
351df4b2
JK		 2353 }
2354 }
2355 }
2356
2357 /* set uncompleted segment to curseg */
2358 curseg = CURSEG_I(sbi, type);
2359 mutex_lock(&curseg->curseg_mutex);
b7ad7512
CY		 2360
2361 /* update journal info */
2362 down_write(&curseg->journal_rwsem);
2363 memcpy(curseg->journal, &sum->journal, SUM_JOURNAL_SIZE);
2364 up_write(&curseg->journal_rwsem);
2365
2366 memcpy(curseg->sum_blk->entries, sum->entries, SUM_ENTRY_SIZE);
2367 memcpy(&curseg->sum_blk->footer, &sum->footer, SUM_FOOTER_SIZE);
351df4b2
JK		 2368 curseg->next_segno = segno;
2369 reset_curseg(sbi, type, 0);
2370 curseg->alloc_type = ckpt->alloc_type[type];
2371 curseg->next_blkoff = blk_off;
2372 mutex_unlock(&curseg->curseg_mutex);
2373 f2fs_put_page(new, 1);
2374 return 0;
2375}
2376
2377static int restore_curseg_summaries(struct f2fs_sb_info *sbi)
2378{
2379 int type = CURSEG_HOT_DATA;
e4fc5fbf 2380 int err;
351df4b2 2381
aaec2b1d 2382 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG)) {
3fa06d7b
CY		 2383 int npages = npages_for_summary_flush(sbi, true);
2384
2385 if (npages >= 2)
2386 ra_meta_pages(sbi, start_sum_block(sbi), npages,
26879fb1 2387 META_CP, true);
3fa06d7b 2388
351df4b2
JK		 2389 /* restore for compacted data summary */
2390 if (read_compacted_summaries(sbi))
2391 return -EINVAL;
2392 type = CURSEG_HOT_NODE;
2393 }
2394
119ee914 2395 if (__exist_node_summaries(sbi))
3fa06d7b 2396 ra_meta_pages(sbi, sum_blk_addr(sbi, NR_CURSEG_TYPE, type),
26879fb1 2397 NR_CURSEG_TYPE - type, META_CP, true);
3fa06d7b 2398
e4fc5fbf
CY		 2399 for (; type <= CURSEG_COLD_NODE; type++) {
2400 err = read_normal_summaries(sbi, type);
2401 if (err)
2402 return err;
2403 }
2404
351df4b2
JK		 2405 return 0;
2406}
2407
2408static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr)
2409{
2410 struct page *page;
2411 unsigned char *kaddr;
2412 struct f2fs_summary *summary;
2413 struct curseg_info *seg_i;
2414 int written_size = 0;
2415 int i, j;
2416
2417 page = grab_meta_page(sbi, blkaddr++);
2418 kaddr = (unsigned char *)page_address(page);
2419
2420 /* Step 1: write nat cache */
2421 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 2422 memcpy(kaddr, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK		 2423 written_size += SUM_JOURNAL_SIZE;
2424
2425 /* Step 2: write sit cache */
2426 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2427 memcpy(kaddr + written_size, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK		 2428 written_size += SUM_JOURNAL_SIZE;
2429
351df4b2
JK		 2430 /* Step 3: write summary entries */
2431 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
2432 unsigned short blkoff;
2433 seg_i = CURSEG_I(sbi, i);
2434 if (sbi->ckpt->alloc_type[i] == SSR)
2435 blkoff = sbi->blocks_per_seg;
2436 else
2437 blkoff = curseg_blkoff(sbi, i);
2438
2439 for (j = 0; j < blkoff; j++) {
2440 if (!page) {
2441 page = grab_meta_page(sbi, blkaddr++);
2442 kaddr = (unsigned char *)page_address(page);
2443 written_size = 0;
2444 }
2445 summary = (struct f2fs_summary *)(kaddr + written_size);
2446 *summary = seg_i->sum_blk->entries[j];
2447 written_size += SUMMARY_SIZE;
351df4b2 2448
09cbfeaf 2449 if (written_size + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK		 2450 SUM_FOOTER_SIZE)
2451 continue;
2452
e8d61a74 2453 set_page_dirty(page);
351df4b2
JK		 2454 f2fs_put_page(page, 1);
2455 page = NULL;
2456 }
2457 }
e8d61a74
CY		 2458 if (page) {
2459 set_page_dirty(page);
351df4b2 2460 f2fs_put_page(page, 1);
e8d61a74 2461 }
351df4b2
JK		 2462}
2463
2464static void write_normal_summaries(struct f2fs_sb_info *sbi,
2465 block_t blkaddr, int type)
2466{
2467 int i, end;
2468 if (IS_DATASEG(type))
2469 end = type + NR_CURSEG_DATA_TYPE;
2470 else
2471 end = type + NR_CURSEG_NODE_TYPE;
2472
b7ad7512
CY		 2473 for (i = type; i < end; i++)
2474 write_current_sum_page(sbi, i, blkaddr + (i - type));
351df4b2
JK		 2475}
2476
2477void write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
2478{
aaec2b1d 2479 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG))
351df4b2
JK		 2480 write_compacted_summaries(sbi, start_blk);
2481 else
2482 write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA);
2483}
2484
2485void write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
2486{
119ee914 2487 write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE);
351df4b2
JK		 2488}
2489
dfc08a12 2490int lookup_journal_in_cursum(struct f2fs_journal *journal, int type,
351df4b2
JK		 2491 unsigned int val, int alloc)
2492{
2493 int i;
2494
2495 if (type == NAT_JOURNAL) {
dfc08a12
CY		 2496 for (i = 0; i < nats_in_cursum(journal); i++) {
2497 if (le32_to_cpu(nid_in_journal(journal, i)) == val)
351df4b2
JK		 2498 return i;
2499 }
dfc08a12
CY		 2500 if (alloc && __has_cursum_space(journal, 1, NAT_JOURNAL))
2501 return update_nats_in_cursum(journal, 1);
351df4b2 2502 } else if (type == SIT_JOURNAL) {
dfc08a12
CY		 2503 for (i = 0; i < sits_in_cursum(journal); i++)
2504 if (le32_to_cpu(segno_in_journal(journal, i)) == val)
351df4b2 2505 return i;
dfc08a12
CY		 2506 if (alloc && __has_cursum_space(journal, 1, SIT_JOURNAL))
2507 return update_sits_in_cursum(journal, 1);
351df4b2
JK		 2508 }
2509 return -1;
2510}
2511
2512static struct page *get_current_sit_page(struct f2fs_sb_info *sbi,
2513 unsigned int segno)
2514{
2cc22186 2515 return get_meta_page(sbi, current_sit_addr(sbi, segno));
351df4b2
JK		 2516}
2517
2518static struct page *get_next_sit_page(struct f2fs_sb_info *sbi,
2519 unsigned int start)
2520{
2521 struct sit_info *sit_i = SIT_I(sbi);
2522 struct page *src_page, *dst_page;
2523 pgoff_t src_off, dst_off;
2524 void *src_addr, *dst_addr;
2525
2526 src_off = current_sit_addr(sbi, start);
2527 dst_off = next_sit_addr(sbi, src_off);
2528
2529 /* get current sit block page without lock */
2530 src_page = get_meta_page(sbi, src_off);
2531 dst_page = grab_meta_page(sbi, dst_off);
9850cf4a 2532 f2fs_bug_on(sbi, PageDirty(src_page));
351df4b2
JK		 2533
2534 src_addr = page_address(src_page);
2535 dst_addr = page_address(dst_page);
09cbfeaf 2536 memcpy(dst_addr, src_addr, PAGE_SIZE);
351df4b2
JK		 2537
2538 set_page_dirty(dst_page);
2539 f2fs_put_page(src_page, 1);
2540
2541 set_to_next_sit(sit_i, start);
2542
2543 return dst_page;
2544}
2545
184a5cd2
CY		 2546static struct sit_entry_set *grab_sit_entry_set(void)
2547{
2548 struct sit_entry_set *ses =
80c54505 2549 f2fs_kmem_cache_alloc(sit_entry_set_slab, GFP_NOFS);
184a5cd2
CY		 2550
2551 ses->entry_cnt = 0;
2552 INIT_LIST_HEAD(&ses->set_list);
2553 return ses;
2554}
2555
2556static void release_sit_entry_set(struct sit_entry_set *ses)
2557{
2558 list_del(&ses->set_list);
2559 kmem_cache_free(sit_entry_set_slab, ses);
2560}
2561
2562static void adjust_sit_entry_set(struct sit_entry_set *ses,
2563 struct list_head *head)
2564{
2565 struct sit_entry_set *next = ses;
2566
2567 if (list_is_last(&ses->set_list, head))
2568 return;
2569
2570 list_for_each_entry_continue(next, head, set_list)
2571 if (ses->entry_cnt <= next->entry_cnt)
2572 break;
2573
2574 list_move_tail(&ses->set_list, &next->set_list);
2575}
2576
2577static void add_sit_entry(unsigned int segno, struct list_head *head)
2578{
2579 struct sit_entry_set *ses;
2580 unsigned int start_segno = START_SEGNO(segno);
2581
2582 list_for_each_entry(ses, head, set_list) {
2583 if (ses->start_segno == start_segno) {
2584 ses->entry_cnt++;
2585 adjust_sit_entry_set(ses, head);
2586 return;
2587 }
2588 }
2589
2590 ses = grab_sit_entry_set();
2591
2592 ses->start_segno = start_segno;
2593 ses->entry_cnt++;
2594 list_add(&ses->set_list, head);
2595}
2596
2597static void add_sits_in_set(struct f2fs_sb_info *sbi)
2598{
2599 struct f2fs_sm_info *sm_info = SM_I(sbi);
2600 struct list_head *set_list = &sm_info->sit_entry_set;
2601 unsigned long *bitmap = SIT_I(sbi)->dirty_sentries_bitmap;
184a5cd2
CY		 2602 unsigned int segno;
2603
7cd8558b 2604 for_each_set_bit(segno, bitmap, MAIN_SEGS(sbi))
184a5cd2
CY		 2605 add_sit_entry(segno, set_list);
2606}
2607
2608static void remove_sits_in_journal(struct f2fs_sb_info *sbi)
351df4b2
JK		 2609{
2610 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2611 struct f2fs_journal *journal = curseg->journal;
351df4b2
JK		 2612 int i;
2613
b7ad7512 2614 down_write(&curseg->journal_rwsem);
dfc08a12 2615 for (i = 0; i < sits_in_cursum(journal); i++) {
184a5cd2
CY		 2616 unsigned int segno;
2617 bool dirtied;
2618
dfc08a12 2619 segno = le32_to_cpu(segno_in_journal(journal, i));
184a5cd2
CY		 2620 dirtied = __mark_sit_entry_dirty(sbi, segno);
2621
2622 if (!dirtied)
2623 add_sit_entry(segno, &SM_I(sbi)->sit_entry_set);
351df4b2 2624 }
dfc08a12 2625 update_sits_in_cursum(journal, -i);
b7ad7512 2626 up_write(&curseg->journal_rwsem);
351df4b2
JK		 2627}
2628
0a8165d7 2629/*
351df4b2
JK		 2630 * CP calls this function, which flushes SIT entries including sit_journal,
2631 * and moves prefree segs to free segs.
2632 */
4b2fecc8 2633void flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc)
351df4b2
JK		 2634{
2635 struct sit_info *sit_i = SIT_I(sbi);
2636 unsigned long *bitmap = sit_i->dirty_sentries_bitmap;
2637 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2638 struct f2fs_journal *journal = curseg->journal;
184a5cd2
CY		 2639 struct sit_entry_set *ses, *tmp;
2640 struct list_head *head = &SM_I(sbi)->sit_entry_set;
184a5cd2 2641 bool to_journal = true;
4b2fecc8 2642 struct seg_entry *se;
351df4b2 2643
351df4b2
JK		 2644 mutex_lock(&sit_i->sentry_lock);
2645
2b11a74b
WL		 2646 if (!sit_i->dirty_sentries)
2647 goto out;
2648
351df4b2 2649 /*
184a5cd2
CY		 2650 * add and account sit entries of dirty bitmap in sit entry
2651 * set temporarily
351df4b2 2652 */
184a5cd2 2653 add_sits_in_set(sbi);
351df4b2 2654
184a5cd2
CY		 2655 /*
2656 * if there are no enough space in journal to store dirty sit
2657 * entries, remove all entries from journal and add and account
2658 * them in sit entry set.
2659 */
dfc08a12 2660 if (!__has_cursum_space(journal, sit_i->dirty_sentries, SIT_JOURNAL))
184a5cd2 2661 remove_sits_in_journal(sbi);
b2955550 2662
184a5cd2
CY		 2663 /*
2664 * there are two steps to flush sit entries:
2665 * #1, flush sit entries to journal in current cold data summary block.
2666 * #2, flush sit entries to sit page.
2667 */
2668 list_for_each_entry_safe(ses, tmp, head, set_list) {
4a257ed6 2669 struct page *page = NULL;
184a5cd2
CY		 2670 struct f2fs_sit_block *raw_sit = NULL;
2671 unsigned int start_segno = ses->start_segno;
2672 unsigned int end = min(start_segno + SIT_ENTRY_PER_BLOCK,
7cd8558b 2673 (unsigned long)MAIN_SEGS(sbi));
184a5cd2
CY		 2674 unsigned int segno = start_segno;
2675
2676 if (to_journal &&
dfc08a12 2677 !__has_cursum_space(journal, ses->entry_cnt, SIT_JOURNAL))
184a5cd2
CY		 2678 to_journal = false;
2679
b7ad7512
CY		 2680 if (to_journal) {
2681 down_write(&curseg->journal_rwsem);
2682 } else {
184a5cd2
CY		 2683 page = get_next_sit_page(sbi, start_segno);
2684 raw_sit = page_address(page);
351df4b2 2685 }
351df4b2 2686
184a5cd2
CY		 2687 /* flush dirty sit entries in region of current sit set */
2688 for_each_set_bit_from(segno, bitmap, end) {
2689 int offset, sit_offset;
4b2fecc8
JK		 2690
2691 se = get_seg_entry(sbi, segno);
184a5cd2
CY		 2692
2693 /* add discard candidates */
d7bc2484 2694 if (cpc->reason != CP_DISCARD) {
4b2fecc8 2695 cpc->trim_start = segno;
25290fa5 2696 add_discard_addrs(sbi, cpc, false);
4b2fecc8 2697 }
184a5cd2
CY		 2698
2699 if (to_journal) {
dfc08a12 2700 offset = lookup_journal_in_cursum(journal,
184a5cd2
CY		 2701 SIT_JOURNAL, segno, 1);
2702 f2fs_bug_on(sbi, offset < 0);
dfc08a12 2703 segno_in_journal(journal, offset) =
184a5cd2
CY		 2704 cpu_to_le32(segno);
2705 seg_info_to_raw_sit(se,
dfc08a12 2706 &sit_in_journal(journal, offset));
184a5cd2
CY		 2707 } else {
2708 sit_offset = SIT_ENTRY_OFFSET(sit_i, segno);
2709 seg_info_to_raw_sit(se,
2710 &raw_sit->entries[sit_offset]);
2711 }
351df4b2 2712
184a5cd2
CY		 2713 __clear_bit(segno, bitmap);
2714 sit_i->dirty_sentries--;
2715 ses->entry_cnt--;
351df4b2
JK		 2716 }
2717
b7ad7512
CY		 2718 if (to_journal)
2719 up_write(&curseg->journal_rwsem);
2720 else
184a5cd2
CY		 2721 f2fs_put_page(page, 1);
2722
2723 f2fs_bug_on(sbi, ses->entry_cnt);
2724 release_sit_entry_set(ses);
351df4b2 2725 }
184a5cd2
CY		 2726
2727 f2fs_bug_on(sbi, !list_empty(head));
2728 f2fs_bug_on(sbi, sit_i->dirty_sentries);
184a5cd2 2729out:
4b2fecc8 2730 if (cpc->reason == CP_DISCARD) {
650d3c4e
YH		 2731 __u64 trim_start = cpc->trim_start;
2732
4b2fecc8 2733 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++)
25290fa5 2734 add_discard_addrs(sbi, cpc, false);
650d3c4e
YH		 2735
2736 cpc->trim_start = trim_start;
4b2fecc8 2737 }
351df4b2 2738 mutex_unlock(&sit_i->sentry_lock);
351df4b2 2739
351df4b2
JK		 2740 set_prefree_as_free_segments(sbi);
2741}
2742
2743static int build_sit_info(struct f2fs_sb_info *sbi)
2744{
2745 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
351df4b2
JK		 2746 struct sit_info *sit_i;
2747 unsigned int sit_segs, start;
ae27d62e 2748 char *src_bitmap;
351df4b2
JK		 2749 unsigned int bitmap_size;
2750
2751 /* allocate memory for SIT information */
2752 sit_i = kzalloc(sizeof(struct sit_info), GFP_KERNEL);
2753 if (!sit_i)
2754 return -ENOMEM;
2755
2756 SM_I(sbi)->sit_info = sit_i;
2757
39307a8e
JK		 2758 sit_i->sentries = f2fs_kvzalloc(MAIN_SEGS(sbi) *
2759 sizeof(struct seg_entry), GFP_KERNEL);
351df4b2
JK		 2760 if (!sit_i->sentries)
2761 return -ENOMEM;
2762
7cd8558b 2763 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
39307a8e 2764 sit_i->dirty_sentries_bitmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 2765 if (!sit_i->dirty_sentries_bitmap)
2766 return -ENOMEM;
2767
7cd8558b 2768 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2
JK		 2769 sit_i->sentries[start].cur_valid_map
2770 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2771 sit_i->sentries[start].ckpt_valid_map
2772 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
a66cdd98 2773 if (!sit_i->sentries[start].cur_valid_map ||
3e025740 2774 !sit_i->sentries[start].ckpt_valid_map)
351df4b2 2775 return -ENOMEM;
3e025740 2776
355e7891
CY		 2777#ifdef CONFIG_F2FS_CHECK_FS
2778 sit_i->sentries[start].cur_valid_map_mir
2779 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2780 if (!sit_i->sentries[start].cur_valid_map_mir)
2781 return -ENOMEM;
2782#endif
2783
3e025740
JK		 2784 if (f2fs_discard_en(sbi)) {
2785 sit_i->sentries[start].discard_map
2786 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2787 if (!sit_i->sentries[start].discard_map)
2788 return -ENOMEM;
2789 }
351df4b2
JK		 2790 }
2791
60a3b782
JK		 2792 sit_i->tmp_map = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
2793 if (!sit_i->tmp_map)
2794 return -ENOMEM;
2795
351df4b2 2796 if (sbi->segs_per_sec > 1) {
39307a8e
JK		 2797 sit_i->sec_entries = f2fs_kvzalloc(MAIN_SECS(sbi) *
2798 sizeof(struct sec_entry), GFP_KERNEL);
351df4b2
JK		 2799 if (!sit_i->sec_entries)
2800 return -ENOMEM;
2801 }
2802
2803 /* get information related with SIT */
2804 sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1;
2805
2806 /* setup SIT bitmap from ckeckpoint pack */
2807 bitmap_size = __bitmap_size(sbi, SIT_BITMAP);
2808 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP);
2809
ae27d62e
CY		 2810 sit_i->sit_bitmap = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
2811 if (!sit_i->sit_bitmap)
351df4b2 2812 return -ENOMEM;
351df4b2 2813
ae27d62e
CY		 2814#ifdef CONFIG_F2FS_CHECK_FS
2815 sit_i->sit_bitmap_mir = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
2816 if (!sit_i->sit_bitmap_mir)
2817 return -ENOMEM;
2818#endif
2819
351df4b2
JK		 2820 /* init SIT information */
2821 sit_i->s_ops = &default_salloc_ops;
2822
2823 sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr);
2824 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg;
c79b7ff1 2825 sit_i->written_valid_blocks = 0;
351df4b2
JK		 2826 sit_i->bitmap_size = bitmap_size;
2827 sit_i->dirty_sentries = 0;
2828 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK;
2829 sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time);
2830 sit_i->mounted_time = CURRENT_TIME_SEC.tv_sec;
2831 mutex_init(&sit_i->sentry_lock);
2832 return 0;
2833}
2834
2835static int build_free_segmap(struct f2fs_sb_info *sbi)
2836{
351df4b2
JK		 2837 struct free_segmap_info *free_i;
2838 unsigned int bitmap_size, sec_bitmap_size;
2839
2840 /* allocate memory for free segmap information */
2841 free_i = kzalloc(sizeof(struct free_segmap_info), GFP_KERNEL);
2842 if (!free_i)
2843 return -ENOMEM;
2844
2845 SM_I(sbi)->free_info = free_i;
2846
7cd8558b 2847 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
39307a8e 2848 free_i->free_segmap = f2fs_kvmalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 2849 if (!free_i->free_segmap)
2850 return -ENOMEM;
2851
7cd8558b 2852 sec_bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
39307a8e 2853 free_i->free_secmap = f2fs_kvmalloc(sec_bitmap_size, GFP_KERNEL);
351df4b2
JK		 2854 if (!free_i->free_secmap)
2855 return -ENOMEM;
2856
2857 /* set all segments as dirty temporarily */
2858 memset(free_i->free_segmap, 0xff, bitmap_size);
2859 memset(free_i->free_secmap, 0xff, sec_bitmap_size);
2860
2861 /* init free segmap information */
7cd8558b 2862 free_i->start_segno = GET_SEGNO_FROM_SEG0(sbi, MAIN_BLKADDR(sbi));
351df4b2
JK		 2863 free_i->free_segments = 0;
2864 free_i->free_sections = 0;
1a118ccf 2865 spin_lock_init(&free_i->segmap_lock);
351df4b2
JK		 2866 return 0;
2867}
2868
2869static int build_curseg(struct f2fs_sb_info *sbi)
2870{
1042d60f 2871 struct curseg_info *array;
351df4b2
JK		 2872 int i;
2873
b434babf 2874 array = kcalloc(NR_CURSEG_TYPE, sizeof(*array), GFP_KERNEL);
351df4b2
JK		 2875 if (!array)
2876 return -ENOMEM;
2877
2878 SM_I(sbi)->curseg_array = array;
2879
2880 for (i = 0; i < NR_CURSEG_TYPE; i++) {
2881 mutex_init(&array[i].curseg_mutex);
09cbfeaf 2882 array[i].sum_blk = kzalloc(PAGE_SIZE, GFP_KERNEL);
351df4b2
JK		 2883 if (!array[i].sum_blk)
2884 return -ENOMEM;
b7ad7512
CY		 2885 init_rwsem(&array[i].journal_rwsem);
2886 array[i].journal = kzalloc(sizeof(struct f2fs_journal),
2887 GFP_KERNEL);
2888 if (!array[i].journal)
2889 return -ENOMEM;
351df4b2
JK		 2890 array[i].segno = NULL_SEGNO;
2891 array[i].next_blkoff = 0;
2892 }
2893 return restore_curseg_summaries(sbi);
2894}
2895
2896static void build_sit_entries(struct f2fs_sb_info *sbi)
2897{
2898 struct sit_info *sit_i = SIT_I(sbi);
2899 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 2900 struct f2fs_journal *journal = curseg->journal;
9c094040
YH		 2901 struct seg_entry *se;
2902 struct f2fs_sit_entry sit;
74de593a
CY		 2903 int sit_blk_cnt = SIT_BLK_CNT(sbi);
2904 unsigned int i, start, end;
2905 unsigned int readed, start_blk = 0;
351df4b2 2906
74de593a 2907 do {
664ba972
JK		 2908 readed = ra_meta_pages(sbi, start_blk, BIO_MAX_PAGES,
2909 META_SIT, true);
74de593a
CY		 2910
2911 start = start_blk * sit_i->sents_per_block;
2912 end = (start_blk + readed) * sit_i->sents_per_block;
2913
7cd8558b 2914 for (; start < end && start < MAIN_SEGS(sbi); start++) {
74de593a 2915 struct f2fs_sit_block *sit_blk;
74de593a
CY		 2916 struct page *page;
2917
9c094040 2918 se = &sit_i->sentries[start];
74de593a
CY		 2919 page = get_current_sit_page(sbi, start);
2920 sit_blk = (struct f2fs_sit_block *)page_address(page);
2921 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)];
2922 f2fs_put_page(page, 1);
d600af23 2923
74de593a
CY		 2924 check_block_count(sbi, start, &sit);
2925 seg_info_from_raw_sit(se, &sit);
a66cdd98
JK		 2926
2927 /* build discard map only one time */
3e025740
JK		 2928 if (f2fs_discard_en(sbi)) {
2929 memcpy(se->discard_map, se->cur_valid_map,
2930 SIT_VBLOCK_MAP_SIZE);
2931 sbi->discard_blks += sbi->blocks_per_seg -
2932 se->valid_blocks;
2933 }
a66cdd98 2934
d600af23
CY		 2935 if (sbi->segs_per_sec > 1)
2936 get_sec_entry(sbi, start)->valid_blocks +=
2937 se->valid_blocks;
351df4b2 2938 }
74de593a
CY		 2939 start_blk += readed;
2940 } while (start_blk < sit_blk_cnt);
d600af23
CY		 2941
2942 down_read(&curseg->journal_rwsem);
2943 for (i = 0; i < sits_in_cursum(journal); i++) {
d600af23
CY		 2944 unsigned int old_valid_blocks;
2945
2946 start = le32_to_cpu(segno_in_journal(journal, i));
2947 se = &sit_i->sentries[start];
2948 sit = sit_in_journal(journal, i);
2949
2950 old_valid_blocks = se->valid_blocks;
2951
2952 check_block_count(sbi, start, &sit);
2953 seg_info_from_raw_sit(se, &sit);
2954
2955 if (f2fs_discard_en(sbi)) {
2956 memcpy(se->discard_map, se->cur_valid_map,
2957 SIT_VBLOCK_MAP_SIZE);
2958 sbi->discard_blks += old_valid_blocks -
2959 se->valid_blocks;
2960 }
2961
2962 if (sbi->segs_per_sec > 1)
2963 get_sec_entry(sbi, start)->valid_blocks +=
2964 se->valid_blocks - old_valid_blocks;
2965 }
2966 up_read(&curseg->journal_rwsem);
351df4b2
JK		 2967}
2968
2969static void init_free_segmap(struct f2fs_sb_info *sbi)
2970{
2971 unsigned int start;
2972 int type;
2973
7cd8558b 2974 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2
JK		 2975 struct seg_entry *sentry = get_seg_entry(sbi, start);
2976 if (!sentry->valid_blocks)
2977 __set_free(sbi, start);
c79b7ff1
JK		 2978 else
2979 SIT_I(sbi)->written_valid_blocks +=
2980 sentry->valid_blocks;
351df4b2
JK		 2981 }
2982
2983 /* set use the current segments */
2984 for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) {
2985 struct curseg_info *curseg_t = CURSEG_I(sbi, type);
2986 __set_test_and_inuse(sbi, curseg_t->segno);
2987 }
2988}
2989
2990static void init_dirty_segmap(struct f2fs_sb_info *sbi)
2991{
2992 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2993 struct free_segmap_info *free_i = FREE_I(sbi);
7cd8558b 2994 unsigned int segno = 0, offset = 0;
351df4b2
JK		 2995 unsigned short valid_blocks;
2996
8736fbf0 2997 while (1) {
351df4b2 2998 /* find dirty segment based on free segmap */
7cd8558b
JK		 2999 segno = find_next_inuse(free_i, MAIN_SEGS(sbi), offset);
3000 if (segno >= MAIN_SEGS(sbi))
351df4b2
JK		 3001 break;
3002 offset = segno + 1;
302bd348 3003 valid_blocks = get_valid_blocks(sbi, segno, false);
ec325b52 3004 if (valid_blocks == sbi->blocks_per_seg || !valid_blocks)
351df4b2 3005 continue;
ec325b52
JK		 3006 if (valid_blocks > sbi->blocks_per_seg) {
3007 f2fs_bug_on(sbi, 1);
3008 continue;
3009 }
351df4b2
JK		 3010 mutex_lock(&dirty_i->seglist_lock);
3011 __locate_dirty_segment(sbi, segno, DIRTY);
3012 mutex_unlock(&dirty_i->seglist_lock);
3013 }
3014}
3015
5ec4e49f 3016static int init_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 3017{
3018 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
7cd8558b 3019 unsigned int bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
351df4b2 3020
39307a8e 3021 dirty_i->victim_secmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
5ec4e49f 3022 if (!dirty_i->victim_secmap)
351df4b2
JK		 3023 return -ENOMEM;
3024 return 0;
3025}
3026
3027static int build_dirty_segmap(struct f2fs_sb_info *sbi)
3028{
3029 struct dirty_seglist_info *dirty_i;
3030 unsigned int bitmap_size, i;
3031
3032 /* allocate memory for dirty segments list information */
3033 dirty_i = kzalloc(sizeof(struct dirty_seglist_info), GFP_KERNEL);
3034 if (!dirty_i)
3035 return -ENOMEM;
3036
3037 SM_I(sbi)->dirty_info = dirty_i;
3038 mutex_init(&dirty_i->seglist_lock);
3039
7cd8558b 3040 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
351df4b2
JK		 3041
3042 for (i = 0; i < NR_DIRTY_TYPE; i++) {
39307a8e 3043 dirty_i->dirty_segmap[i] = f2fs_kvzalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 3044 if (!dirty_i->dirty_segmap[i])
3045 return -ENOMEM;
3046 }
3047
3048 init_dirty_segmap(sbi);
5ec4e49f 3049 return init_victim_secmap(sbi);
351df4b2
JK		 3050}
3051
0a8165d7 3052/*
351df4b2
JK		 3053 * Update min, max modified time for cost-benefit GC algorithm
3054 */
3055static void init_min_max_mtime(struct f2fs_sb_info *sbi)
3056{
3057 struct sit_info *sit_i = SIT_I(sbi);
3058 unsigned int segno;
3059
3060 mutex_lock(&sit_i->sentry_lock);
3061
3062 sit_i->min_mtime = LLONG_MAX;
3063
7cd8558b 3064 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
351df4b2
JK		 3065 unsigned int i;
3066 unsigned long long mtime = 0;
3067
3068 for (i = 0; i < sbi->segs_per_sec; i++)
3069 mtime += get_seg_entry(sbi, segno + i)->mtime;
3070
3071 mtime = div_u64(mtime, sbi->segs_per_sec);
3072
3073 if (sit_i->min_mtime > mtime)
3074 sit_i->min_mtime = mtime;
3075 }
3076 sit_i->max_mtime = get_mtime(sbi);
3077 mutex_unlock(&sit_i->sentry_lock);
3078}
3079
3080int build_segment_manager(struct f2fs_sb_info *sbi)
3081{
3082 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
3083 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1042d60f 3084 struct f2fs_sm_info *sm_info;
351df4b2
JK		 3085 int err;
3086
3087 sm_info = kzalloc(sizeof(struct f2fs_sm_info), GFP_KERNEL);
3088 if (!sm_info)
3089 return -ENOMEM;
3090
3091 /* init sm info */
3092 sbi->sm_info = sm_info;
351df4b2
JK		 3093 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr);
3094 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr);
3095 sm_info->segment_count = le32_to_cpu(raw_super->segment_count);
3096 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count);
3097 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count);
3098 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main);
3099 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr);
58c41035
JK		 3100 sm_info->rec_prefree_segments = sm_info->main_segments *
3101 DEF_RECLAIM_PREFREE_SEGMENTS / 100;
44a83499
JK		 3102 if (sm_info->rec_prefree_segments > DEF_MAX_RECLAIM_PREFREE_SEGMENTS)
3103 sm_info->rec_prefree_segments = DEF_MAX_RECLAIM_PREFREE_SEGMENTS;
3104
52763a4b
JK		 3105 if (!test_opt(sbi, LFS))
3106 sm_info->ipu_policy = 1 << F2FS_IPU_FSYNC;
216fbd64 3107 sm_info->min_ipu_util = DEF_MIN_IPU_UTIL;
c1ce1b02 3108 sm_info->min_fsync_blocks = DEF_MIN_FSYNC_BLOCKS;
ef095d19 3109 sm_info->min_hot_blocks = DEF_MIN_HOT_BLOCKS;
351df4b2 3110
bba681cb
JK		 3111 sm_info->trim_sections = DEF_BATCHED_TRIM_SECTIONS;
3112
184a5cd2
CY		 3113 INIT_LIST_HEAD(&sm_info->sit_entry_set);
3114
b270ad6f 3115 if (test_opt(sbi, FLUSH_MERGE) && !f2fs_readonly(sbi->sb)) {
2163d198
GZ		 3116 err = create_flush_cmd_control(sbi);
3117 if (err)
a688b9d9 3118 return err;
6b4afdd7
JK		 3119 }
3120
0b54fb84
JK		 3121 err = create_discard_cmd_control(sbi);
3122 if (err)
3123 return err;
3124
351df4b2
JK		 3125 err = build_sit_info(sbi);
3126 if (err)
3127 return err;
3128 err = build_free_segmap(sbi);
3129 if (err)
3130 return err;
3131 err = build_curseg(sbi);
3132 if (err)
3133 return err;
3134
3135 /* reinit free segmap based on SIT */
3136 build_sit_entries(sbi);
3137
3138 init_free_segmap(sbi);
3139 err = build_dirty_segmap(sbi);
3140 if (err)
3141 return err;
3142
3143 init_min_max_mtime(sbi);
3144 return 0;
3145}
3146
3147static void discard_dirty_segmap(struct f2fs_sb_info *sbi,
3148 enum dirty_type dirty_type)
3149{
3150 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
3151
3152 mutex_lock(&dirty_i->seglist_lock);
39307a8e 3153 kvfree(dirty_i->dirty_segmap[dirty_type]);
351df4b2
JK		 3154 dirty_i->nr_dirty[dirty_type] = 0;
3155 mutex_unlock(&dirty_i->seglist_lock);
3156}
3157
5ec4e49f 3158static void destroy_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 3159{
3160 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
39307a8e 3161 kvfree(dirty_i->victim_secmap);
351df4b2
JK		 3162}
3163
3164static void destroy_dirty_segmap(struct f2fs_sb_info *sbi)
3165{
3166 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
3167 int i;
3168
3169 if (!dirty_i)
3170 return;
3171
3172 /* discard pre-free/dirty segments list */
3173 for (i = 0; i < NR_DIRTY_TYPE; i++)
3174 discard_dirty_segmap(sbi, i);
3175
5ec4e49f 3176 destroy_victim_secmap(sbi);
351df4b2
JK		 3177 SM_I(sbi)->dirty_info = NULL;
3178 kfree(dirty_i);
3179}
3180
3181static void destroy_curseg(struct f2fs_sb_info *sbi)
3182{
3183 struct curseg_info *array = SM_I(sbi)->curseg_array;
3184 int i;
3185
3186 if (!array)
3187 return;
3188 SM_I(sbi)->curseg_array = NULL;
b7ad7512 3189 for (i = 0; i < NR_CURSEG_TYPE; i++) {
351df4b2 3190 kfree(array[i].sum_blk);
b7ad7512
CY		 3191 kfree(array[i].journal);
3192 }
351df4b2
JK		 3193 kfree(array);
3194}
3195
3196static void destroy_free_segmap(struct f2fs_sb_info *sbi)
3197{
3198 struct free_segmap_info *free_i = SM_I(sbi)->free_info;
3199 if (!free_i)
3200 return;
3201 SM_I(sbi)->free_info = NULL;
39307a8e
JK		 3202 kvfree(free_i->free_segmap);
3203 kvfree(free_i->free_secmap);
351df4b2
JK		 3204 kfree(free_i);
3205}
3206
3207static void destroy_sit_info(struct f2fs_sb_info *sbi)
3208{
3209 struct sit_info *sit_i = SIT_I(sbi);
3210 unsigned int start;
3211
3212 if (!sit_i)
3213 return;
3214
3215 if (sit_i->sentries) {
7cd8558b 3216 for (start = 0; start < MAIN_SEGS(sbi); start++) {
351df4b2 3217 kfree(sit_i->sentries[start].cur_valid_map);
355e7891
CY		 3218#ifdef CONFIG_F2FS_CHECK_FS
3219 kfree(sit_i->sentries[start].cur_valid_map_mir);
3220#endif
351df4b2 3221 kfree(sit_i->sentries[start].ckpt_valid_map);
a66cdd98 3222 kfree(sit_i->sentries[start].discard_map);
351df4b2
JK		 3223 }
3224 }
60a3b782
JK		 3225 kfree(sit_i->tmp_map);
3226
39307a8e
JK		 3227 kvfree(sit_i->sentries);
3228 kvfree(sit_i->sec_entries);
3229 kvfree(sit_i->dirty_sentries_bitmap);
351df4b2
JK		 3230
3231 SM_I(sbi)->sit_info = NULL;
3232 kfree(sit_i->sit_bitmap);
ae27d62e
CY		 3233#ifdef CONFIG_F2FS_CHECK_FS
3234 kfree(sit_i->sit_bitmap_mir);
3235#endif
351df4b2
JK		 3236 kfree(sit_i);
3237}
3238
3239void destroy_segment_manager(struct f2fs_sb_info *sbi)
3240{
3241 struct f2fs_sm_info *sm_info = SM_I(sbi);
a688b9d9 3242
3b03f724
CY		 3243 if (!sm_info)
3244 return;
5eba8c5d 3245 destroy_flush_cmd_control(sbi, true);
f099405f 3246 destroy_discard_cmd_control(sbi);
351df4b2
JK		 3247 destroy_dirty_segmap(sbi);
3248 destroy_curseg(sbi);
3249 destroy_free_segmap(sbi);
3250 destroy_sit_info(sbi);
3251 sbi->sm_info = NULL;
3252 kfree(sm_info);
3253}
7fd9e544
JK		 3254
3255int __init create_segment_manager_caches(void)
3256{
3257 discard_entry_slab = f2fs_kmem_cache_create("discard_entry",
e8512d2e 3258 sizeof(struct discard_entry));
7fd9e544 3259 if (!discard_entry_slab)
184a5cd2
CY		 3260 goto fail;
3261
b01a9201
JK		 3262 discard_cmd_slab = f2fs_kmem_cache_create("discard_cmd",
3263 sizeof(struct discard_cmd));
3264 if (!discard_cmd_slab)
6ab2a308 3265 goto destroy_discard_entry;
275b66b0 3266
184a5cd2 3267 sit_entry_set_slab = f2fs_kmem_cache_create("sit_entry_set",
c9ee0085 3268 sizeof(struct sit_entry_set));
184a5cd2 3269 if (!sit_entry_set_slab)
b01a9201 3270 goto destroy_discard_cmd;
88b88a66
JK		 3271
3272 inmem_entry_slab = f2fs_kmem_cache_create("inmem_page_entry",
3273 sizeof(struct inmem_pages));
3274 if (!inmem_entry_slab)
3275 goto destroy_sit_entry_set;
7fd9e544 3276 return 0;
184a5cd2 3277
88b88a66
JK		 3278destroy_sit_entry_set:
3279 kmem_cache_destroy(sit_entry_set_slab);
b01a9201
JK		 3280destroy_discard_cmd:
3281 kmem_cache_destroy(discard_cmd_slab);
6ab2a308 3282destroy_discard_entry:
184a5cd2
CY		 3283 kmem_cache_destroy(discard_entry_slab);
3284fail:
3285 return -ENOMEM;
7fd9e544
JK		 3286}
3287
3288void destroy_segment_manager_caches(void)
3289{
184a5cd2 3290 kmem_cache_destroy(sit_entry_set_slab);
b01a9201 3291 kmem_cache_destroy(discard_cmd_slab);
7fd9e544 3292 kmem_cache_destroy(discard_entry_slab);
88b88a66 3293 kmem_cache_destroy(inmem_entry_slab);
7fd9e544 3294}
ubuntu-bionic-kernel mirror