Merge tag 'printk-for-5.11' of git://git.kernel.org/pub/scm/linux/kernel/git/printk...
[linux-2.6-block.git] / fs / f2fs / segment.c
CommitLineData
7c1a000d 1// SPDX-License-Identifier: GPL-2.0
0a8165d7 2/*
351df4b2
JK
3 * fs/f2fs/segment.c
4 *
5 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
6 * http://www.samsung.com/
351df4b2
JK
7 */
8#include <linux/fs.h>
9#include <linux/f2fs_fs.h>
10#include <linux/bio.h>
11#include <linux/blkdev.h>
690e4a3e 12#include <linux/prefetch.h>
6b4afdd7 13#include <linux/kthread.h>
74de593a 14#include <linux/swap.h>
60b99b48 15#include <linux/timer.h>
1d7be270 16#include <linux/freezer.h>
1eb1ef4a 17#include <linux/sched/signal.h>
351df4b2
JK
18
19#include "f2fs.h"
20#include "segment.h"
21#include "node.h"
5f656541 22#include "gc.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
4d57b86d 169bool f2fs_need_SSR(struct f2fs_sb_info *sbi)
b3a97a2a
JK
170{
171 int node_secs = get_blocktype_secs(sbi, F2FS_DIRTY_NODES);
172 int dent_secs = get_blocktype_secs(sbi, F2FS_DIRTY_DENTS);
173 int imeta_secs = get_blocktype_secs(sbi, F2FS_DIRTY_IMETA);
174
b0332a0f 175 if (f2fs_lfs_mode(sbi))
b3a97a2a 176 return false;
0e5e8111 177 if (sbi->gc_mode == GC_URGENT_HIGH)
b3a97a2a 178 return true;
4354994f
DR
179 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
180 return true;
b3a97a2a
JK
181
182 return free_sections(sbi) <= (node_secs + 2 * dent_secs + imeta_secs +
a2a12b67 183 SM_I(sbi)->min_ssr_sections + reserved_sections(sbi));
b3a97a2a
JK
184}
185
4d57b86d 186void f2fs_register_inmem_page(struct inode *inode, struct page *page)
88b88a66 187{
88b88a66 188 struct inmem_pages *new;
9be32d72 189
9e4ded3f 190 f2fs_trace_pid(page);
0722b101 191
e90027d2 192 f2fs_set_page_private(page, ATOMIC_WRITTEN_PAGE);
decd36b6 193
88b88a66
JK
194 new = f2fs_kmem_cache_alloc(inmem_entry_slab, GFP_NOFS);
195
196 /* add atomic page indices to the list */
197 new->page = page;
198 INIT_LIST_HEAD(&new->list);
decd36b6 199
88b88a66 200 /* increase reference count with clean state */
88b88a66 201 get_page(page);
743b620c
JK
202 mutex_lock(&F2FS_I(inode)->inmem_lock);
203 list_add_tail(&new->list, &F2FS_I(inode)->inmem_pages);
8dcf2ff7 204 inc_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
743b620c 205 mutex_unlock(&F2FS_I(inode)->inmem_lock);
8ce67cb0
JK
206
207 trace_f2fs_register_inmem_page(page, INMEM);
88b88a66
JK
208}
209
28bc106b 210static int __revoke_inmem_pages(struct inode *inode,
48432984
CY
211 struct list_head *head, bool drop, bool recover,
212 bool trylock)
29b96b54 213{
28bc106b 214 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
29b96b54 215 struct inmem_pages *cur, *tmp;
28bc106b 216 int err = 0;
29b96b54
CY
217
218 list_for_each_entry_safe(cur, tmp, head, list) {
28bc106b
CY
219 struct page *page = cur->page;
220
221 if (drop)
222 trace_f2fs_commit_inmem_page(page, INMEM_DROP);
223
48432984
CY
224 if (trylock) {
225 /*
226 * to avoid deadlock in between page lock and
227 * inmem_lock.
228 */
229 if (!trylock_page(page))
230 continue;
231 } else {
232 lock_page(page);
233 }
29b96b54 234
bae0ee7a 235 f2fs_wait_on_page_writeback(page, DATA, true, true);
e5e5732d 236
28bc106b
CY
237 if (recover) {
238 struct dnode_of_data dn;
239 struct node_info ni;
240
241 trace_f2fs_commit_inmem_page(page, INMEM_REVOKE);
7f2b4e8e 242retry:
28bc106b 243 set_new_dnode(&dn, inode, NULL, NULL, 0);
4d57b86d
CY
244 err = f2fs_get_dnode_of_data(&dn, page->index,
245 LOOKUP_NODE);
7f2b4e8e
CY
246 if (err) {
247 if (err == -ENOMEM) {
5df7731f
CY
248 congestion_wait(BLK_RW_ASYNC,
249 DEFAULT_IO_TIMEOUT);
7f2b4e8e
CY
250 cond_resched();
251 goto retry;
252 }
28bc106b
CY
253 err = -EAGAIN;
254 goto next;
255 }
7735730d
CY
256
257 err = f2fs_get_node_info(sbi, dn.nid, &ni);
258 if (err) {
259 f2fs_put_dnode(&dn);
260 return err;
261 }
262
f1d2564a 263 if (cur->old_addr == NEW_ADDR) {
4d57b86d 264 f2fs_invalidate_blocks(sbi, dn.data_blkaddr);
f1d2564a
DJ
265 f2fs_update_data_blkaddr(&dn, NEW_ADDR);
266 } else
267 f2fs_replace_block(sbi, &dn, dn.data_blkaddr,
28bc106b
CY
268 cur->old_addr, ni.version, true, true);
269 f2fs_put_dnode(&dn);
270 }
271next:
63c52d78 272 /* we don't need to invalidate this in the sccessful status */
2baf0781 273 if (drop || recover) {
63c52d78 274 ClearPageUptodate(page);
2baf0781
CY
275 clear_cold_data(page);
276 }
240a5915 277 f2fs_clear_page_private(page);
28bc106b 278 f2fs_put_page(page, 1);
29b96b54
CY
279
280 list_del(&cur->list);
281 kmem_cache_free(inmem_entry_slab, cur);
282 dec_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES);
283 }
28bc106b 284 return err;
29b96b54
CY
285}
286
4d57b86d 287void f2fs_drop_inmem_pages_all(struct f2fs_sb_info *sbi, bool gc_failure)
57864ae5
JK
288{
289 struct list_head *head = &sbi->inode_list[ATOMIC_FILE];
290 struct inode *inode;
291 struct f2fs_inode_info *fi;
677017d1
ST
292 unsigned int count = sbi->atomic_files;
293 unsigned int looped = 0;
57864ae5
JK
294next:
295 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
296 if (list_empty(head)) {
297 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
298 return;
299 }
300 fi = list_first_entry(head, struct f2fs_inode_info, inmem_ilist);
301 inode = igrab(&fi->vfs_inode);
677017d1
ST
302 if (inode)
303 list_move_tail(&fi->inmem_ilist, head);
57864ae5
JK
304 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
305
306 if (inode) {
2ef79ecb 307 if (gc_failure) {
677017d1
ST
308 if (!fi->i_gc_failures[GC_FAILURE_ATOMIC])
309 goto skip;
2ef79ecb 310 }
2ef79ecb 311 set_inode_flag(inode, FI_ATOMIC_REVOKE_REQUEST);
4d57b86d 312 f2fs_drop_inmem_pages(inode);
677017d1 313skip:
57864ae5
JK
314 iput(inode);
315 }
5df7731f 316 congestion_wait(BLK_RW_ASYNC, DEFAULT_IO_TIMEOUT);
57864ae5 317 cond_resched();
677017d1
ST
318 if (gc_failure) {
319 if (++looped >= count)
320 return;
321 }
57864ae5
JK
322 goto next;
323}
324
4d57b86d 325void f2fs_drop_inmem_pages(struct inode *inode)
29b96b54 326{
57864ae5 327 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
29b96b54
CY
328 struct f2fs_inode_info *fi = F2FS_I(inode);
329
48432984
CY
330 while (!list_empty(&fi->inmem_pages)) {
331 mutex_lock(&fi->inmem_lock);
332 __revoke_inmem_pages(inode, &fi->inmem_pages,
333 true, false, true);
48432984
CY
334 mutex_unlock(&fi->inmem_lock);
335 }
5fe45743 336
2ef79ecb 337 fi->i_gc_failures[GC_FAILURE_ATOMIC] = 0;
743b620c
JK
338
339 spin_lock(&sbi->inode_lock[ATOMIC_FILE]);
340 if (!list_empty(&fi->inmem_ilist))
341 list_del_init(&fi->inmem_ilist);
677017d1
ST
342 if (f2fs_is_atomic_file(inode)) {
343 clear_inode_flag(inode, FI_ATOMIC_FILE);
344 sbi->atomic_files--;
345 }
743b620c 346 spin_unlock(&sbi->inode_lock[ATOMIC_FILE]);
29b96b54
CY
347}
348
4d57b86d 349void f2fs_drop_inmem_page(struct inode *inode, struct page *page)
8c242db9
JK
350{
351 struct f2fs_inode_info *fi = F2FS_I(inode);
352 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
353 struct list_head *head = &fi->inmem_pages;
354 struct inmem_pages *cur = NULL;
355
356 f2fs_bug_on(sbi, !IS_ATOMIC_WRITTEN_PAGE(page));
357
358 mutex_lock(&fi->inmem_lock);
359 list_for_each_entry(cur, head, list) {
360 if (cur->page == page)
361 break;
362 }
363
d0891e84 364 f2fs_bug_on(sbi, list_empty(head) || cur->page != page);
8c242db9
JK
365 list_del(&cur->list);
366 mutex_unlock(&fi->inmem_lock);
367
368 dec_page_count(sbi, F2FS_INMEM_PAGES);
369 kmem_cache_free(inmem_entry_slab, cur);
370
371 ClearPageUptodate(page);
240a5915 372 f2fs_clear_page_private(page);
8c242db9
JK
373 f2fs_put_page(page, 0);
374
375 trace_f2fs_commit_inmem_page(page, INMEM_INVALIDATE);
376}
377
4d57b86d 378static int __f2fs_commit_inmem_pages(struct inode *inode)
88b88a66
JK
379{
380 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
381 struct f2fs_inode_info *fi = F2FS_I(inode);
382 struct inmem_pages *cur, *tmp;
88b88a66 383 struct f2fs_io_info fio = {
05ca3632 384 .sbi = sbi,
39d787be 385 .ino = inode->i_ino,
88b88a66 386 .type = DATA,
04d328de 387 .op = REQ_OP_WRITE,
70fd7614 388 .op_flags = REQ_SYNC | REQ_PRIO,
b0af6d49 389 .io_type = FS_DATA_IO,
88b88a66 390 };
cf52b27a 391 struct list_head revoke_list;
bab475c5 392 bool submit_bio = false;
edb27dee 393 int err = 0;
88b88a66 394
cf52b27a
CY
395 INIT_LIST_HEAD(&revoke_list);
396
88b88a66 397 list_for_each_entry_safe(cur, tmp, &fi->inmem_pages, list) {
28bc106b
CY
398 struct page *page = cur->page;
399
400 lock_page(page);
401 if (page->mapping == inode->i_mapping) {
402 trace_f2fs_commit_inmem_page(page, INMEM);
403
bae0ee7a 404 f2fs_wait_on_page_writeback(page, DATA, true, true);
8d64d365
CY
405
406 set_page_dirty(page);
933439c8 407 if (clear_page_dirty_for_io(page)) {
29b96b54 408 inode_dec_dirty_pages(inode);
4d57b86d 409 f2fs_remove_dirty_inode(inode);
933439c8 410 }
640cc189 411retry:
28bc106b 412 fio.page = page;
e959c8f5 413 fio.old_blkaddr = NULL_ADDR;
4d978078 414 fio.encrypted_page = NULL;
cc15620b 415 fio.need_lock = LOCK_DONE;
4d57b86d 416 err = f2fs_do_write_data_page(&fio);
29b96b54 417 if (err) {
640cc189 418 if (err == -ENOMEM) {
5df7731f
CY
419 congestion_wait(BLK_RW_ASYNC,
420 DEFAULT_IO_TIMEOUT);
640cc189
JK
421 cond_resched();
422 goto retry;
423 }
28bc106b 424 unlock_page(page);
29b96b54 425 break;
70c640b1 426 }
28bc106b
CY
427 /* record old blkaddr for revoking */
428 cur->old_addr = fio.old_blkaddr;
bab475c5 429 submit_bio = true;
28bc106b
CY
430 }
431 unlock_page(page);
cf52b27a 432 list_move_tail(&cur->list, &revoke_list);
88b88a66 433 }
29b96b54 434
bab475c5
CY
435 if (submit_bio)
436 f2fs_submit_merged_write_cond(sbi, inode, NULL, 0, DATA);
28bc106b 437
cf52b27a
CY
438 if (err) {
439 /*
440 * try to revoke all committed pages, but still we could fail
441 * due to no memory or other reason, if that happened, EAGAIN
442 * will be returned, which means in such case, transaction is
443 * already not integrity, caller should use journal to do the
444 * recovery or rewrite & commit last transaction. For other
445 * error number, revoking was done by filesystem itself.
446 */
48432984
CY
447 err = __revoke_inmem_pages(inode, &revoke_list,
448 false, true, false);
cf52b27a
CY
449
450 /* drop all uncommitted pages */
48432984
CY
451 __revoke_inmem_pages(inode, &fi->inmem_pages,
452 true, false, false);
cf52b27a 453 } else {
48432984
CY
454 __revoke_inmem_pages(inode, &revoke_list,
455 false, false, false);
cf52b27a 456 }
28bc106b 457
29b96b54
CY
458 return err;
459}
460
4d57b86d 461int f2fs_commit_inmem_pages(struct inode *inode)
29b96b54
CY
462{
463 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
464 struct f2fs_inode_info *fi = F2FS_I(inode);
28bc106b 465 int err;
29b96b54
CY
466
467 f2fs_balance_fs(sbi, true);
29b96b54 468
6f8d4455
JK
469 down_write(&fi->i_gc_rwsem[WRITE]);
470
471 f2fs_lock_op(sbi);
5fe45743
CY
472 set_inode_flag(inode, FI_ATOMIC_COMMIT);
473
29b96b54 474 mutex_lock(&fi->inmem_lock);
4d57b86d 475 err = __f2fs_commit_inmem_pages(inode);
88b88a66
JK
476 mutex_unlock(&fi->inmem_lock);
477
5fe45743
CY
478 clear_inode_flag(inode, FI_ATOMIC_COMMIT);
479
29b96b54 480 f2fs_unlock_op(sbi);
6f8d4455
JK
481 up_write(&fi->i_gc_rwsem[WRITE]);
482
edb27dee 483 return err;
88b88a66
JK
484}
485
0a8165d7 486/*
351df4b2
JK
487 * This function balances dirty node and dentry pages.
488 * In addition, it controls garbage collection.
489 */
2c4db1a6 490void f2fs_balance_fs(struct f2fs_sb_info *sbi, bool need)
351df4b2 491{
55523519 492 if (time_to_inject(sbi, FAULT_CHECKPOINT)) {
c45d6002 493 f2fs_show_injection_info(sbi, FAULT_CHECKPOINT);
0f348028 494 f2fs_stop_checkpoint(sbi, false);
55523519 495 }
0f348028 496
e589c2c4 497 /* balance_fs_bg is able to be pending */
a7881893 498 if (need && excess_cached_nats(sbi))
7bcd0cfa 499 f2fs_balance_fs_bg(sbi, false);
e589c2c4 500
00e09c0b 501 if (!f2fs_is_checkpoint_ready(sbi))
4354994f
DR
502 return;
503
351df4b2 504 /*
029cd28c
JK
505 * We should do GC or end up with checkpoint, if there are so many dirty
506 * dir/node pages without enough free segments.
351df4b2 507 */
7f3037a5 508 if (has_not_enough_free_secs(sbi, 0, 0)) {
fb24fea7 509 down_write(&sbi->gc_lock);
e066b83c 510 f2fs_gc(sbi, false, false, NULL_SEGNO);
351df4b2
JK
511 }
512}
513
7bcd0cfa 514void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi, bool from_bg)
4660f9c0 515{
64c74a7a
CY
516 if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
517 return;
518
1dcc336b 519 /* try to shrink extent cache when there is no enough memory */
4d57b86d 520 if (!f2fs_available_free_memory(sbi, EXTENT_CACHE))
554df79e 521 f2fs_shrink_extent_tree(sbi, EXTENT_CACHE_SHRINK_NUMBER);
1dcc336b 522
1b38dc8e 523 /* check the # of cached NAT entries */
4d57b86d
CY
524 if (!f2fs_available_free_memory(sbi, NAT_ENTRIES))
525 f2fs_try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK);
1b38dc8e 526
4d57b86d
CY
527 if (!f2fs_available_free_memory(sbi, FREE_NIDS))
528 f2fs_try_to_free_nids(sbi, MAX_FREE_NIDS);
ad4edb83 529 else
4d57b86d 530 f2fs_build_free_nids(sbi, false, false);
31696580 531
a7d10cf3 532 if (!is_idle(sbi, REQ_TIME) &&
fd8c8caf 533 (!excess_dirty_nats(sbi) && !excess_dirty_nodes(sbi)))
f455c8a5 534 return;
31696580 535
1b38dc8e 536 /* checkpoint is the only way to shrink partial cached entries */
4d57b86d
CY
537 if (!f2fs_available_free_memory(sbi, NAT_ENTRIES) ||
538 !f2fs_available_free_memory(sbi, INO_ENTRIES) ||
7d768d2c
CY
539 excess_prefree_segs(sbi) ||
540 excess_dirty_nats(sbi) ||
fd8c8caf 541 excess_dirty_nodes(sbi) ||
f455c8a5 542 f2fs_time_over(sbi, CP_TIME)) {
7bcd0cfa 543 if (test_opt(sbi, DATA_FLUSH) && from_bg) {
e9f5b8b8
CY
544 struct blk_plug plug;
545
040d2bb3
CY
546 mutex_lock(&sbi->flush_lock);
547
e9f5b8b8 548 blk_start_plug(&plug);
4d57b86d 549 f2fs_sync_dirty_inodes(sbi, FILE_INODE);
e9f5b8b8 550 blk_finish_plug(&plug);
040d2bb3
CY
551
552 mutex_unlock(&sbi->flush_lock);
e9f5b8b8 553 }
4660f9c0 554 f2fs_sync_fs(sbi->sb, true);
42190d2a 555 stat_inc_bg_cp_count(sbi->stat_info);
36b35a0d 556 }
4660f9c0
JK
557}
558
20fda56b
KM
559static int __submit_flush_wait(struct f2fs_sb_info *sbi,
560 struct block_device *bdev)
3c62be17 561{
dc37910d 562 struct bio *bio;
3c62be17
JK
563 int ret;
564
dc37910d
CY
565 bio = f2fs_bio_alloc(sbi, 0, false);
566 if (!bio)
567 return -ENOMEM;
568
3adc5fcb 569 bio->bi_opf = REQ_OP_WRITE | REQ_SYNC | REQ_PREFLUSH;
74d46992 570 bio_set_dev(bio, bdev);
3c62be17
JK
571 ret = submit_bio_wait(bio);
572 bio_put(bio);
20fda56b
KM
573
574 trace_f2fs_issue_flush(bdev, test_opt(sbi, NOBARRIER),
575 test_opt(sbi, FLUSH_MERGE), ret);
3c62be17
JK
576 return ret;
577}
578
39d787be 579static int submit_flush_wait(struct f2fs_sb_info *sbi, nid_t ino)
3c62be17 580{
39d787be 581 int ret = 0;
3c62be17
JK
582 int i;
583
0916878d 584 if (!f2fs_is_multi_device(sbi))
39d787be 585 return __submit_flush_wait(sbi, sbi->sb->s_bdev);
20fda56b 586
39d787be 587 for (i = 0; i < sbi->s_ndevs; i++) {
4d57b86d 588 if (!f2fs_is_dirty_device(sbi, ino, i, FLUSH_INO))
39d787be 589 continue;
20fda56b
KM
590 ret = __submit_flush_wait(sbi, FDEV(i).bdev);
591 if (ret)
592 break;
3c62be17
JK
593 }
594 return ret;
595}
596
2163d198 597static int issue_flush_thread(void *data)
6b4afdd7
JK
598{
599 struct f2fs_sb_info *sbi = data;
b01a9201 600 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
a688b9d9 601 wait_queue_head_t *q = &fcc->flush_wait_queue;
6b4afdd7
JK
602repeat:
603 if (kthread_should_stop())
604 return 0;
605
dc6febb6
CY
606 sb_start_intwrite(sbi->sb);
607
721bd4d5 608 if (!llist_empty(&fcc->issue_list)) {
6b4afdd7
JK
609 struct flush_cmd *cmd, *next;
610 int ret;
611
721bd4d5
GZ
612 fcc->dispatch_list = llist_del_all(&fcc->issue_list);
613 fcc->dispatch_list = llist_reverse_order(fcc->dispatch_list);
614
39d787be
CY
615 cmd = llist_entry(fcc->dispatch_list, struct flush_cmd, llnode);
616
617 ret = submit_flush_wait(sbi, cmd->ino);
8b8dd65f
CY
618 atomic_inc(&fcc->issued_flush);
619
721bd4d5
GZ
620 llist_for_each_entry_safe(cmd, next,
621 fcc->dispatch_list, llnode) {
6b4afdd7 622 cmd->ret = ret;
6b4afdd7
JK
623 complete(&cmd->wait);
624 }
a688b9d9 625 fcc->dispatch_list = NULL;
6b4afdd7
JK
626 }
627
dc6febb6
CY
628 sb_end_intwrite(sbi->sb);
629
a688b9d9 630 wait_event_interruptible(*q,
721bd4d5 631 kthread_should_stop() || !llist_empty(&fcc->issue_list));
6b4afdd7
JK
632 goto repeat;
633}
634
39d787be 635int f2fs_issue_flush(struct f2fs_sb_info *sbi, nid_t ino)
6b4afdd7 636{
b01a9201 637 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
adf8d90b 638 struct flush_cmd cmd;
8b8dd65f 639 int ret;
6b4afdd7 640
0f7b2abd
JK
641 if (test_opt(sbi, NOBARRIER))
642 return 0;
643
8b8dd65f 644 if (!test_opt(sbi, FLUSH_MERGE)) {
72691af6 645 atomic_inc(&fcc->queued_flush);
39d787be 646 ret = submit_flush_wait(sbi, ino);
72691af6 647 atomic_dec(&fcc->queued_flush);
8b8dd65f
CY
648 atomic_inc(&fcc->issued_flush);
649 return ret;
650 }
740432f8 651
0916878d
DLM
652 if (atomic_inc_return(&fcc->queued_flush) == 1 ||
653 f2fs_is_multi_device(sbi)) {
39d787be 654 ret = submit_flush_wait(sbi, ino);
72691af6 655 atomic_dec(&fcc->queued_flush);
8b8dd65f
CY
656
657 atomic_inc(&fcc->issued_flush);
740432f8
JK
658 return ret;
659 }
6b4afdd7 660
39d787be 661 cmd.ino = ino;
adf8d90b 662 init_completion(&cmd.wait);
6b4afdd7 663
721bd4d5 664 llist_add(&cmd.llnode, &fcc->issue_list);
6b4afdd7 665
6f890df0
CY
666 /* update issue_list before we wake up issue_flush thread */
667 smp_mb();
668
669 if (waitqueue_active(&fcc->flush_wait_queue))
a688b9d9 670 wake_up(&fcc->flush_wait_queue);
6b4afdd7 671
5eba8c5d
JK
672 if (fcc->f2fs_issue_flush) {
673 wait_for_completion(&cmd.wait);
72691af6 674 atomic_dec(&fcc->queued_flush);
5eba8c5d 675 } else {
d3238691
CY
676 struct llist_node *list;
677
678 list = llist_del_all(&fcc->issue_list);
679 if (!list) {
680 wait_for_completion(&cmd.wait);
72691af6 681 atomic_dec(&fcc->queued_flush);
d3238691
CY
682 } else {
683 struct flush_cmd *tmp, *next;
684
39d787be 685 ret = submit_flush_wait(sbi, ino);
d3238691
CY
686
687 llist_for_each_entry_safe(tmp, next, list, llnode) {
688 if (tmp == &cmd) {
689 cmd.ret = ret;
72691af6 690 atomic_dec(&fcc->queued_flush);
d3238691
CY
691 continue;
692 }
693 tmp->ret = ret;
694 complete(&tmp->wait);
695 }
696 }
5eba8c5d 697 }
adf8d90b
CY
698
699 return cmd.ret;
6b4afdd7
JK
700}
701
4d57b86d 702int f2fs_create_flush_cmd_control(struct f2fs_sb_info *sbi)
2163d198
GZ
703{
704 dev_t dev = sbi->sb->s_bdev->bd_dev;
705 struct flush_cmd_control *fcc;
706 int err = 0;
707
b01a9201
JK
708 if (SM_I(sbi)->fcc_info) {
709 fcc = SM_I(sbi)->fcc_info;
d871cd04
YS
710 if (fcc->f2fs_issue_flush)
711 return err;
5eba8c5d
JK
712 goto init_thread;
713 }
714
acbf054d 715 fcc = f2fs_kzalloc(sbi, sizeof(struct flush_cmd_control), GFP_KERNEL);
2163d198
GZ
716 if (!fcc)
717 return -ENOMEM;
8b8dd65f 718 atomic_set(&fcc->issued_flush, 0);
72691af6 719 atomic_set(&fcc->queued_flush, 0);
2163d198 720 init_waitqueue_head(&fcc->flush_wait_queue);
721bd4d5 721 init_llist_head(&fcc->issue_list);
b01a9201 722 SM_I(sbi)->fcc_info = fcc;
d4fdf8ba
YH
723 if (!test_opt(sbi, FLUSH_MERGE))
724 return err;
725
5eba8c5d 726init_thread:
2163d198
GZ
727 fcc->f2fs_issue_flush = kthread_run(issue_flush_thread, sbi,
728 "f2fs_flush-%u:%u", MAJOR(dev), MINOR(dev));
729 if (IS_ERR(fcc->f2fs_issue_flush)) {
730 err = PTR_ERR(fcc->f2fs_issue_flush);
c8eb7024 731 kfree(fcc);
b01a9201 732 SM_I(sbi)->fcc_info = NULL;
2163d198
GZ
733 return err;
734 }
2163d198
GZ
735
736 return err;
737}
738
4d57b86d 739void f2fs_destroy_flush_cmd_control(struct f2fs_sb_info *sbi, bool free)
2163d198 740{
b01a9201 741 struct flush_cmd_control *fcc = SM_I(sbi)->fcc_info;
2163d198 742
5eba8c5d
JK
743 if (fcc && fcc->f2fs_issue_flush) {
744 struct task_struct *flush_thread = fcc->f2fs_issue_flush;
745
746 fcc->f2fs_issue_flush = NULL;
747 kthread_stop(flush_thread);
748 }
749 if (free) {
c8eb7024 750 kfree(fcc);
b01a9201 751 SM_I(sbi)->fcc_info = NULL;
5eba8c5d 752 }
2163d198
GZ
753}
754
1228b482
CY
755int f2fs_flush_device_cache(struct f2fs_sb_info *sbi)
756{
757 int ret = 0, i;
758
0916878d 759 if (!f2fs_is_multi_device(sbi))
1228b482
CY
760 return 0;
761
6ed29fe1
CY
762 if (test_opt(sbi, NOBARRIER))
763 return 0;
764
1228b482
CY
765 for (i = 1; i < sbi->s_ndevs; i++) {
766 if (!f2fs_test_bit(i, (char *)&sbi->dirty_device))
767 continue;
768 ret = __submit_flush_wait(sbi, FDEV(i).bdev);
769 if (ret)
770 break;
771
772 spin_lock(&sbi->dev_lock);
773 f2fs_clear_bit(i, (char *)&sbi->dirty_device);
774 spin_unlock(&sbi->dev_lock);
775 }
776
777 return ret;
778}
779
351df4b2
JK
780static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
781 enum dirty_type dirty_type)
782{
783 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
784
785 /* need not be added */
786 if (IS_CURSEG(sbi, segno))
787 return;
788
789 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type]))
790 dirty_i->nr_dirty[dirty_type]++;
791
792 if (dirty_type == DIRTY) {
793 struct seg_entry *sentry = get_seg_entry(sbi, segno);
4625d6aa 794 enum dirty_type t = sentry->type;
b2f2c390 795
ec325b52
JK
796 if (unlikely(t >= DIRTY)) {
797 f2fs_bug_on(sbi, 1);
798 return;
799 }
4625d6aa
CL
800 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t]))
801 dirty_i->nr_dirty[t]++;
da52f8ad
JQ
802
803 if (__is_large_section(sbi)) {
804 unsigned int secno = GET_SEC_FROM_SEG(sbi, segno);
123aaf77 805 block_t valid_blocks =
da52f8ad
JQ
806 get_valid_blocks(sbi, segno, true);
807
808 f2fs_bug_on(sbi, unlikely(!valid_blocks ||
809 valid_blocks == BLKS_PER_SEC(sbi)));
810
811 if (!IS_CURSEC(sbi, secno))
812 set_bit(secno, dirty_i->dirty_secmap);
813 }
351df4b2
JK
814 }
815}
816
817static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
818 enum dirty_type dirty_type)
819{
820 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
123aaf77 821 block_t valid_blocks;
351df4b2
JK
822
823 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type]))
824 dirty_i->nr_dirty[dirty_type]--;
825
826 if (dirty_type == DIRTY) {
4625d6aa
CL
827 struct seg_entry *sentry = get_seg_entry(sbi, segno);
828 enum dirty_type t = sentry->type;
829
830 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t]))
831 dirty_i->nr_dirty[t]--;
b2f2c390 832
da52f8ad
JQ
833 valid_blocks = get_valid_blocks(sbi, segno, true);
834 if (valid_blocks == 0) {
4ddb1a4d 835 clear_bit(GET_SEC_FROM_SEG(sbi, segno),
5ec4e49f 836 dirty_i->victim_secmap);
bbf9f7d9
ST
837#ifdef CONFIG_F2FS_CHECK_FS
838 clear_bit(segno, SIT_I(sbi)->invalid_segmap);
839#endif
840 }
da52f8ad
JQ
841 if (__is_large_section(sbi)) {
842 unsigned int secno = GET_SEC_FROM_SEG(sbi, segno);
843
844 if (!valid_blocks ||
845 valid_blocks == BLKS_PER_SEC(sbi)) {
846 clear_bit(secno, dirty_i->dirty_secmap);
847 return;
848 }
849
850 if (!IS_CURSEC(sbi, secno))
851 set_bit(secno, dirty_i->dirty_secmap);
852 }
351df4b2
JK
853 }
854}
855
0a8165d7 856/*
351df4b2
JK
857 * Should not occur error such as -ENOMEM.
858 * Adding dirty entry into seglist is not critical operation.
859 * If a given segment is one of current working segments, it won't be added.
860 */
8d8451af 861static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK
862{
863 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4354994f 864 unsigned short valid_blocks, ckpt_valid_blocks;
de881df9 865 unsigned int usable_blocks;
351df4b2
JK
866
867 if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno))
868 return;
869
de881df9 870 usable_blocks = f2fs_usable_blks_in_seg(sbi, segno);
351df4b2
JK
871 mutex_lock(&dirty_i->seglist_lock);
872
302bd348 873 valid_blocks = get_valid_blocks(sbi, segno, false);
4354994f 874 ckpt_valid_blocks = get_ckpt_valid_blocks(sbi, segno);
351df4b2 875
4354994f 876 if (valid_blocks == 0 && (!is_sbi_flag_set(sbi, SBI_CP_DISABLED) ||
de881df9 877 ckpt_valid_blocks == usable_blocks)) {
351df4b2
JK
878 __locate_dirty_segment(sbi, segno, PRE);
879 __remove_dirty_segment(sbi, segno, DIRTY);
de881df9 880 } else if (valid_blocks < usable_blocks) {
351df4b2
JK
881 __locate_dirty_segment(sbi, segno, DIRTY);
882 } else {
883 /* Recovery routine with SSR needs this */
884 __remove_dirty_segment(sbi, segno, DIRTY);
885 }
886
887 mutex_unlock(&dirty_i->seglist_lock);
351df4b2
JK
888}
889
4354994f
DR
890/* This moves currently empty dirty blocks to prefree. Must hold seglist_lock */
891void f2fs_dirty_to_prefree(struct f2fs_sb_info *sbi)
892{
893 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
894 unsigned int segno;
895
896 mutex_lock(&dirty_i->seglist_lock);
897 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
898 if (get_valid_blocks(sbi, segno, false))
899 continue;
900 if (IS_CURSEG(sbi, segno))
901 continue;
902 __locate_dirty_segment(sbi, segno, PRE);
903 __remove_dirty_segment(sbi, segno, DIRTY);
904 }
905 mutex_unlock(&dirty_i->seglist_lock);
906}
907
4d3aed70 908block_t f2fs_get_unusable_blocks(struct f2fs_sb_info *sbi)
4354994f 909{
ae4ad7ea
DR
910 int ovp_hole_segs =
911 (overprovision_segments(sbi) - reserved_segments(sbi));
912 block_t ovp_holes = ovp_hole_segs << sbi->log_blocks_per_seg;
4d3aed70 913 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4354994f 914 block_t holes[2] = {0, 0}; /* DATA and NODE */
4d3aed70 915 block_t unusable;
4354994f
DR
916 struct seg_entry *se;
917 unsigned int segno;
918
919 mutex_lock(&dirty_i->seglist_lock);
920 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
921 se = get_seg_entry(sbi, segno);
922 if (IS_NODESEG(se->type))
de881df9
AR
923 holes[NODE] += f2fs_usable_blks_in_seg(sbi, segno) -
924 se->valid_blocks;
4354994f 925 else
de881df9
AR
926 holes[DATA] += f2fs_usable_blks_in_seg(sbi, segno) -
927 se->valid_blocks;
4354994f
DR
928 }
929 mutex_unlock(&dirty_i->seglist_lock);
930
4d3aed70
DR
931 unusable = holes[DATA] > holes[NODE] ? holes[DATA] : holes[NODE];
932 if (unusable > ovp_holes)
933 return unusable - ovp_holes;
934 return 0;
935}
936
937int f2fs_disable_cp_again(struct f2fs_sb_info *sbi, block_t unusable)
938{
939 int ovp_hole_segs =
940 (overprovision_segments(sbi) - reserved_segments(sbi));
941 if (unusable > F2FS_OPTION(sbi).unusable_cap)
4354994f 942 return -EAGAIN;
db610a64 943 if (is_sbi_flag_set(sbi, SBI_CP_DISABLED_QUICK) &&
ae4ad7ea 944 dirty_segments(sbi) > ovp_hole_segs)
db610a64 945 return -EAGAIN;
4354994f
DR
946 return 0;
947}
948
949/* This is only used by SBI_CP_DISABLED */
950static unsigned int get_free_segment(struct f2fs_sb_info *sbi)
951{
952 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
953 unsigned int segno = 0;
954
955 mutex_lock(&dirty_i->seglist_lock);
956 for_each_set_bit(segno, dirty_i->dirty_segmap[DIRTY], MAIN_SEGS(sbi)) {
957 if (get_valid_blocks(sbi, segno, false))
958 continue;
959 if (get_ckpt_valid_blocks(sbi, segno))
960 continue;
961 mutex_unlock(&dirty_i->seglist_lock);
962 return segno;
963 }
964 mutex_unlock(&dirty_i->seglist_lock);
965 return NULL_SEGNO;
966}
967
004b6862 968static struct discard_cmd *__create_discard_cmd(struct f2fs_sb_info *sbi,
c81abe34
JK
969 struct block_device *bdev, block_t lstart,
970 block_t start, block_t len)
275b66b0 971{
0b54fb84 972 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
ba48a33e 973 struct list_head *pend_list;
b01a9201 974 struct discard_cmd *dc;
275b66b0 975
ba48a33e
CY
976 f2fs_bug_on(sbi, !len);
977
978 pend_list = &dcc->pend_list[plist_idx(len)];
979
b01a9201
JK
980 dc = f2fs_kmem_cache_alloc(discard_cmd_slab, GFP_NOFS);
981 INIT_LIST_HEAD(&dc->list);
c81abe34 982 dc->bdev = bdev;
b01a9201 983 dc->lstart = lstart;
c81abe34 984 dc->start = start;
b01a9201 985 dc->len = len;
ec9895ad 986 dc->ref = 0;
15469963 987 dc->state = D_PREP;
72691af6 988 dc->queued = 0;
c81abe34 989 dc->error = 0;
b01a9201 990 init_completion(&dc->wait);
22d375dd 991 list_add_tail(&dc->list, pend_list);
35ec7d57
CY
992 spin_lock_init(&dc->lock);
993 dc->bio_ref = 0;
5f32366a 994 atomic_inc(&dcc->discard_cmd_cnt);
d84d1cbd 995 dcc->undiscard_blks += len;
004b6862
CY
996
997 return dc;
998}
999
1000static struct discard_cmd *__attach_discard_cmd(struct f2fs_sb_info *sbi,
1001 struct block_device *bdev, block_t lstart,
1002 block_t start, block_t len,
4dada3fd
CY
1003 struct rb_node *parent, struct rb_node **p,
1004 bool leftmost)
004b6862
CY
1005{
1006 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1007 struct discard_cmd *dc;
1008
1009 dc = __create_discard_cmd(sbi, bdev, lstart, start, len);
1010
1011 rb_link_node(&dc->rb_node, parent, p);
4dada3fd 1012 rb_insert_color_cached(&dc->rb_node, &dcc->root, leftmost);
004b6862
CY
1013
1014 return dc;
15469963
JK
1015}
1016
004b6862
CY
1017static void __detach_discard_cmd(struct discard_cmd_control *dcc,
1018 struct discard_cmd *dc)
15469963 1019{
dcc9165d 1020 if (dc->state == D_DONE)
72691af6 1021 atomic_sub(dc->queued, &dcc->queued_discard);
004b6862
CY
1022
1023 list_del(&dc->list);
4dada3fd 1024 rb_erase_cached(&dc->rb_node, &dcc->root);
d84d1cbd 1025 dcc->undiscard_blks -= dc->len;
004b6862
CY
1026
1027 kmem_cache_free(discard_cmd_slab, dc);
1028
1029 atomic_dec(&dcc->discard_cmd_cnt);
1030}
1031
1032static void __remove_discard_cmd(struct f2fs_sb_info *sbi,
1033 struct discard_cmd *dc)
1034{
1035 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
35ec7d57 1036 unsigned long flags;
dcc9165d 1037
2ec6f2ef
CY
1038 trace_f2fs_remove_discard(dc->bdev, dc->start, dc->len);
1039
35ec7d57
CY
1040 spin_lock_irqsave(&dc->lock, flags);
1041 if (dc->bio_ref) {
1042 spin_unlock_irqrestore(&dc->lock, flags);
1043 return;
1044 }
1045 spin_unlock_irqrestore(&dc->lock, flags);
1046
d9703d90
CY
1047 f2fs_bug_on(sbi, dc->ref);
1048
c81abe34
JK
1049 if (dc->error == -EOPNOTSUPP)
1050 dc->error = 0;
15469963 1051
c81abe34 1052 if (dc->error)
22d7ea13 1053 printk_ratelimited(
c45d6002
CY
1054 "%sF2FS-fs (%s): Issue discard(%u, %u, %u) failed, ret: %d",
1055 KERN_INFO, sbi->sb->s_id,
1056 dc->lstart, dc->start, dc->len, dc->error);
004b6862 1057 __detach_discard_cmd(dcc, dc);
275b66b0
CY
1058}
1059
c81abe34
JK
1060static void f2fs_submit_discard_endio(struct bio *bio)
1061{
1062 struct discard_cmd *dc = (struct discard_cmd *)bio->bi_private;
35ec7d57 1063 unsigned long flags;
c81abe34 1064
35ec7d57 1065 spin_lock_irqsave(&dc->lock, flags);
3fa6a8c5
ST
1066 if (!dc->error)
1067 dc->error = blk_status_to_errno(bio->bi_status);
35ec7d57
CY
1068 dc->bio_ref--;
1069 if (!dc->bio_ref && dc->state == D_SUBMIT) {
1070 dc->state = D_DONE;
1071 complete_all(&dc->wait);
1072 }
1073 spin_unlock_irqrestore(&dc->lock, flags);
c81abe34
JK
1074 bio_put(bio);
1075}
1076
94b1e10e 1077static void __check_sit_bitmap(struct f2fs_sb_info *sbi,
6915ea9d
CY
1078 block_t start, block_t end)
1079{
1080#ifdef CONFIG_F2FS_CHECK_FS
1081 struct seg_entry *sentry;
1082 unsigned int segno;
1083 block_t blk = start;
1084 unsigned long offset, size, max_blocks = sbi->blocks_per_seg;
1085 unsigned long *map;
1086
1087 while (blk < end) {
1088 segno = GET_SEGNO(sbi, blk);
1089 sentry = get_seg_entry(sbi, segno);
1090 offset = GET_BLKOFF_FROM_SEG0(sbi, blk);
1091
008396e1
YS
1092 if (end < START_BLOCK(sbi, segno + 1))
1093 size = GET_BLKOFF_FROM_SEG0(sbi, end);
1094 else
1095 size = max_blocks;
6915ea9d
CY
1096 map = (unsigned long *)(sentry->cur_valid_map);
1097 offset = __find_rev_next_bit(map, size, offset);
1098 f2fs_bug_on(sbi, offset != size);
008396e1 1099 blk = START_BLOCK(sbi, segno + 1);
6915ea9d
CY
1100 }
1101#endif
1102}
1103
8bb4f253
JK
1104static void __init_discard_policy(struct f2fs_sb_info *sbi,
1105 struct discard_policy *dpolicy,
1106 int discard_type, unsigned int granularity)
1107{
1108 /* common policy */
1109 dpolicy->type = discard_type;
1110 dpolicy->sync = true;
20ee4382 1111 dpolicy->ordered = false;
8bb4f253
JK
1112 dpolicy->granularity = granularity;
1113
1114 dpolicy->max_requests = DEF_MAX_DISCARD_REQUEST;
1115 dpolicy->io_aware_gran = MAX_PLIST_NUM;
6ce48b0c 1116 dpolicy->timeout = false;
8bb4f253
JK
1117
1118 if (discard_type == DPOLICY_BG) {
1119 dpolicy->min_interval = DEF_MIN_DISCARD_ISSUE_TIME;
f9d1dced 1120 dpolicy->mid_interval = DEF_MID_DISCARD_ISSUE_TIME;
8bb4f253
JK
1121 dpolicy->max_interval = DEF_MAX_DISCARD_ISSUE_TIME;
1122 dpolicy->io_aware = true;
cba60849 1123 dpolicy->sync = false;
20ee4382 1124 dpolicy->ordered = true;
8bb4f253
JK
1125 if (utilization(sbi) > DEF_DISCARD_URGENT_UTIL) {
1126 dpolicy->granularity = 1;
1127 dpolicy->max_interval = DEF_MIN_DISCARD_ISSUE_TIME;
1128 }
1129 } else if (discard_type == DPOLICY_FORCE) {
1130 dpolicy->min_interval = DEF_MIN_DISCARD_ISSUE_TIME;
f9d1dced 1131 dpolicy->mid_interval = DEF_MID_DISCARD_ISSUE_TIME;
8bb4f253
JK
1132 dpolicy->max_interval = DEF_MAX_DISCARD_ISSUE_TIME;
1133 dpolicy->io_aware = false;
1134 } else if (discard_type == DPOLICY_FSTRIM) {
1135 dpolicy->io_aware = false;
1136 } else if (discard_type == DPOLICY_UMOUNT) {
1137 dpolicy->io_aware = false;
b8623253
JK
1138 /* we need to issue all to keep CP_TRIMMED_FLAG */
1139 dpolicy->granularity = 1;
6ce48b0c 1140 dpolicy->timeout = true;
8bb4f253
JK
1141 }
1142}
1143
35ec7d57
CY
1144static void __update_discard_tree_range(struct f2fs_sb_info *sbi,
1145 struct block_device *bdev, block_t lstart,
1146 block_t start, block_t len);
c81abe34 1147/* this function is copied from blkdev_issue_discard from block/blk-lib.c */
6b9cb124 1148static int __submit_discard_cmd(struct f2fs_sb_info *sbi,
78997b56 1149 struct discard_policy *dpolicy,
35ec7d57
CY
1150 struct discard_cmd *dc,
1151 unsigned int *issued)
c81abe34 1152{
35ec7d57
CY
1153 struct block_device *bdev = dc->bdev;
1154 struct request_queue *q = bdev_get_queue(bdev);
1155 unsigned int max_discard_blocks =
1156 SECTOR_TO_BLOCK(q->limits.max_discard_sectors);
c81abe34 1157 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
78997b56
CY
1158 struct list_head *wait_list = (dpolicy->type == DPOLICY_FSTRIM) ?
1159 &(dcc->fstrim_list) : &(dcc->wait_list);
78997b56 1160 int flag = dpolicy->sync ? REQ_SYNC : 0;
35ec7d57
CY
1161 block_t lstart, start, len, total_len;
1162 int err = 0;
c81abe34
JK
1163
1164 if (dc->state != D_PREP)
6b9cb124 1165 return 0;
c81abe34 1166
d6184774 1167 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK))
6b9cb124 1168 return 0;
d6184774 1169
35ec7d57
CY
1170 trace_f2fs_issue_discard(bdev, dc->start, dc->len);
1171
1172 lstart = dc->lstart;
1173 start = dc->start;
1174 len = dc->len;
1175 total_len = len;
1176
1177 dc->len = 0;
1178
1179 while (total_len && *issued < dpolicy->max_requests && !err) {
1180 struct bio *bio = NULL;
1181 unsigned long flags;
1182 bool last = true;
1183
1184 if (len > max_discard_blocks) {
1185 len = max_discard_blocks;
1186 last = false;
1187 }
1188
1189 (*issued)++;
1190 if (*issued == dpolicy->max_requests)
1191 last = true;
1192
1193 dc->len += len;
1194
b83dcfe6 1195 if (time_to_inject(sbi, FAULT_DISCARD)) {
c45d6002 1196 f2fs_show_injection_info(sbi, FAULT_DISCARD);
b83dcfe6
CY
1197 err = -EIO;
1198 goto submit;
1199 }
35ec7d57
CY
1200 err = __blkdev_issue_discard(bdev,
1201 SECTOR_FROM_BLOCK(start),
1202 SECTOR_FROM_BLOCK(len),
1203 GFP_NOFS, 0, &bio);
b83dcfe6 1204submit:
6b9cb124 1205 if (err) {
35ec7d57 1206 spin_lock_irqsave(&dc->lock, flags);
6b9cb124 1207 if (dc->state == D_PARTIAL)
35ec7d57 1208 dc->state = D_SUBMIT;
35ec7d57
CY
1209 spin_unlock_irqrestore(&dc->lock, flags);
1210
6b9cb124
CY
1211 break;
1212 }
35ec7d57 1213
6b9cb124 1214 f2fs_bug_on(sbi, !bio);
35ec7d57 1215
6b9cb124
CY
1216 /*
1217 * should keep before submission to avoid D_DONE
1218 * right away
1219 */
1220 spin_lock_irqsave(&dc->lock, flags);
1221 if (last)
1222 dc->state = D_SUBMIT;
1223 else
1224 dc->state = D_PARTIAL;
1225 dc->bio_ref++;
1226 spin_unlock_irqrestore(&dc->lock, flags);
35ec7d57 1227
72691af6
JK
1228 atomic_inc(&dcc->queued_discard);
1229 dc->queued++;
6b9cb124 1230 list_move_tail(&dc->list, wait_list);
b0af6d49 1231
6b9cb124 1232 /* sanity check on discard range */
9249dded 1233 __check_sit_bitmap(sbi, lstart, lstart + len);
35ec7d57 1234
6b9cb124
CY
1235 bio->bi_private = dc;
1236 bio->bi_end_io = f2fs_submit_discard_endio;
1237 bio->bi_opf |= flag;
1238 submit_bio(bio);
1239
1240 atomic_inc(&dcc->issued_discard);
1241
1242 f2fs_update_iostat(sbi, FS_DISCARD, 1);
35ec7d57
CY
1243
1244 lstart += len;
1245 start += len;
1246 total_len -= len;
1247 len = total_len;
c81abe34 1248 }
35ec7d57 1249
df423399
ST
1250 if (!err && len) {
1251 dcc->undiscard_blks -= len;
35ec7d57 1252 __update_discard_tree_range(sbi, bdev, lstart, start, len);
df423399 1253 }
6b9cb124 1254 return err;
c81abe34
JK
1255}
1256
47d0d7d7 1257static void __insert_discard_tree(struct f2fs_sb_info *sbi,
004b6862
CY
1258 struct block_device *bdev, block_t lstart,
1259 block_t start, block_t len,
1260 struct rb_node **insert_p,
1261 struct rb_node *insert_parent)
c81abe34 1262{
004b6862 1263 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
dca6951f 1264 struct rb_node **p;
004b6862 1265 struct rb_node *parent = NULL;
4dada3fd 1266 bool leftmost = true;
004b6862
CY
1267
1268 if (insert_p && insert_parent) {
1269 parent = insert_parent;
1270 p = insert_p;
1271 goto do_insert;
1272 }
c81abe34 1273
4dada3fd
CY
1274 p = f2fs_lookup_rb_tree_for_insert(sbi, &dcc->root, &parent,
1275 lstart, &leftmost);
004b6862 1276do_insert:
47d0d7d7 1277 __attach_discard_cmd(sbi, bdev, lstart, start, len, parent,
4dada3fd 1278 p, leftmost);
c81abe34
JK
1279}
1280
ba48a33e
CY
1281static void __relocate_discard_cmd(struct discard_cmd_control *dcc,
1282 struct discard_cmd *dc)
1283{
1284 list_move_tail(&dc->list, &dcc->pend_list[plist_idx(dc->len)]);
1285}
1286
3d6a650f
YH
1287static void __punch_discard_cmd(struct f2fs_sb_info *sbi,
1288 struct discard_cmd *dc, block_t blkaddr)
1289{
ba48a33e 1290 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
004b6862
CY
1291 struct discard_info di = dc->di;
1292 bool modified = false;
3d6a650f 1293
004b6862 1294 if (dc->state == D_DONE || dc->len == 1) {
3d6a650f
YH
1295 __remove_discard_cmd(sbi, dc);
1296 return;
1297 }
1298
d84d1cbd
CY
1299 dcc->undiscard_blks -= di.len;
1300
004b6862 1301 if (blkaddr > di.lstart) {
3d6a650f 1302 dc->len = blkaddr - dc->lstart;
d84d1cbd 1303 dcc->undiscard_blks += dc->len;
ba48a33e 1304 __relocate_discard_cmd(dcc, dc);
004b6862
CY
1305 modified = true;
1306 }
1307
1308 if (blkaddr < di.lstart + di.len - 1) {
1309 if (modified) {
1310 __insert_discard_tree(sbi, dc->bdev, blkaddr + 1,
1311 di.start + blkaddr + 1 - di.lstart,
1312 di.lstart + di.len - 1 - blkaddr,
1313 NULL, NULL);
1314 } else {
1315 dc->lstart++;
1316 dc->len--;
1317 dc->start++;
d84d1cbd 1318 dcc->undiscard_blks += dc->len;
ba48a33e 1319 __relocate_discard_cmd(dcc, dc);
004b6862 1320 }
3d6a650f
YH
1321 }
1322}
1323
004b6862
CY
1324static void __update_discard_tree_range(struct f2fs_sb_info *sbi,
1325 struct block_device *bdev, block_t lstart,
1326 block_t start, block_t len)
275b66b0 1327{
0b54fb84 1328 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
004b6862
CY
1329 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1330 struct discard_cmd *dc;
1331 struct discard_info di = {0};
1332 struct rb_node **insert_p = NULL, *insert_parent = NULL;
35ec7d57
CY
1333 struct request_queue *q = bdev_get_queue(bdev);
1334 unsigned int max_discard_blocks =
1335 SECTOR_TO_BLOCK(q->limits.max_discard_sectors);
004b6862 1336 block_t end = lstart + len;
275b66b0 1337
4d57b86d 1338 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
004b6862
CY
1339 NULL, lstart,
1340 (struct rb_entry **)&prev_dc,
1341 (struct rb_entry **)&next_dc,
4dada3fd 1342 &insert_p, &insert_parent, true, NULL);
004b6862
CY
1343 if (dc)
1344 prev_dc = dc;
1345
1346 if (!prev_dc) {
1347 di.lstart = lstart;
1348 di.len = next_dc ? next_dc->lstart - lstart : len;
1349 di.len = min(di.len, len);
1350 di.start = start;
22d375dd 1351 }
15469963 1352
004b6862
CY
1353 while (1) {
1354 struct rb_node *node;
1355 bool merged = false;
1356 struct discard_cmd *tdc = NULL;
1357
1358 if (prev_dc) {
1359 di.lstart = prev_dc->lstart + prev_dc->len;
1360 if (di.lstart < lstart)
1361 di.lstart = lstart;
1362 if (di.lstart >= end)
1363 break;
1364
1365 if (!next_dc || next_dc->lstart > end)
1366 di.len = end - di.lstart;
1367 else
1368 di.len = next_dc->lstart - di.lstart;
1369 di.start = start + di.lstart - lstart;
1370 }
1371
1372 if (!di.len)
1373 goto next;
1374
1375 if (prev_dc && prev_dc->state == D_PREP &&
1376 prev_dc->bdev == bdev &&
35ec7d57
CY
1377 __is_discard_back_mergeable(&di, &prev_dc->di,
1378 max_discard_blocks)) {
004b6862 1379 prev_dc->di.len += di.len;
d84d1cbd 1380 dcc->undiscard_blks += di.len;
ba48a33e 1381 __relocate_discard_cmd(dcc, prev_dc);
004b6862
CY
1382 di = prev_dc->di;
1383 tdc = prev_dc;
1384 merged = true;
1385 }
1386
1387 if (next_dc && next_dc->state == D_PREP &&
1388 next_dc->bdev == bdev &&
35ec7d57
CY
1389 __is_discard_front_mergeable(&di, &next_dc->di,
1390 max_discard_blocks)) {
004b6862
CY
1391 next_dc->di.lstart = di.lstart;
1392 next_dc->di.len += di.len;
1393 next_dc->di.start = di.start;
d84d1cbd 1394 dcc->undiscard_blks += di.len;
ba48a33e 1395 __relocate_discard_cmd(dcc, next_dc);
004b6862
CY
1396 if (tdc)
1397 __remove_discard_cmd(sbi, tdc);
004b6862 1398 merged = true;
4e6a8d9b 1399 }
004b6862 1400
df0f6b44 1401 if (!merged) {
004b6862
CY
1402 __insert_discard_tree(sbi, bdev, di.lstart, di.start,
1403 di.len, NULL, NULL);
df0f6b44 1404 }
004b6862
CY
1405 next:
1406 prev_dc = next_dc;
1407 if (!prev_dc)
1408 break;
1409
1410 node = rb_next(&prev_dc->rb_node);
1411 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1412 }
004b6862
CY
1413}
1414
1415static int __queue_discard_cmd(struct f2fs_sb_info *sbi,
1416 struct block_device *bdev, block_t blkstart, block_t blklen)
1417{
1418 block_t lblkstart = blkstart;
1419
7f3d7719
DLM
1420 if (!f2fs_bdev_support_discard(bdev))
1421 return 0;
1422
0243a5f9 1423 trace_f2fs_queue_discard(bdev, blkstart, blklen);
004b6862 1424
0916878d 1425 if (f2fs_is_multi_device(sbi)) {
004b6862
CY
1426 int devi = f2fs_target_device_index(sbi, blkstart);
1427
1428 blkstart -= FDEV(devi).start_blk;
1429 }
35ec7d57 1430 mutex_lock(&SM_I(sbi)->dcc_info->cmd_lock);
004b6862 1431 __update_discard_tree_range(sbi, bdev, lblkstart, blkstart, blklen);
35ec7d57 1432 mutex_unlock(&SM_I(sbi)->dcc_info->cmd_lock);
004b6862
CY
1433 return 0;
1434}
1435
20ee4382
CY
1436static unsigned int __issue_discard_cmd_orderly(struct f2fs_sb_info *sbi,
1437 struct discard_policy *dpolicy)
1438{
1439 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1440 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1441 struct rb_node **insert_p = NULL, *insert_parent = NULL;
1442 struct discard_cmd *dc;
1443 struct blk_plug plug;
1444 unsigned int pos = dcc->next_pos;
1445 unsigned int issued = 0;
1446 bool io_interrupted = false;
1447
1448 mutex_lock(&dcc->cmd_lock);
1449 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
1450 NULL, pos,
1451 (struct rb_entry **)&prev_dc,
1452 (struct rb_entry **)&next_dc,
4dada3fd 1453 &insert_p, &insert_parent, true, NULL);
20ee4382
CY
1454 if (!dc)
1455 dc = next_dc;
1456
1457 blk_start_plug(&plug);
1458
1459 while (dc) {
1460 struct rb_node *node;
6b9cb124 1461 int err = 0;
20ee4382
CY
1462
1463 if (dc->state != D_PREP)
1464 goto next;
1465
a7d10cf3 1466 if (dpolicy->io_aware && !is_idle(sbi, DISCARD_TIME)) {
20ee4382
CY
1467 io_interrupted = true;
1468 break;
1469 }
1470
1471 dcc->next_pos = dc->lstart + dc->len;
6b9cb124 1472 err = __submit_discard_cmd(sbi, dpolicy, dc, &issued);
20ee4382 1473
35ec7d57 1474 if (issued >= dpolicy->max_requests)
20ee4382
CY
1475 break;
1476next:
1477 node = rb_next(&dc->rb_node);
6b9cb124
CY
1478 if (err)
1479 __remove_discard_cmd(sbi, dc);
20ee4382
CY
1480 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1481 }
1482
1483 blk_finish_plug(&plug);
1484
1485 if (!dc)
1486 dcc->next_pos = 0;
1487
1488 mutex_unlock(&dcc->cmd_lock);
1489
1490 if (!issued && io_interrupted)
1491 issued = -1;
1492
1493 return issued;
1494}
141af6ba
ST
1495static unsigned int __wait_all_discard_cmd(struct f2fs_sb_info *sbi,
1496 struct discard_policy *dpolicy);
20ee4382 1497
78997b56
CY
1498static int __issue_discard_cmd(struct f2fs_sb_info *sbi,
1499 struct discard_policy *dpolicy)
bd5b0738
CY
1500{
1501 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1502 struct list_head *pend_list;
1503 struct discard_cmd *dc, *tmp;
1504 struct blk_plug plug;
141af6ba 1505 int i, issued;
e6c6de18 1506 bool io_interrupted = false;
bd5b0738 1507
6ce48b0c
CY
1508 if (dpolicy->timeout)
1509 f2fs_update_time(sbi, UMOUNT_DISCARD_TIMEOUT);
03f2c02d 1510
141af6ba
ST
1511retry:
1512 issued = 0;
78997b56 1513 for (i = MAX_PLIST_NUM - 1; i >= 0; i--) {
6ce48b0c
CY
1514 if (dpolicy->timeout &&
1515 f2fs_time_over(sbi, UMOUNT_DISCARD_TIMEOUT))
03f2c02d
JK
1516 break;
1517
78997b56
CY
1518 if (i + 1 < dpolicy->granularity)
1519 break;
20ee4382
CY
1520
1521 if (i < DEFAULT_DISCARD_GRANULARITY && dpolicy->ordered)
1522 return __issue_discard_cmd_orderly(sbi, dpolicy);
1523
bd5b0738 1524 pend_list = &dcc->pend_list[i];
33da62cf
CY
1525
1526 mutex_lock(&dcc->cmd_lock);
49c60c67
CY
1527 if (list_empty(pend_list))
1528 goto next;
67fce70b
CY
1529 if (unlikely(dcc->rbtree_check))
1530 f2fs_bug_on(sbi, !f2fs_check_rb_tree_consistence(sbi,
2e9b2bb2 1531 &dcc->root, false));
33da62cf 1532 blk_start_plug(&plug);
bd5b0738
CY
1533 list_for_each_entry_safe(dc, tmp, pend_list, list) {
1534 f2fs_bug_on(sbi, dc->state != D_PREP);
1535
6ce48b0c
CY
1536 if (dpolicy->timeout &&
1537 f2fs_time_over(sbi, UMOUNT_DISCARD_TIMEOUT))
6e0cd4a9
HX
1538 break;
1539
ecc9aa00 1540 if (dpolicy->io_aware && i < dpolicy->io_aware_gran &&
a7d10cf3 1541 !is_idle(sbi, DISCARD_TIME)) {
e6c6de18 1542 io_interrupted = true;
522d1711 1543 break;
969d1b18 1544 }
e6c6de18 1545
35ec7d57 1546 __submit_discard_cmd(sbi, dpolicy, dc, &issued);
522d1711 1547
35ec7d57 1548 if (issued >= dpolicy->max_requests)
33da62cf 1549 break;
bd5b0738 1550 }
33da62cf 1551 blk_finish_plug(&plug);
49c60c67 1552next:
33da62cf
CY
1553 mutex_unlock(&dcc->cmd_lock);
1554
522d1711 1555 if (issued >= dpolicy->max_requests || io_interrupted)
33da62cf 1556 break;
bd5b0738 1557 }
969d1b18 1558
141af6ba
ST
1559 if (dpolicy->type == DPOLICY_UMOUNT && issued) {
1560 __wait_all_discard_cmd(sbi, dpolicy);
1561 goto retry;
1562 }
1563
e6c6de18
CY
1564 if (!issued && io_interrupted)
1565 issued = -1;
1566
969d1b18
CY
1567 return issued;
1568}
1569
cf5c759f 1570static bool __drop_discard_cmd(struct f2fs_sb_info *sbi)
969d1b18
CY
1571{
1572 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1573 struct list_head *pend_list;
1574 struct discard_cmd *dc, *tmp;
1575 int i;
cf5c759f 1576 bool dropped = false;
969d1b18
CY
1577
1578 mutex_lock(&dcc->cmd_lock);
1579 for (i = MAX_PLIST_NUM - 1; i >= 0; i--) {
1580 pend_list = &dcc->pend_list[i];
1581 list_for_each_entry_safe(dc, tmp, pend_list, list) {
1582 f2fs_bug_on(sbi, dc->state != D_PREP);
1583 __remove_discard_cmd(sbi, dc);
cf5c759f 1584 dropped = true;
969d1b18
CY
1585 }
1586 }
1587 mutex_unlock(&dcc->cmd_lock);
cf5c759f
CY
1588
1589 return dropped;
bd5b0738
CY
1590}
1591
4d57b86d 1592void f2fs_drop_discard_cmd(struct f2fs_sb_info *sbi)
7950e9ac
CY
1593{
1594 __drop_discard_cmd(sbi);
1595}
1596
0ea80512 1597static unsigned int __wait_one_discard_bio(struct f2fs_sb_info *sbi,
2a510c00
CY
1598 struct discard_cmd *dc)
1599{
1600 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
0ea80512 1601 unsigned int len = 0;
2a510c00
CY
1602
1603 wait_for_completion_io(&dc->wait);
1604 mutex_lock(&dcc->cmd_lock);
1605 f2fs_bug_on(sbi, dc->state != D_DONE);
1606 dc->ref--;
0ea80512
CY
1607 if (!dc->ref) {
1608 if (!dc->error)
1609 len = dc->len;
2a510c00 1610 __remove_discard_cmd(sbi, dc);
0ea80512 1611 }
2a510c00 1612 mutex_unlock(&dcc->cmd_lock);
0ea80512
CY
1613
1614 return len;
2a510c00
CY
1615}
1616
0ea80512 1617static unsigned int __wait_discard_cmd_range(struct f2fs_sb_info *sbi,
78997b56
CY
1618 struct discard_policy *dpolicy,
1619 block_t start, block_t end)
63a94fa1
CY
1620{
1621 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
78997b56
CY
1622 struct list_head *wait_list = (dpolicy->type == DPOLICY_FSTRIM) ?
1623 &(dcc->fstrim_list) : &(dcc->wait_list);
63a94fa1 1624 struct discard_cmd *dc, *tmp;
6afae633 1625 bool need_wait;
0ea80512 1626 unsigned int trimmed = 0;
6afae633
CY
1627
1628next:
1629 need_wait = false;
63a94fa1
CY
1630
1631 mutex_lock(&dcc->cmd_lock);
1632 list_for_each_entry_safe(dc, tmp, wait_list, list) {
8412663d
CY
1633 if (dc->lstart + dc->len <= start || end <= dc->lstart)
1634 continue;
78997b56 1635 if (dc->len < dpolicy->granularity)
8412663d 1636 continue;
78997b56 1637 if (dc->state == D_DONE && !dc->ref) {
63a94fa1 1638 wait_for_completion_io(&dc->wait);
0ea80512
CY
1639 if (!dc->error)
1640 trimmed += dc->len;
63a94fa1 1641 __remove_discard_cmd(sbi, dc);
6afae633
CY
1642 } else {
1643 dc->ref++;
1644 need_wait = true;
1645 break;
63a94fa1
CY
1646 }
1647 }
1648 mutex_unlock(&dcc->cmd_lock);
6afae633
CY
1649
1650 if (need_wait) {
0ea80512 1651 trimmed += __wait_one_discard_bio(sbi, dc);
6afae633
CY
1652 goto next;
1653 }
0ea80512
CY
1654
1655 return trimmed;
63a94fa1
CY
1656}
1657
01f9cf6d 1658static unsigned int __wait_all_discard_cmd(struct f2fs_sb_info *sbi,
78997b56 1659 struct discard_policy *dpolicy)
8412663d 1660{
9a997188 1661 struct discard_policy dp;
01f9cf6d 1662 unsigned int discard_blks;
9a997188 1663
01f9cf6d
CY
1664 if (dpolicy)
1665 return __wait_discard_cmd_range(sbi, dpolicy, 0, UINT_MAX);
9a997188
JK
1666
1667 /* wait all */
8bb4f253 1668 __init_discard_policy(sbi, &dp, DPOLICY_FSTRIM, 1);
01f9cf6d 1669 discard_blks = __wait_discard_cmd_range(sbi, &dp, 0, UINT_MAX);
8bb4f253 1670 __init_discard_policy(sbi, &dp, DPOLICY_UMOUNT, 1);
01f9cf6d
CY
1671 discard_blks += __wait_discard_cmd_range(sbi, &dp, 0, UINT_MAX);
1672
1673 return discard_blks;
8412663d
CY
1674}
1675
004b6862 1676/* This should be covered by global mutex, &sit_i->sentry_lock */
94b1e10e 1677static void f2fs_wait_discard_bio(struct f2fs_sb_info *sbi, block_t blkaddr)
004b6862
CY
1678{
1679 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1680 struct discard_cmd *dc;
ec9895ad 1681 bool need_wait = false;
004b6862
CY
1682
1683 mutex_lock(&dcc->cmd_lock);
4d57b86d
CY
1684 dc = (struct discard_cmd *)f2fs_lookup_rb_tree(&dcc->root,
1685 NULL, blkaddr);
004b6862 1686 if (dc) {
ec9895ad
CY
1687 if (dc->state == D_PREP) {
1688 __punch_discard_cmd(sbi, dc, blkaddr);
1689 } else {
1690 dc->ref++;
1691 need_wait = true;
1692 }
275b66b0 1693 }
d431413f 1694 mutex_unlock(&dcc->cmd_lock);
ec9895ad 1695
2a510c00
CY
1696 if (need_wait)
1697 __wait_one_discard_bio(sbi, dc);
d431413f
CY
1698}
1699
4d57b86d 1700void f2fs_stop_discard_thread(struct f2fs_sb_info *sbi)
cce13252
CY
1701{
1702 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1703
1704 if (dcc && dcc->f2fs_issue_discard) {
1705 struct task_struct *discard_thread = dcc->f2fs_issue_discard;
1706
1707 dcc->f2fs_issue_discard = NULL;
1708 kthread_stop(discard_thread);
ec9895ad 1709 }
d431413f
CY
1710}
1711
8412663d 1712/* This comes from f2fs_put_super */
03f2c02d 1713bool f2fs_issue_discard_timeout(struct f2fs_sb_info *sbi)
969d1b18
CY
1714{
1715 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
78997b56 1716 struct discard_policy dpolicy;
cf5c759f 1717 bool dropped;
969d1b18 1718
8bb4f253
JK
1719 __init_discard_policy(sbi, &dpolicy, DPOLICY_UMOUNT,
1720 dcc->discard_granularity);
78997b56 1721 __issue_discard_cmd(sbi, &dpolicy);
cf5c759f 1722 dropped = __drop_discard_cmd(sbi);
cf5c759f 1723
9a997188
JK
1724 /* just to make sure there is no pending discard commands */
1725 __wait_all_discard_cmd(sbi, NULL);
2482c432
CY
1726
1727 f2fs_bug_on(sbi, atomic_read(&dcc->discard_cmd_cnt));
cf5c759f 1728 return dropped;
969d1b18
CY
1729}
1730
15469963
JK
1731static int issue_discard_thread(void *data)
1732{
1733 struct f2fs_sb_info *sbi = data;
1734 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1735 wait_queue_head_t *q = &dcc->discard_wait_queue;
78997b56 1736 struct discard_policy dpolicy;
969d1b18
CY
1737 unsigned int wait_ms = DEF_MIN_DISCARD_ISSUE_TIME;
1738 int issued;
15469963 1739
1d7be270 1740 set_freezable();
15469963 1741
1d7be270 1742 do {
8bb4f253 1743 __init_discard_policy(sbi, &dpolicy, DPOLICY_BG,
78997b56
CY
1744 dcc->discard_granularity);
1745
969d1b18
CY
1746 wait_event_interruptible_timeout(*q,
1747 kthread_should_stop() || freezing(current) ||
1748 dcc->discard_wake,
1749 msecs_to_jiffies(wait_ms));
35a9a766
SY
1750
1751 if (dcc->discard_wake)
1752 dcc->discard_wake = 0;
1753
76c7bfb3
JK
1754 /* clean up pending candidates before going to sleep */
1755 if (atomic_read(&dcc->queued_discard))
1756 __wait_all_discard_cmd(sbi, NULL);
1757
1d7be270
JK
1758 if (try_to_freeze())
1759 continue;
3b60d802
CY
1760 if (f2fs_readonly(sbi->sb))
1761 continue;
1d7be270
JK
1762 if (kthread_should_stop())
1763 return 0;
d6184774
YH
1764 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
1765 wait_ms = dpolicy.max_interval;
1766 continue;
1767 }
15469963 1768
0e5e8111 1769 if (sbi->gc_mode == GC_URGENT_HIGH)
8bb4f253 1770 __init_discard_policy(sbi, &dpolicy, DPOLICY_FORCE, 1);
969d1b18 1771
dc6febb6
CY
1772 sb_start_intwrite(sbi->sb);
1773
78997b56 1774 issued = __issue_discard_cmd(sbi, &dpolicy);
f9d1dced 1775 if (issued > 0) {
78997b56
CY
1776 __wait_all_discard_cmd(sbi, &dpolicy);
1777 wait_ms = dpolicy.min_interval;
f9d1dced 1778 } else if (issued == -1){
a7d10cf3
ST
1779 wait_ms = f2fs_time_to_wait(sbi, DISCARD_TIME);
1780 if (!wait_ms)
abde73c7 1781 wait_ms = dpolicy.mid_interval;
969d1b18 1782 } else {
78997b56 1783 wait_ms = dpolicy.max_interval;
969d1b18 1784 }
1d7be270 1785
dc6febb6 1786 sb_end_intwrite(sbi->sb);
1d7be270 1787
1d7be270
JK
1788 } while (!kthread_should_stop());
1789 return 0;
15469963
JK
1790}
1791
f46e8809 1792#ifdef CONFIG_BLK_DEV_ZONED
3c62be17
JK
1793static int __f2fs_issue_discard_zone(struct f2fs_sb_info *sbi,
1794 struct block_device *bdev, block_t blkstart, block_t blklen)
f46e8809 1795{
92592285 1796 sector_t sector, nr_sects;
10a875f8 1797 block_t lblkstart = blkstart;
3c62be17
JK
1798 int devi = 0;
1799
0916878d 1800 if (f2fs_is_multi_device(sbi)) {
3c62be17 1801 devi = f2fs_target_device_index(sbi, blkstart);
95175daf
DLM
1802 if (blkstart < FDEV(devi).start_blk ||
1803 blkstart > FDEV(devi).end_blk) {
dcbb4c10 1804 f2fs_err(sbi, "Invalid block %x", blkstart);
95175daf
DLM
1805 return -EIO;
1806 }
3c62be17
JK
1807 blkstart -= FDEV(devi).start_blk;
1808 }
f46e8809 1809
95175daf
DLM
1810 /* For sequential zones, reset the zone write pointer */
1811 if (f2fs_blkz_is_seq(sbi, devi, blkstart)) {
92592285
JK
1812 sector = SECTOR_FROM_BLOCK(blkstart);
1813 nr_sects = SECTOR_FROM_BLOCK(blklen);
1814
1815 if (sector & (bdev_zone_sectors(bdev) - 1) ||
1816 nr_sects != bdev_zone_sectors(bdev)) {
dcbb4c10
JP
1817 f2fs_err(sbi, "(%d) %s: Unaligned zone reset attempted (block %x + %x)",
1818 devi, sbi->s_ndevs ? FDEV(devi).path : "",
1819 blkstart, blklen);
92592285
JK
1820 return -EIO;
1821 }
d50aaeec 1822 trace_f2fs_issue_reset_zone(bdev, blkstart);
6c1b1da5
AJ
1823 return blkdev_zone_mgmt(bdev, REQ_OP_ZONE_RESET,
1824 sector, nr_sects, GFP_NOFS);
f46e8809 1825 }
95175daf
DLM
1826
1827 /* For conventional zones, use regular discard if supported */
95175daf 1828 return __queue_discard_cmd(sbi, bdev, lblkstart, blklen);
f46e8809
DLM
1829}
1830#endif
1831
3c62be17
JK
1832static int __issue_discard_async(struct f2fs_sb_info *sbi,
1833 struct block_device *bdev, block_t blkstart, block_t blklen)
1834{
1835#ifdef CONFIG_BLK_DEV_ZONED
7f3d7719 1836 if (f2fs_sb_has_blkzoned(sbi) && bdev_is_zoned(bdev))
3c62be17
JK
1837 return __f2fs_issue_discard_zone(sbi, bdev, blkstart, blklen);
1838#endif
c81abe34 1839 return __queue_discard_cmd(sbi, bdev, blkstart, blklen);
3c62be17
JK
1840}
1841
1e87a78d 1842static int f2fs_issue_discard(struct f2fs_sb_info *sbi,
37208879
JK
1843 block_t blkstart, block_t blklen)
1844{
3c62be17
JK
1845 sector_t start = blkstart, len = 0;
1846 struct block_device *bdev;
a66cdd98
JK
1847 struct seg_entry *se;
1848 unsigned int offset;
1849 block_t i;
3c62be17
JK
1850 int err = 0;
1851
1852 bdev = f2fs_target_device(sbi, blkstart, NULL);
1853
1854 for (i = blkstart; i < blkstart + blklen; i++, len++) {
1855 if (i != start) {
1856 struct block_device *bdev2 =
1857 f2fs_target_device(sbi, i, NULL);
1858
1859 if (bdev2 != bdev) {
1860 err = __issue_discard_async(sbi, bdev,
1861 start, len);
1862 if (err)
1863 return err;
1864 bdev = bdev2;
1865 start = i;
1866 len = 0;
1867 }
1868 }
a66cdd98 1869
a66cdd98
JK
1870 se = get_seg_entry(sbi, GET_SEGNO(sbi, i));
1871 offset = GET_BLKOFF_FROM_SEG0(sbi, i);
1872
1873 if (!f2fs_test_and_set_bit(offset, se->discard_map))
1874 sbi->discard_blks--;
1875 }
f46e8809 1876
3c62be17
JK
1877 if (len)
1878 err = __issue_discard_async(sbi, bdev, start, len);
1879 return err;
1e87a78d
JK
1880}
1881
25290fa5
JK
1882static bool add_discard_addrs(struct f2fs_sb_info *sbi, struct cp_control *cpc,
1883 bool check_only)
adf4983b 1884{
b2955550
JK
1885 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
1886 int max_blocks = sbi->blocks_per_seg;
4b2fecc8 1887 struct seg_entry *se = get_seg_entry(sbi, cpc->trim_start);
b2955550
JK
1888 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
1889 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
a66cdd98 1890 unsigned long *discard_map = (unsigned long *)se->discard_map;
60a3b782 1891 unsigned long *dmap = SIT_I(sbi)->tmp_map;
b2955550 1892 unsigned int start = 0, end = -1;
c473f1a9 1893 bool force = (cpc->reason & CP_DISCARD);
a7eeb823 1894 struct discard_entry *de = NULL;
46f84c2c 1895 struct list_head *head = &SM_I(sbi)->dcc_info->entry_list;
b2955550
JK
1896 int i;
1897
7d20c8ab 1898 if (se->valid_blocks == max_blocks || !f2fs_hw_support_discard(sbi))
25290fa5 1899 return false;
b2955550 1900
a66cdd98 1901 if (!force) {
7d20c8ab 1902 if (!f2fs_realtime_discard_enable(sbi) || !se->valid_blocks ||
0b54fb84
JK
1903 SM_I(sbi)->dcc_info->nr_discards >=
1904 SM_I(sbi)->dcc_info->max_discards)
25290fa5 1905 return false;
4b2fecc8
JK
1906 }
1907
b2955550
JK
1908 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
1909 for (i = 0; i < entries; i++)
a66cdd98 1910 dmap[i] = force ? ~ckpt_map[i] & ~discard_map[i] :
d7bc2484 1911 (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i];
b2955550 1912
0b54fb84
JK
1913 while (force || SM_I(sbi)->dcc_info->nr_discards <=
1914 SM_I(sbi)->dcc_info->max_discards) {
b2955550
JK
1915 start = __find_rev_next_bit(dmap, max_blocks, end + 1);
1916 if (start >= max_blocks)
1917 break;
1918
1919 end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1);
c7b41e16
YH
1920 if (force && start && end != max_blocks
1921 && (end - start) < cpc->trim_minlen)
1922 continue;
1923
25290fa5
JK
1924 if (check_only)
1925 return true;
1926
a7eeb823
CY
1927 if (!de) {
1928 de = f2fs_kmem_cache_alloc(discard_entry_slab,
1929 GFP_F2FS_ZERO);
1930 de->start_blkaddr = START_BLOCK(sbi, cpc->trim_start);
1931 list_add_tail(&de->list, head);
1932 }
1933
1934 for (i = start; i < end; i++)
1935 __set_bit_le(i, (void *)de->discard_map);
1936
1937 SM_I(sbi)->dcc_info->nr_discards += end - start;
b2955550 1938 }
25290fa5 1939 return false;
b2955550
JK
1940}
1941
af8ff65b
CY
1942static void release_discard_addr(struct discard_entry *entry)
1943{
1944 list_del(&entry->list);
1945 kmem_cache_free(discard_entry_slab, entry);
1946}
1947
4d57b86d 1948void f2fs_release_discard_addrs(struct f2fs_sb_info *sbi)
4b2fecc8 1949{
46f84c2c 1950 struct list_head *head = &(SM_I(sbi)->dcc_info->entry_list);
4b2fecc8
JK
1951 struct discard_entry *entry, *this;
1952
1953 /* drop caches */
af8ff65b
CY
1954 list_for_each_entry_safe(entry, this, head, list)
1955 release_discard_addr(entry);
4b2fecc8
JK
1956}
1957
0a8165d7 1958/*
4d57b86d 1959 * Should call f2fs_clear_prefree_segments after checkpoint is done.
351df4b2
JK
1960 */
1961static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi)
1962{
1963 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
b65ee148 1964 unsigned int segno;
351df4b2
JK
1965
1966 mutex_lock(&dirty_i->seglist_lock);
7cd8558b 1967 for_each_set_bit(segno, dirty_i->dirty_segmap[PRE], MAIN_SEGS(sbi))
d0b9e42a 1968 __set_test_and_free(sbi, segno, false);
351df4b2
JK
1969 mutex_unlock(&dirty_i->seglist_lock);
1970}
1971
4d57b86d
CY
1972void f2fs_clear_prefree_segments(struct f2fs_sb_info *sbi,
1973 struct cp_control *cpc)
351df4b2 1974{
969d1b18
CY
1975 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
1976 struct list_head *head = &dcc->entry_list;
2d7b822a 1977 struct discard_entry *entry, *this;
351df4b2 1978 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
29e59c14 1979 unsigned long *prefree_map = dirty_i->dirty_segmap[PRE];
29e59c14 1980 unsigned int start = 0, end = -1;
36abef4e 1981 unsigned int secno, start_segno;
c473f1a9 1982 bool force = (cpc->reason & CP_DISCARD);
b0332a0f 1983 bool need_align = f2fs_lfs_mode(sbi) && __is_large_section(sbi);
351df4b2
JK
1984
1985 mutex_lock(&dirty_i->seglist_lock);
29e59c14 1986
351df4b2 1987 while (1) {
29e59c14 1988 int i;
ad6672bb
YS
1989
1990 if (need_align && end != -1)
1991 end--;
7cd8558b
JK
1992 start = find_next_bit(prefree_map, MAIN_SEGS(sbi), end + 1);
1993 if (start >= MAIN_SEGS(sbi))
351df4b2 1994 break;
7cd8558b
JK
1995 end = find_next_zero_bit(prefree_map, MAIN_SEGS(sbi),
1996 start + 1);
29e59c14 1997
ad6672bb
YS
1998 if (need_align) {
1999 start = rounddown(start, sbi->segs_per_sec);
2000 end = roundup(end, sbi->segs_per_sec);
2001 }
29e59c14 2002
ad6672bb
YS
2003 for (i = start; i < end; i++) {
2004 if (test_and_clear_bit(i, prefree_map))
2005 dirty_i->nr_dirty[PRE]--;
2006 }
29e59c14 2007
7d20c8ab 2008 if (!f2fs_realtime_discard_enable(sbi))
29e59c14 2009 continue;
351df4b2 2010
650d3c4e
YH
2011 if (force && start >= cpc->trim_start &&
2012 (end - 1) <= cpc->trim_end)
2013 continue;
2014
b0332a0f 2015 if (!f2fs_lfs_mode(sbi) || !__is_large_section(sbi)) {
36abef4e 2016 f2fs_issue_discard(sbi, START_BLOCK(sbi, start),
37208879 2017 (end - start) << sbi->log_blocks_per_seg);
36abef4e
JK
2018 continue;
2019 }
2020next:
4ddb1a4d
JK
2021 secno = GET_SEC_FROM_SEG(sbi, start);
2022 start_segno = GET_SEG_FROM_SEC(sbi, secno);
36abef4e 2023 if (!IS_CURSEC(sbi, secno) &&
302bd348 2024 !get_valid_blocks(sbi, start, true))
36abef4e
JK
2025 f2fs_issue_discard(sbi, START_BLOCK(sbi, start_segno),
2026 sbi->segs_per_sec << sbi->log_blocks_per_seg);
2027
2028 start = start_segno + sbi->segs_per_sec;
2029 if (start < end)
2030 goto next;
8b107f5b
JK
2031 else
2032 end = start - 1;
351df4b2
JK
2033 }
2034 mutex_unlock(&dirty_i->seglist_lock);
b2955550
JK
2035
2036 /* send small discards */
2d7b822a 2037 list_for_each_entry_safe(entry, this, head, list) {
a7eeb823
CY
2038 unsigned int cur_pos = 0, next_pos, len, total_len = 0;
2039 bool is_valid = test_bit_le(0, entry->discard_map);
2040
2041find_next:
2042 if (is_valid) {
2043 next_pos = find_next_zero_bit_le(entry->discard_map,
2044 sbi->blocks_per_seg, cur_pos);
2045 len = next_pos - cur_pos;
2046
7beb01f7 2047 if (f2fs_sb_has_blkzoned(sbi) ||
acfd2810 2048 (force && len < cpc->trim_minlen))
a7eeb823
CY
2049 goto skip;
2050
2051 f2fs_issue_discard(sbi, entry->start_blkaddr + cur_pos,
2052 len);
a7eeb823
CY
2053 total_len += len;
2054 } else {
2055 next_pos = find_next_bit_le(entry->discard_map,
2056 sbi->blocks_per_seg, cur_pos);
2057 }
836b5a63 2058skip:
a7eeb823
CY
2059 cur_pos = next_pos;
2060 is_valid = !is_valid;
2061
2062 if (cur_pos < sbi->blocks_per_seg)
2063 goto find_next;
2064
af8ff65b 2065 release_discard_addr(entry);
969d1b18 2066 dcc->nr_discards -= total_len;
b2955550 2067 }
34e159da 2068
01983c71 2069 wake_up_discard_thread(sbi, false);
351df4b2
JK
2070}
2071
8ed59745 2072static int create_discard_cmd_control(struct f2fs_sb_info *sbi)
0b54fb84 2073{
15469963 2074 dev_t dev = sbi->sb->s_bdev->bd_dev;
0b54fb84 2075 struct discard_cmd_control *dcc;
ba48a33e 2076 int err = 0, i;
0b54fb84
JK
2077
2078 if (SM_I(sbi)->dcc_info) {
2079 dcc = SM_I(sbi)->dcc_info;
2080 goto init_thread;
2081 }
2082
acbf054d 2083 dcc = f2fs_kzalloc(sbi, sizeof(struct discard_cmd_control), GFP_KERNEL);
0b54fb84
JK
2084 if (!dcc)
2085 return -ENOMEM;
2086
969d1b18 2087 dcc->discard_granularity = DEFAULT_DISCARD_GRANULARITY;
46f84c2c 2088 INIT_LIST_HEAD(&dcc->entry_list);
78997b56 2089 for (i = 0; i < MAX_PLIST_NUM; i++)
ba48a33e 2090 INIT_LIST_HEAD(&dcc->pend_list[i]);
46f84c2c 2091 INIT_LIST_HEAD(&dcc->wait_list);
8412663d 2092 INIT_LIST_HEAD(&dcc->fstrim_list);
15469963 2093 mutex_init(&dcc->cmd_lock);
8b8dd65f 2094 atomic_set(&dcc->issued_discard, 0);
72691af6 2095 atomic_set(&dcc->queued_discard, 0);
5f32366a 2096 atomic_set(&dcc->discard_cmd_cnt, 0);
0b54fb84 2097 dcc->nr_discards = 0;
d618ebaf 2098 dcc->max_discards = MAIN_SEGS(sbi) << sbi->log_blocks_per_seg;
d84d1cbd 2099 dcc->undiscard_blks = 0;
20ee4382 2100 dcc->next_pos = 0;
4dada3fd 2101 dcc->root = RB_ROOT_CACHED;
67fce70b 2102 dcc->rbtree_check = false;
0b54fb84 2103
15469963 2104 init_waitqueue_head(&dcc->discard_wait_queue);
0b54fb84
JK
2105 SM_I(sbi)->dcc_info = dcc;
2106init_thread:
15469963
JK
2107 dcc->f2fs_issue_discard = kthread_run(issue_discard_thread, sbi,
2108 "f2fs_discard-%u:%u", MAJOR(dev), MINOR(dev));
2109 if (IS_ERR(dcc->f2fs_issue_discard)) {
2110 err = PTR_ERR(dcc->f2fs_issue_discard);
c8eb7024 2111 kfree(dcc);
15469963
JK
2112 SM_I(sbi)->dcc_info = NULL;
2113 return err;
2114 }
2115
0b54fb84
JK
2116 return err;
2117}
2118
f099405f 2119static void destroy_discard_cmd_control(struct f2fs_sb_info *sbi)
0b54fb84
JK
2120{
2121 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
2122
f099405f
CY
2123 if (!dcc)
2124 return;
2125
4d57b86d 2126 f2fs_stop_discard_thread(sbi);
f099405f 2127
04f9287a
CY
2128 /*
2129 * Recovery can cache discard commands, so in error path of
2130 * fill_super(), it needs to give a chance to handle them.
2131 */
2132 if (unlikely(atomic_read(&dcc->discard_cmd_cnt)))
2133 f2fs_issue_discard_timeout(sbi);
2134
c8eb7024 2135 kfree(dcc);
f099405f 2136 SM_I(sbi)->dcc_info = NULL;
0b54fb84
JK
2137}
2138
184a5cd2 2139static bool __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK
2140{
2141 struct sit_info *sit_i = SIT_I(sbi);
184a5cd2
CY
2142
2143 if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap)) {
351df4b2 2144 sit_i->dirty_sentries++;
184a5cd2
CY
2145 return false;
2146 }
2147
2148 return true;
351df4b2
JK
2149}
2150
2151static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type,
2152 unsigned int segno, int modified)
2153{
2154 struct seg_entry *se = get_seg_entry(sbi, segno);
2155 se->type = type;
2156 if (modified)
2157 __mark_sit_entry_dirty(sbi, segno);
2158}
2159
c5d02785
CY
2160static inline unsigned long long get_segment_mtime(struct f2fs_sb_info *sbi,
2161 block_t blkaddr)
6f3a01ae
CY
2162{
2163 unsigned int segno = GET_SEGNO(sbi, blkaddr);
c5d02785
CY
2164
2165 if (segno == NULL_SEGNO)
2166 return 0;
2167 return get_seg_entry(sbi, segno)->mtime;
2168}
2169
2170static void update_segment_mtime(struct f2fs_sb_info *sbi, block_t blkaddr,
2171 unsigned long long old_mtime)
2172{
2173 struct seg_entry *se;
2174 unsigned int segno = GET_SEGNO(sbi, blkaddr);
2175 unsigned long long ctime = get_mtime(sbi, false);
2176 unsigned long long mtime = old_mtime ? old_mtime : ctime;
2177
2178 if (segno == NULL_SEGNO)
2179 return;
2180
2181 se = get_seg_entry(sbi, segno);
6f3a01ae
CY
2182
2183 if (!se->mtime)
2184 se->mtime = mtime;
2185 else
2186 se->mtime = div_u64(se->mtime * se->valid_blocks + mtime,
2187 se->valid_blocks + 1);
2188
c5d02785
CY
2189 if (ctime > SIT_I(sbi)->max_mtime)
2190 SIT_I(sbi)->max_mtime = ctime;
6f3a01ae
CY
2191}
2192
351df4b2
JK
2193static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del)
2194{
2195 struct seg_entry *se;
2196 unsigned int segno, offset;
2197 long int new_vblocks;
6415fedc
YS
2198 bool exist;
2199#ifdef CONFIG_F2FS_CHECK_FS
2200 bool mir_exist;
2201#endif
351df4b2
JK
2202
2203 segno = GET_SEGNO(sbi, blkaddr);
2204
2205 se = get_seg_entry(sbi, segno);
2206 new_vblocks = se->valid_blocks + del;
491c0854 2207 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
351df4b2 2208
9feffe14 2209 f2fs_bug_on(sbi, (new_vblocks < 0 ||
de881df9 2210 (new_vblocks > f2fs_usable_blks_in_seg(sbi, segno))));
351df4b2
JK
2211
2212 se->valid_blocks = new_vblocks;
351df4b2
JK
2213
2214 /* Update valid block bitmap */
2215 if (del > 0) {
6415fedc 2216 exist = f2fs_test_and_set_bit(offset, se->cur_valid_map);
355e7891 2217#ifdef CONFIG_F2FS_CHECK_FS
6415fedc
YS
2218 mir_exist = f2fs_test_and_set_bit(offset,
2219 se->cur_valid_map_mir);
2220 if (unlikely(exist != mir_exist)) {
dcbb4c10
JP
2221 f2fs_err(sbi, "Inconsistent error when setting bitmap, blk:%u, old bit:%d",
2222 blkaddr, exist);
05796763 2223 f2fs_bug_on(sbi, 1);
6415fedc 2224 }
355e7891 2225#endif
6415fedc 2226 if (unlikely(exist)) {
dcbb4c10
JP
2227 f2fs_err(sbi, "Bitmap was wrongly set, blk:%u",
2228 blkaddr);
6415fedc 2229 f2fs_bug_on(sbi, 1);
35ee82ca
YS
2230 se->valid_blocks--;
2231 del = 0;
355e7891 2232 }
6415fedc 2233
7d20c8ab 2234 if (!f2fs_test_and_set_bit(offset, se->discard_map))
a66cdd98 2235 sbi->discard_blks--;
720037f9 2236
899fee36
CY
2237 /*
2238 * SSR should never reuse block which is checkpointed
2239 * or newly invalidated.
2240 */
2241 if (!is_sbi_flag_set(sbi, SBI_CP_DISABLED)) {
720037f9
JK
2242 if (!f2fs_test_and_set_bit(offset, se->ckpt_valid_map))
2243 se->ckpt_valid_blocks++;
2244 }
351df4b2 2245 } else {
6415fedc 2246 exist = f2fs_test_and_clear_bit(offset, se->cur_valid_map);
355e7891 2247#ifdef CONFIG_F2FS_CHECK_FS
6415fedc
YS
2248 mir_exist = f2fs_test_and_clear_bit(offset,
2249 se->cur_valid_map_mir);
2250 if (unlikely(exist != mir_exist)) {
dcbb4c10
JP
2251 f2fs_err(sbi, "Inconsistent error when clearing bitmap, blk:%u, old bit:%d",
2252 blkaddr, exist);
05796763 2253 f2fs_bug_on(sbi, 1);
6415fedc 2254 }
355e7891 2255#endif
6415fedc 2256 if (unlikely(!exist)) {
dcbb4c10
JP
2257 f2fs_err(sbi, "Bitmap was wrongly cleared, blk:%u",
2258 blkaddr);
6415fedc 2259 f2fs_bug_on(sbi, 1);
35ee82ca
YS
2260 se->valid_blocks++;
2261 del = 0;
4354994f
DR
2262 } else if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED))) {
2263 /*
2264 * If checkpoints are off, we must not reuse data that
2265 * was used in the previous checkpoint. If it was used
2266 * before, we must track that to know how much space we
2267 * really have.
2268 */
c9c8ed50
CY
2269 if (f2fs_test_bit(offset, se->ckpt_valid_map)) {
2270 spin_lock(&sbi->stat_lock);
4354994f 2271 sbi->unusable_block_count++;
c9c8ed50
CY
2272 spin_unlock(&sbi->stat_lock);
2273 }
355e7891 2274 }
6415fedc 2275
7d20c8ab 2276 if (f2fs_test_and_clear_bit(offset, se->discard_map))
a66cdd98 2277 sbi->discard_blks++;
351df4b2
JK
2278 }
2279 if (!f2fs_test_bit(offset, se->ckpt_valid_map))
2280 se->ckpt_valid_blocks += del;
2281
2282 __mark_sit_entry_dirty(sbi, segno);
2283
2284 /* update total number of valid blocks to be written in ckpt area */
2285 SIT_I(sbi)->written_valid_blocks += del;
2286
2c70c5e3 2287 if (__is_large_section(sbi))
351df4b2
JK
2288 get_sec_entry(sbi, segno)->valid_blocks += del;
2289}
2290
4d57b86d 2291void f2fs_invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr)
351df4b2
JK
2292{
2293 unsigned int segno = GET_SEGNO(sbi, addr);
2294 struct sit_info *sit_i = SIT_I(sbi);
2295
9850cf4a 2296 f2fs_bug_on(sbi, addr == NULL_ADDR);
4c8ff709 2297 if (addr == NEW_ADDR || addr == COMPRESS_ADDR)
351df4b2
JK
2298 return;
2299
6aa58d8a
CY
2300 invalidate_mapping_pages(META_MAPPING(sbi), addr, addr);
2301
351df4b2 2302 /* add it into sit main buffer */
3d26fa6b 2303 down_write(&sit_i->sentry_lock);
351df4b2 2304
c5d02785 2305 update_segment_mtime(sbi, addr, 0);
351df4b2
JK
2306 update_sit_entry(sbi, addr, -1);
2307
2308 /* add it into dirty seglist */
2309 locate_dirty_segment(sbi, segno);
2310
3d26fa6b 2311 up_write(&sit_i->sentry_lock);
351df4b2
JK
2312}
2313
4d57b86d 2314bool f2fs_is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr)
6e2c64ad
JK
2315{
2316 struct sit_info *sit_i = SIT_I(sbi);
2317 unsigned int segno, offset;
2318 struct seg_entry *se;
2319 bool is_cp = false;
2320
93770ab7 2321 if (!__is_valid_data_blkaddr(blkaddr))
6e2c64ad
JK
2322 return true;
2323
3d26fa6b 2324 down_read(&sit_i->sentry_lock);
6e2c64ad
JK
2325
2326 segno = GET_SEGNO(sbi, blkaddr);
2327 se = get_seg_entry(sbi, segno);
2328 offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
2329
2330 if (f2fs_test_bit(offset, se->ckpt_valid_map))
2331 is_cp = true;
2332
3d26fa6b 2333 up_read(&sit_i->sentry_lock);
6e2c64ad
JK
2334
2335 return is_cp;
2336}
2337
0a8165d7 2338/*
351df4b2
JK
2339 * This function should be resided under the curseg_mutex lock
2340 */
2341static void __add_sum_entry(struct f2fs_sb_info *sbi, int type,
e79efe3b 2342 struct f2fs_summary *sum)
351df4b2
JK
2343{
2344 struct curseg_info *curseg = CURSEG_I(sbi, type);
2345 void *addr = curseg->sum_blk;
e79efe3b 2346 addr += curseg->next_blkoff * sizeof(struct f2fs_summary);
351df4b2 2347 memcpy(addr, sum, sizeof(struct f2fs_summary));
351df4b2
JK
2348}
2349
0a8165d7 2350/*
351df4b2
JK
2351 * Calculate the number of current summary pages for writing
2352 */
4d57b86d 2353int f2fs_npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra)
351df4b2 2354{
351df4b2 2355 int valid_sum_count = 0;
9a47938b 2356 int i, sum_in_page;
351df4b2
JK
2357
2358 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
2359 if (sbi->ckpt->alloc_type[i] == SSR)
2360 valid_sum_count += sbi->blocks_per_seg;
3fa06d7b
CY
2361 else {
2362 if (for_ra)
2363 valid_sum_count += le16_to_cpu(
2364 F2FS_CKPT(sbi)->cur_data_blkoff[i]);
2365 else
2366 valid_sum_count += curseg_blkoff(sbi, i);
2367 }
351df4b2
JK
2368 }
2369
09cbfeaf 2370 sum_in_page = (PAGE_SIZE - 2 * SUM_JOURNAL_SIZE -
9a47938b
FL
2371 SUM_FOOTER_SIZE) / SUMMARY_SIZE;
2372 if (valid_sum_count <= sum_in_page)
351df4b2 2373 return 1;
9a47938b 2374 else if ((valid_sum_count - sum_in_page) <=
09cbfeaf 2375 (PAGE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE)
351df4b2
JK
2376 return 2;
2377 return 3;
2378}
2379
0a8165d7 2380/*
351df4b2
JK
2381 * Caller should put this summary page
2382 */
4d57b86d 2383struct page *f2fs_get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2 2384{
86f33603
JK
2385 if (unlikely(f2fs_cp_error(sbi)))
2386 return ERR_PTR(-EIO);
2387 return f2fs_get_meta_page_retry(sbi, GET_SUM_BLOCK(sbi, segno));
351df4b2
JK
2388}
2389
4d57b86d
CY
2390void f2fs_update_meta_page(struct f2fs_sb_info *sbi,
2391 void *src, block_t blk_addr)
351df4b2 2392{
4d57b86d 2393 struct page *page = f2fs_grab_meta_page(sbi, blk_addr);
381722d2 2394
0537b811 2395 memcpy(page_address(page), src, PAGE_SIZE);
351df4b2
JK
2396 set_page_dirty(page);
2397 f2fs_put_page(page, 1);
2398}
2399
381722d2
CY
2400static void write_sum_page(struct f2fs_sb_info *sbi,
2401 struct f2fs_summary_block *sum_blk, block_t blk_addr)
2402{
4d57b86d 2403 f2fs_update_meta_page(sbi, (void *)sum_blk, blk_addr);
381722d2
CY
2404}
2405
b7ad7512
CY
2406static void write_current_sum_page(struct f2fs_sb_info *sbi,
2407 int type, block_t blk_addr)
2408{
2409 struct curseg_info *curseg = CURSEG_I(sbi, type);
4d57b86d 2410 struct page *page = f2fs_grab_meta_page(sbi, blk_addr);
b7ad7512
CY
2411 struct f2fs_summary_block *src = curseg->sum_blk;
2412 struct f2fs_summary_block *dst;
2413
2414 dst = (struct f2fs_summary_block *)page_address(page);
81114baa 2415 memset(dst, 0, PAGE_SIZE);
b7ad7512
CY
2416
2417 mutex_lock(&curseg->curseg_mutex);
2418
2419 down_read(&curseg->journal_rwsem);
2420 memcpy(&dst->journal, curseg->journal, SUM_JOURNAL_SIZE);
2421 up_read(&curseg->journal_rwsem);
2422
2423 memcpy(dst->entries, src->entries, SUM_ENTRY_SIZE);
2424 memcpy(&dst->footer, &src->footer, SUM_FOOTER_SIZE);
2425
2426 mutex_unlock(&curseg->curseg_mutex);
2427
2428 set_page_dirty(page);
2429 f2fs_put_page(page, 1);
2430}
2431
093749e2
CY
2432static int is_next_segment_free(struct f2fs_sb_info *sbi,
2433 struct curseg_info *curseg, int type)
a7881893 2434{
a7881893
JK
2435 unsigned int segno = curseg->segno + 1;
2436 struct free_segmap_info *free_i = FREE_I(sbi);
2437
2438 if (segno < MAIN_SEGS(sbi) && segno % sbi->segs_per_sec)
2439 return !test_bit(segno, free_i->free_segmap);
2440 return 0;
2441}
2442
0a8165d7 2443/*
351df4b2
JK
2444 * Find a new segment from the free segments bitmap to right order
2445 * This function should be returned with success, otherwise BUG
2446 */
2447static void get_new_segment(struct f2fs_sb_info *sbi,
2448 unsigned int *newseg, bool new_sec, int dir)
2449{
2450 struct free_segmap_info *free_i = FREE_I(sbi);
351df4b2 2451 unsigned int segno, secno, zoneno;
7cd8558b 2452 unsigned int total_zones = MAIN_SECS(sbi) / sbi->secs_per_zone;
4ddb1a4d
JK
2453 unsigned int hint = GET_SEC_FROM_SEG(sbi, *newseg);
2454 unsigned int old_zoneno = GET_ZONE_FROM_SEG(sbi, *newseg);
351df4b2
JK
2455 unsigned int left_start = hint;
2456 bool init = true;
2457 int go_left = 0;
2458 int i;
2459
1a118ccf 2460 spin_lock(&free_i->segmap_lock);
351df4b2
JK
2461
2462 if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) {
2463 segno = find_next_zero_bit(free_i->free_segmap,
4ddb1a4d
JK
2464 GET_SEG_FROM_SEC(sbi, hint + 1), *newseg + 1);
2465 if (segno < GET_SEG_FROM_SEC(sbi, hint + 1))
351df4b2
JK
2466 goto got_it;
2467 }
2468find_other_zone:
7cd8558b
JK
2469 secno = find_next_zero_bit(free_i->free_secmap, MAIN_SECS(sbi), hint);
2470 if (secno >= MAIN_SECS(sbi)) {
351df4b2
JK
2471 if (dir == ALLOC_RIGHT) {
2472 secno = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK
2473 MAIN_SECS(sbi), 0);
2474 f2fs_bug_on(sbi, secno >= MAIN_SECS(sbi));
351df4b2
JK
2475 } else {
2476 go_left = 1;
2477 left_start = hint - 1;
2478 }
2479 }
2480 if (go_left == 0)
2481 goto skip_left;
2482
2483 while (test_bit(left_start, free_i->free_secmap)) {
2484 if (left_start > 0) {
2485 left_start--;
2486 continue;
2487 }
2488 left_start = find_next_zero_bit(free_i->free_secmap,
7cd8558b
JK
2489 MAIN_SECS(sbi), 0);
2490 f2fs_bug_on(sbi, left_start >= MAIN_SECS(sbi));
351df4b2
JK
2491 break;
2492 }
2493 secno = left_start;
2494skip_left:
4ddb1a4d
JK
2495 segno = GET_SEG_FROM_SEC(sbi, secno);
2496 zoneno = GET_ZONE_FROM_SEC(sbi, secno);
351df4b2
JK
2497
2498 /* give up on finding another zone */
2499 if (!init)
2500 goto got_it;
2501 if (sbi->secs_per_zone == 1)
2502 goto got_it;
2503 if (zoneno == old_zoneno)
2504 goto got_it;
2505 if (dir == ALLOC_LEFT) {
2506 if (!go_left && zoneno + 1 >= total_zones)
2507 goto got_it;
2508 if (go_left && zoneno == 0)
2509 goto got_it;
2510 }
2511 for (i = 0; i < NR_CURSEG_TYPE; i++)
2512 if (CURSEG_I(sbi, i)->zone == zoneno)
2513 break;
2514
2515 if (i < NR_CURSEG_TYPE) {
2516 /* zone is in user, try another */
2517 if (go_left)
2518 hint = zoneno * sbi->secs_per_zone - 1;
2519 else if (zoneno + 1 >= total_zones)
2520 hint = 0;
2521 else
2522 hint = (zoneno + 1) * sbi->secs_per_zone;
2523 init = false;
2524 goto find_other_zone;
2525 }
2526got_it:
2527 /* set it as dirty segment in free segmap */
9850cf4a 2528 f2fs_bug_on(sbi, test_bit(segno, free_i->free_segmap));
351df4b2
JK
2529 __set_inuse(sbi, segno);
2530 *newseg = segno;
1a118ccf 2531 spin_unlock(&free_i->segmap_lock);
351df4b2
JK
2532}
2533
2534static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified)
2535{
2536 struct curseg_info *curseg = CURSEG_I(sbi, type);
2537 struct summary_footer *sum_footer;
093749e2 2538 unsigned short seg_type = curseg->seg_type;
351df4b2 2539
d0b9e42a 2540 curseg->inited = true;
351df4b2 2541 curseg->segno = curseg->next_segno;
4ddb1a4d 2542 curseg->zone = GET_ZONE_FROM_SEG(sbi, curseg->segno);
351df4b2
JK
2543 curseg->next_blkoff = 0;
2544 curseg->next_segno = NULL_SEGNO;
2545
2546 sum_footer = &(curseg->sum_blk->footer);
2547 memset(sum_footer, 0, sizeof(struct summary_footer));
093749e2
CY
2548
2549 sanity_check_seg_type(sbi, seg_type);
2550
2551 if (IS_DATASEG(seg_type))
351df4b2 2552 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA);
093749e2 2553 if (IS_NODESEG(seg_type))
351df4b2 2554 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE);
093749e2 2555 __set_sit_entry_type(sbi, seg_type, curseg->segno, modified);
351df4b2
JK
2556}
2557
7a20b8a6
JK
2558static unsigned int __get_next_segno(struct f2fs_sb_info *sbi, int type)
2559{
d0b9e42a 2560 struct curseg_info *curseg = CURSEG_I(sbi, type);
093749e2
CY
2561 unsigned short seg_type = curseg->seg_type;
2562
2563 sanity_check_seg_type(sbi, seg_type);
d0b9e42a 2564
a7881893 2565 /* if segs_per_sec is large than 1, we need to keep original policy. */
2c70c5e3 2566 if (__is_large_section(sbi))
d0b9e42a
CY
2567 return curseg->segno;
2568
2569 /* inmem log may not locate on any segment after mount */
2570 if (!curseg->inited)
2571 return 0;
a7881893 2572
4354994f
DR
2573 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
2574 return 0;
2575
b94929d9 2576 if (test_opt(sbi, NOHEAP) &&
093749e2 2577 (seg_type == CURSEG_HOT_DATA || IS_NODESEG(seg_type)))
7a20b8a6
JK
2578 return 0;
2579
e066b83c
JK
2580 if (SIT_I(sbi)->last_victim[ALLOC_NEXT])
2581 return SIT_I(sbi)->last_victim[ALLOC_NEXT];
07939627
JK
2582
2583 /* find segments from 0 to reuse freed segments */
63189b78 2584 if (F2FS_OPTION(sbi).alloc_mode == ALLOC_MODE_REUSE)
07939627
JK
2585 return 0;
2586
d0b9e42a 2587 return curseg->segno;
7a20b8a6
JK
2588}
2589
0a8165d7 2590/*
351df4b2
JK
2591 * Allocate a current working segment.
2592 * This function always allocates a free segment in LFS manner.
2593 */
2594static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec)
2595{
2596 struct curseg_info *curseg = CURSEG_I(sbi, type);
d0b9e42a 2597 unsigned short seg_type = curseg->seg_type;
351df4b2
JK
2598 unsigned int segno = curseg->segno;
2599 int dir = ALLOC_LEFT;
2600
d0b9e42a
CY
2601 if (curseg->inited)
2602 write_sum_page(sbi, curseg->sum_blk,
81fb5e87 2603 GET_SUM_BLOCK(sbi, segno));
d0b9e42a 2604 if (seg_type == CURSEG_WARM_DATA || seg_type == CURSEG_COLD_DATA)
351df4b2
JK
2605 dir = ALLOC_RIGHT;
2606
2607 if (test_opt(sbi, NOHEAP))
2608 dir = ALLOC_RIGHT;
2609
7a20b8a6 2610 segno = __get_next_segno(sbi, type);
351df4b2
JK
2611 get_new_segment(sbi, &segno, new_sec, dir);
2612 curseg->next_segno = segno;
2613 reset_curseg(sbi, type, 1);
2614 curseg->alloc_type = LFS;
2615}
2616
2617static void __next_free_blkoff(struct f2fs_sb_info *sbi,
2618 struct curseg_info *seg, block_t start)
2619{
2620 struct seg_entry *se = get_seg_entry(sbi, seg->segno);
e81c93cf 2621 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
60a3b782 2622 unsigned long *target_map = SIT_I(sbi)->tmp_map;
e81c93cf
CL
2623 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
2624 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
2625 int i, pos;
2626
2627 for (i = 0; i < entries; i++)
2628 target_map[i] = ckpt_map[i] | cur_map[i];
2629
2630 pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start);
2631
2632 seg->next_blkoff = pos;
351df4b2
JK
2633}
2634
0a8165d7 2635/*
351df4b2
JK
2636 * If a segment is written by LFS manner, next block offset is just obtained
2637 * by increasing the current block offset. However, if a segment is written by
2638 * SSR manner, next block offset obtained by calling __next_free_blkoff
2639 */
2640static void __refresh_next_blkoff(struct f2fs_sb_info *sbi,
2641 struct curseg_info *seg)
2642{
2643 if (seg->alloc_type == SSR)
2644 __next_free_blkoff(sbi, seg, seg->next_blkoff + 1);
2645 else
2646 seg->next_blkoff++;
2647}
2648
0a8165d7 2649/*
e1c42045 2650 * This function always allocates a used segment(from dirty seglist) by SSR
351df4b2
JK
2651 * manner, so it should recover the existing segment information of valid blocks
2652 */
093749e2 2653static void change_curseg(struct f2fs_sb_info *sbi, int type, bool flush)
351df4b2
JK
2654{
2655 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
2656 struct curseg_info *curseg = CURSEG_I(sbi, type);
2657 unsigned int new_segno = curseg->next_segno;
2658 struct f2fs_summary_block *sum_node;
2659 struct page *sum_page;
2660
093749e2
CY
2661 if (flush)
2662 write_sum_page(sbi, curseg->sum_blk,
2663 GET_SUM_BLOCK(sbi, curseg->segno));
2664
351df4b2
JK
2665 __set_test_and_inuse(sbi, new_segno);
2666
2667 mutex_lock(&dirty_i->seglist_lock);
2668 __remove_dirty_segment(sbi, new_segno, PRE);
2669 __remove_dirty_segment(sbi, new_segno, DIRTY);
2670 mutex_unlock(&dirty_i->seglist_lock);
2671
2672 reset_curseg(sbi, type, 1);
2673 curseg->alloc_type = SSR;
2674 __next_free_blkoff(sbi, curseg, 0);
2675
4d57b86d 2676 sum_page = f2fs_get_sum_page(sbi, new_segno);
86f33603
JK
2677 if (IS_ERR(sum_page)) {
2678 /* GC won't be able to use stale summary pages by cp_error */
2679 memset(curseg->sum_blk, 0, SUM_ENTRY_SIZE);
2680 return;
2681 }
025d63a4
CY
2682 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
2683 memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE);
2684 f2fs_put_page(sum_page, 1);
351df4b2
JK
2685}
2686
093749e2
CY
2687static int get_ssr_segment(struct f2fs_sb_info *sbi, int type,
2688 int alloc_mode, unsigned long long age);
2689
2690static void get_atssr_segment(struct f2fs_sb_info *sbi, int type,
2691 int target_type, int alloc_mode,
2692 unsigned long long age)
2693{
2694 struct curseg_info *curseg = CURSEG_I(sbi, type);
2695
2696 curseg->seg_type = target_type;
2697
2698 if (get_ssr_segment(sbi, type, alloc_mode, age)) {
2699 struct seg_entry *se = get_seg_entry(sbi, curseg->next_segno);
2700
2701 curseg->seg_type = se->type;
2702 change_curseg(sbi, type, true);
2703 } else {
2704 /* allocate cold segment by default */
2705 curseg->seg_type = CURSEG_COLD_DATA;
2706 new_curseg(sbi, type, true);
2707 }
2708 stat_inc_seg_type(sbi, curseg);
2709}
2710
2711static void __f2fs_init_atgc_curseg(struct f2fs_sb_info *sbi)
2712{
2713 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_ALL_DATA_ATGC);
2714
2715 if (!sbi->am.atgc_enabled)
2716 return;
2717
2718 down_read(&SM_I(sbi)->curseg_lock);
2719
2720 mutex_lock(&curseg->curseg_mutex);
2721 down_write(&SIT_I(sbi)->sentry_lock);
2722
2723 get_atssr_segment(sbi, CURSEG_ALL_DATA_ATGC, CURSEG_COLD_DATA, SSR, 0);
2724
2725 up_write(&SIT_I(sbi)->sentry_lock);
2726 mutex_unlock(&curseg->curseg_mutex);
2727
2728 up_read(&SM_I(sbi)->curseg_lock);
2729
2730}
2731void f2fs_init_inmem_curseg(struct f2fs_sb_info *sbi)
2732{
2733 __f2fs_init_atgc_curseg(sbi);
2734}
2735
2736static void __f2fs_save_inmem_curseg(struct f2fs_sb_info *sbi, int type)
d0b9e42a
CY
2737{
2738 struct curseg_info *curseg = CURSEG_I(sbi, type);
2739
2740 mutex_lock(&curseg->curseg_mutex);
2741 if (!curseg->inited)
2742 goto out;
2743
2744 if (get_valid_blocks(sbi, curseg->segno, false)) {
2745 write_sum_page(sbi, curseg->sum_blk,
2746 GET_SUM_BLOCK(sbi, curseg->segno));
2747 } else {
2748 mutex_lock(&DIRTY_I(sbi)->seglist_lock);
2749 __set_test_and_free(sbi, curseg->segno, true);
2750 mutex_unlock(&DIRTY_I(sbi)->seglist_lock);
2751 }
2752out:
2753 mutex_unlock(&curseg->curseg_mutex);
2754}
2755
093749e2
CY
2756void f2fs_save_inmem_curseg(struct f2fs_sb_info *sbi)
2757{
2758 __f2fs_save_inmem_curseg(sbi, CURSEG_COLD_DATA_PINNED);
2759
2760 if (sbi->am.atgc_enabled)
2761 __f2fs_save_inmem_curseg(sbi, CURSEG_ALL_DATA_ATGC);
2762}
2763
2764static void __f2fs_restore_inmem_curseg(struct f2fs_sb_info *sbi, int type)
d0b9e42a
CY
2765{
2766 struct curseg_info *curseg = CURSEG_I(sbi, type);
2767
2768 mutex_lock(&curseg->curseg_mutex);
2769 if (!curseg->inited)
2770 goto out;
2771 if (get_valid_blocks(sbi, curseg->segno, false))
2772 goto out;
2773
2774 mutex_lock(&DIRTY_I(sbi)->seglist_lock);
2775 __set_test_and_inuse(sbi, curseg->segno);
2776 mutex_unlock(&DIRTY_I(sbi)->seglist_lock);
2777out:
2778 mutex_unlock(&curseg->curseg_mutex);
2779}
2780
093749e2
CY
2781void f2fs_restore_inmem_curseg(struct f2fs_sb_info *sbi)
2782{
2783 __f2fs_restore_inmem_curseg(sbi, CURSEG_COLD_DATA_PINNED);
2784
2785 if (sbi->am.atgc_enabled)
2786 __f2fs_restore_inmem_curseg(sbi, CURSEG_ALL_DATA_ATGC);
2787}
2788
2789static int get_ssr_segment(struct f2fs_sb_info *sbi, int type,
2790 int alloc_mode, unsigned long long age)
43727527
JK
2791{
2792 struct curseg_info *curseg = CURSEG_I(sbi, type);
2793 const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops;
e066b83c 2794 unsigned segno = NULL_SEGNO;
093749e2 2795 unsigned short seg_type = curseg->seg_type;
d27c3d89
CY
2796 int i, cnt;
2797 bool reversed = false;
c192f7a4 2798
093749e2
CY
2799 sanity_check_seg_type(sbi, seg_type);
2800
4d57b86d 2801 /* f2fs_need_SSR() already forces to do this */
093749e2 2802 if (!v_ops->get_victim(sbi, &segno, BG_GC, seg_type, alloc_mode, age)) {
e066b83c 2803 curseg->next_segno = segno;
c192f7a4 2804 return 1;
e066b83c 2805 }
43727527 2806
70d625cb 2807 /* For node segments, let's do SSR more intensively */
093749e2
CY
2808 if (IS_NODESEG(seg_type)) {
2809 if (seg_type >= CURSEG_WARM_NODE) {
d27c3d89
CY
2810 reversed = true;
2811 i = CURSEG_COLD_NODE;
2812 } else {
2813 i = CURSEG_HOT_NODE;
2814 }
2815 cnt = NR_CURSEG_NODE_TYPE;
70d625cb 2816 } else {
093749e2 2817 if (seg_type >= CURSEG_WARM_DATA) {
d27c3d89
CY
2818 reversed = true;
2819 i = CURSEG_COLD_DATA;
2820 } else {
2821 i = CURSEG_HOT_DATA;
2822 }
2823 cnt = NR_CURSEG_DATA_TYPE;
70d625cb 2824 }
43727527 2825
d27c3d89 2826 for (; cnt-- > 0; reversed ? i-- : i++) {
093749e2 2827 if (i == seg_type)
c192f7a4 2828 continue;
093749e2 2829 if (!v_ops->get_victim(sbi, &segno, BG_GC, i, alloc_mode, age)) {
e066b83c 2830 curseg->next_segno = segno;
43727527 2831 return 1;
e066b83c 2832 }
c192f7a4 2833 }
4354994f
DR
2834
2835 /* find valid_blocks=0 in dirty list */
2836 if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED))) {
2837 segno = get_free_segment(sbi);
2838 if (segno != NULL_SEGNO) {
2839 curseg->next_segno = segno;
2840 return 1;
2841 }
2842 }
43727527
JK
2843 return 0;
2844}
2845
351df4b2
JK
2846/*
2847 * flush out current segment and replace it with new segment
2848 * This function should be returned with success, otherwise BUG
2849 */
2850static void allocate_segment_by_default(struct f2fs_sb_info *sbi,
2851 int type, bool force)
2852{
a7881893
JK
2853 struct curseg_info *curseg = CURSEG_I(sbi, type);
2854
7b405275 2855 if (force)
351df4b2 2856 new_curseg(sbi, type, true);
5b6c6be2 2857 else if (!is_set_ckpt_flags(sbi, CP_CRC_RECOVERY_FLAG) &&
093749e2 2858 curseg->seg_type == CURSEG_WARM_NODE)
351df4b2 2859 new_curseg(sbi, type, false);
093749e2
CY
2860 else if (curseg->alloc_type == LFS &&
2861 is_next_segment_free(sbi, curseg, type) &&
4354994f 2862 likely(!is_sbi_flag_set(sbi, SBI_CP_DISABLED)))
a7881893 2863 new_curseg(sbi, type, false);
093749e2
CY
2864 else if (f2fs_need_SSR(sbi) &&
2865 get_ssr_segment(sbi, type, SSR, 0))
2866 change_curseg(sbi, type, true);
351df4b2
JK
2867 else
2868 new_curseg(sbi, type, false);
dcdfff65 2869
a7881893 2870 stat_inc_seg_type(sbi, curseg);
351df4b2
JK
2871}
2872
0ef81833 2873void f2fs_allocate_segment_for_resize(struct f2fs_sb_info *sbi, int type,
04f0b2ea
QS
2874 unsigned int start, unsigned int end)
2875{
2876 struct curseg_info *curseg = CURSEG_I(sbi, type);
2877 unsigned int segno;
2878
2879 down_read(&SM_I(sbi)->curseg_lock);
2880 mutex_lock(&curseg->curseg_mutex);
2881 down_write(&SIT_I(sbi)->sentry_lock);
2882
2883 segno = CURSEG_I(sbi, type)->segno;
2884 if (segno < start || segno > end)
2885 goto unlock;
2886
093749e2
CY
2887 if (f2fs_need_SSR(sbi) && get_ssr_segment(sbi, type, SSR, 0))
2888 change_curseg(sbi, type, true);
04f0b2ea
QS
2889 else
2890 new_curseg(sbi, type, true);
2891
2892 stat_inc_seg_type(sbi, curseg);
2893
2894 locate_dirty_segment(sbi, segno);
2895unlock:
2896 up_write(&SIT_I(sbi)->sentry_lock);
2897
2898 if (segno != curseg->segno)
dcbb4c10
JP
2899 f2fs_notice(sbi, "For resize: curseg of type %d: %u ==> %u",
2900 type, segno, curseg->segno);
04f0b2ea
QS
2901
2902 mutex_unlock(&curseg->curseg_mutex);
2903 up_read(&SM_I(sbi)->curseg_lock);
2904}
2905
901d745f 2906static void __allocate_new_segment(struct f2fs_sb_info *sbi, int type)
351df4b2 2907{
901d745f 2908 struct curseg_info *curseg = CURSEG_I(sbi, type);
6ae1be13 2909 unsigned int old_segno;
351df4b2 2910
d0b9e42a
CY
2911 if (!curseg->inited)
2912 goto alloc;
2913
901d745f
CY
2914 if (!curseg->next_blkoff &&
2915 !get_valid_blocks(sbi, curseg->segno, false) &&
2916 !get_ckpt_valid_blocks(sbi, curseg->segno))
2917 return;
3d26fa6b 2918
d0b9e42a 2919alloc:
901d745f
CY
2920 old_segno = curseg->segno;
2921 SIT_I(sbi)->s_ops->allocate_segment(sbi, type, true);
2922 locate_dirty_segment(sbi, old_segno);
2923}
f5a53edc 2924
901d745f
CY
2925void f2fs_allocate_new_segment(struct f2fs_sb_info *sbi, int type)
2926{
2927 down_write(&SIT_I(sbi)->sentry_lock);
2928 __allocate_new_segment(sbi, type);
2929 up_write(&SIT_I(sbi)->sentry_lock);
2930}
3d26fa6b 2931
901d745f
CY
2932void f2fs_allocate_new_segments(struct f2fs_sb_info *sbi)
2933{
2934 int i;
2935
2936 down_write(&SIT_I(sbi)->sentry_lock);
2937 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++)
2938 __allocate_new_segment(sbi, i);
3d26fa6b 2939 up_write(&SIT_I(sbi)->sentry_lock);
351df4b2
JK
2940}
2941
2942static const struct segment_allocation default_salloc_ops = {
2943 .allocate_segment = allocate_segment_by_default,
2944};
2945
4d57b86d
CY
2946bool f2fs_exist_trim_candidates(struct f2fs_sb_info *sbi,
2947 struct cp_control *cpc)
25290fa5
JK
2948{
2949 __u64 trim_start = cpc->trim_start;
2950 bool has_candidate = false;
2951
3d26fa6b 2952 down_write(&SIT_I(sbi)->sentry_lock);
25290fa5
JK
2953 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++) {
2954 if (add_discard_addrs(sbi, cpc, true)) {
2955 has_candidate = true;
2956 break;
2957 }
2958 }
3d26fa6b 2959 up_write(&SIT_I(sbi)->sentry_lock);
25290fa5
JK
2960
2961 cpc->trim_start = trim_start;
2962 return has_candidate;
2963}
2964
01f9cf6d 2965static unsigned int __issue_discard_cmd_range(struct f2fs_sb_info *sbi,
9a997188
JK
2966 struct discard_policy *dpolicy,
2967 unsigned int start, unsigned int end)
2968{
2969 struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info;
2970 struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
2971 struct rb_node **insert_p = NULL, *insert_parent = NULL;
2972 struct discard_cmd *dc;
2973 struct blk_plug plug;
2974 int issued;
01f9cf6d 2975 unsigned int trimmed = 0;
9a997188
JK
2976
2977next:
2978 issued = 0;
2979
2980 mutex_lock(&dcc->cmd_lock);
67fce70b
CY
2981 if (unlikely(dcc->rbtree_check))
2982 f2fs_bug_on(sbi, !f2fs_check_rb_tree_consistence(sbi,
2e9b2bb2 2983 &dcc->root, false));
9a997188 2984
4d57b86d 2985 dc = (struct discard_cmd *)f2fs_lookup_rb_tree_ret(&dcc->root,
9a997188
JK
2986 NULL, start,
2987 (struct rb_entry **)&prev_dc,
2988 (struct rb_entry **)&next_dc,
4dada3fd 2989 &insert_p, &insert_parent, true, NULL);
9a997188
JK
2990 if (!dc)
2991 dc = next_dc;
2992
2993 blk_start_plug(&plug);
2994
2995 while (dc && dc->lstart <= end) {
2996 struct rb_node *node;
6b9cb124 2997 int err = 0;
9a997188
JK
2998
2999 if (dc->len < dpolicy->granularity)
3000 goto skip;
3001
3002 if (dc->state != D_PREP) {
3003 list_move_tail(&dc->list, &dcc->fstrim_list);
3004 goto skip;
3005 }
3006
6b9cb124 3007 err = __submit_discard_cmd(sbi, dpolicy, dc, &issued);
9a997188 3008
35ec7d57 3009 if (issued >= dpolicy->max_requests) {
9a997188
JK
3010 start = dc->lstart + dc->len;
3011
6b9cb124
CY
3012 if (err)
3013 __remove_discard_cmd(sbi, dc);
3014
9a997188
JK
3015 blk_finish_plug(&plug);
3016 mutex_unlock(&dcc->cmd_lock);
01f9cf6d 3017 trimmed += __wait_all_discard_cmd(sbi, NULL);
5df7731f 3018 congestion_wait(BLK_RW_ASYNC, DEFAULT_IO_TIMEOUT);
9a997188
JK
3019 goto next;
3020 }
3021skip:
3022 node = rb_next(&dc->rb_node);
6b9cb124
CY
3023 if (err)
3024 __remove_discard_cmd(sbi, dc);
9a997188
JK
3025 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
3026
3027 if (fatal_signal_pending(current))
3028 break;
3029 }
3030
3031 blk_finish_plug(&plug);
3032 mutex_unlock(&dcc->cmd_lock);
01f9cf6d
CY
3033
3034 return trimmed;
9a997188
JK
3035}
3036
4b2fecc8
JK
3037int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range)
3038{
f7ef9b83
JK
3039 __u64 start = F2FS_BYTES_TO_BLK(range->start);
3040 __u64 end = start + F2FS_BYTES_TO_BLK(range->len) - 1;
377224c4 3041 unsigned int start_segno, end_segno;
8412663d 3042 block_t start_block, end_block;
4b2fecc8 3043 struct cp_control cpc;
78997b56 3044 struct discard_policy dpolicy;
0ea80512 3045 unsigned long long trimmed = 0;
c34f42e2 3046 int err = 0;
b0332a0f 3047 bool need_align = f2fs_lfs_mode(sbi) && __is_large_section(sbi);
4b2fecc8 3048
836b5a63 3049 if (start >= MAX_BLKADDR(sbi) || range->len < sbi->blocksize)
4b2fecc8
JK
3050 return -EINVAL;
3051
3f16ecd9
CY
3052 if (end < MAIN_BLKADDR(sbi))
3053 goto out;
4b2fecc8 3054
ed214a11 3055 if (is_sbi_flag_set(sbi, SBI_NEED_FSCK)) {
dcbb4c10 3056 f2fs_warn(sbi, "Found FS corruption, run fsck to fix.");
10f966bb 3057 return -EFSCORRUPTED;
ed214a11
YH
3058 }
3059
4b2fecc8 3060 /* start/end segment number in main_area */
7cd8558b
JK
3061 start_segno = (start <= MAIN_BLKADDR(sbi)) ? 0 : GET_SEGNO(sbi, start);
3062 end_segno = (end >= MAX_BLKADDR(sbi)) ? MAIN_SEGS(sbi) - 1 :
3063 GET_SEGNO(sbi, end);
ad6672bb
YS
3064 if (need_align) {
3065 start_segno = rounddown(start_segno, sbi->segs_per_sec);
3066 end_segno = roundup(end_segno + 1, sbi->segs_per_sec) - 1;
3067 }
8412663d 3068
4b2fecc8 3069 cpc.reason = CP_DISCARD;
836b5a63 3070 cpc.trim_minlen = max_t(__u64, 1, F2FS_BYTES_TO_BLK(range->minlen));
377224c4
CY
3071 cpc.trim_start = start_segno;
3072 cpc.trim_end = end_segno;
4b2fecc8 3073
377224c4
CY
3074 if (sbi->discard_blks == 0)
3075 goto out;
74fa5f3d 3076
fb24fea7 3077 down_write(&sbi->gc_lock);
4d57b86d 3078 err = f2fs_write_checkpoint(sbi, &cpc);
fb24fea7 3079 up_write(&sbi->gc_lock);
377224c4
CY
3080 if (err)
3081 goto out;
8412663d 3082
e555da9f
JK
3083 /*
3084 * We filed discard candidates, but actually we don't need to wait for
3085 * all of them, since they'll be issued in idle time along with runtime
3086 * discard option. User configuration looks like using runtime discard
3087 * or periodic fstrim instead of it.
3088 */
7d20c8ab 3089 if (f2fs_realtime_discard_enable(sbi))
5a615492
JK
3090 goto out;
3091
3092 start_block = START_BLOCK(sbi, start_segno);
3093 end_block = START_BLOCK(sbi, end_segno + 1);
3094
3095 __init_discard_policy(sbi, &dpolicy, DPOLICY_FSTRIM, cpc.trim_minlen);
01f9cf6d
CY
3096 trimmed = __issue_discard_cmd_range(sbi, &dpolicy,
3097 start_block, end_block);
5a615492 3098
01f9cf6d 3099 trimmed += __wait_discard_cmd_range(sbi, &dpolicy,
0ea80512 3100 start_block, end_block);
377224c4 3101out:
6eae2694
CY
3102 if (!err)
3103 range->len = F2FS_BLK_TO_BYTES(trimmed);
c34f42e2 3104 return err;
4b2fecc8
JK
3105}
3106
093749e2
CY
3107static bool __has_curseg_space(struct f2fs_sb_info *sbi,
3108 struct curseg_info *curseg)
351df4b2 3109{
de881df9
AR
3110 return curseg->next_blkoff < f2fs_usable_blks_in_seg(sbi,
3111 curseg->segno);
351df4b2
JK
3112}
3113
4d57b86d 3114int f2fs_rw_hint_to_seg_type(enum rw_hint hint)
4f0a03d3
HL
3115{
3116 switch (hint) {
3117 case WRITE_LIFE_SHORT:
3118 return CURSEG_HOT_DATA;
3119 case WRITE_LIFE_EXTREME:
3120 return CURSEG_COLD_DATA;
3121 default:
3122 return CURSEG_WARM_DATA;
3123 }
3124}
3125
0cdd3195
HL
3126/* This returns write hints for each segment type. This hints will be
3127 * passed down to block layer. There are mapping tables which depend on
3128 * the mount option 'whint_mode'.
3129 *
3130 * 1) whint_mode=off. F2FS only passes down WRITE_LIFE_NOT_SET.
3131 *
3132 * 2) whint_mode=user-based. F2FS tries to pass down hints given by users.
3133 *
3134 * User F2FS Block
3135 * ---- ---- -----
3136 * META WRITE_LIFE_NOT_SET
3137 * HOT_NODE "
3138 * WARM_NODE "
3139 * COLD_NODE "
3140 * ioctl(COLD) COLD_DATA WRITE_LIFE_EXTREME
3141 * extension list " "
3142 *
3143 * -- buffered io
3144 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
3145 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
3146 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
3147 * WRITE_LIFE_NONE " "
3148 * WRITE_LIFE_MEDIUM " "
3149 * WRITE_LIFE_LONG " "
3150 *
3151 * -- direct io
3152 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
3153 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
3154 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
3155 * WRITE_LIFE_NONE " WRITE_LIFE_NONE
3156 * WRITE_LIFE_MEDIUM " WRITE_LIFE_MEDIUM
3157 * WRITE_LIFE_LONG " WRITE_LIFE_LONG
3158 *
f2e703f9
HL
3159 * 3) whint_mode=fs-based. F2FS passes down hints with its policy.
3160 *
3161 * User F2FS Block
3162 * ---- ---- -----
3163 * META WRITE_LIFE_MEDIUM;
3164 * HOT_NODE WRITE_LIFE_NOT_SET
3165 * WARM_NODE "
3166 * COLD_NODE WRITE_LIFE_NONE
3167 * ioctl(COLD) COLD_DATA WRITE_LIFE_EXTREME
3168 * extension list " "
3169 *
3170 * -- buffered io
3171 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
3172 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
3173 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_LONG
3174 * WRITE_LIFE_NONE " "
3175 * WRITE_LIFE_MEDIUM " "
3176 * WRITE_LIFE_LONG " "
3177 *
3178 * -- direct io
3179 * WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
3180 * WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
3181 * WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
3182 * WRITE_LIFE_NONE " WRITE_LIFE_NONE
3183 * WRITE_LIFE_MEDIUM " WRITE_LIFE_MEDIUM
3184 * WRITE_LIFE_LONG " WRITE_LIFE_LONG
0cdd3195
HL
3185 */
3186
4d57b86d 3187enum rw_hint f2fs_io_type_to_rw_hint(struct f2fs_sb_info *sbi,
0cdd3195
HL
3188 enum page_type type, enum temp_type temp)
3189{
63189b78 3190 if (F2FS_OPTION(sbi).whint_mode == WHINT_MODE_USER) {
0cdd3195 3191 if (type == DATA) {
f2e703f9 3192 if (temp == WARM)
0cdd3195 3193 return WRITE_LIFE_NOT_SET;
f2e703f9
HL
3194 else if (temp == HOT)
3195 return WRITE_LIFE_SHORT;
3196 else if (temp == COLD)
3197 return WRITE_LIFE_EXTREME;
0cdd3195
HL
3198 } else {
3199 return WRITE_LIFE_NOT_SET;
3200 }
63189b78 3201 } else if (F2FS_OPTION(sbi).whint_mode == WHINT_MODE_FS) {
f2e703f9
HL
3202 if (type == DATA) {
3203 if (temp == WARM)
3204 return WRITE_LIFE_LONG;
3205 else if (temp == HOT)
3206 return WRITE_LIFE_SHORT;
3207 else if (temp == COLD)
3208 return WRITE_LIFE_EXTREME;
3209 } else if (type == NODE) {
3210 if (temp == WARM || temp == HOT)
3211 return WRITE_LIFE_NOT_SET;
3212 else if (temp == COLD)
3213 return WRITE_LIFE_NONE;
3214 } else if (type == META) {
3215 return WRITE_LIFE_MEDIUM;
3216 }
0cdd3195 3217 }
f2e703f9 3218 return WRITE_LIFE_NOT_SET;
0cdd3195
HL
3219}
3220
81377bd6 3221static int __get_segment_type_2(struct f2fs_io_info *fio)
351df4b2 3222{
81377bd6 3223 if (fio->type == DATA)
351df4b2
JK
3224 return CURSEG_HOT_DATA;
3225 else
3226 return CURSEG_HOT_NODE;
3227}
3228
81377bd6 3229static int __get_segment_type_4(struct f2fs_io_info *fio)
351df4b2 3230{
81377bd6
JK
3231 if (fio->type == DATA) {
3232 struct inode *inode = fio->page->mapping->host;
351df4b2
JK
3233
3234 if (S_ISDIR(inode->i_mode))
3235 return CURSEG_HOT_DATA;
3236 else
3237 return CURSEG_COLD_DATA;
3238 } else {
81377bd6 3239 if (IS_DNODE(fio->page) && is_cold_node(fio->page))
a344b9fd 3240 return CURSEG_WARM_NODE;
351df4b2
JK
3241 else
3242 return CURSEG_COLD_NODE;
3243 }
3244}
3245
81377bd6 3246static int __get_segment_type_6(struct f2fs_io_info *fio)
351df4b2 3247{
81377bd6
JK
3248 if (fio->type == DATA) {
3249 struct inode *inode = fio->page->mapping->host;
351df4b2 3250
093749e2
CY
3251 if (is_cold_data(fio->page)) {
3252 if (fio->sbi->am.atgc_enabled)
3253 return CURSEG_ALL_DATA_ATGC;
3254 else
3255 return CURSEG_COLD_DATA;
3256 }
3257 if (file_is_cold(inode) || f2fs_compressed_file(inode))
351df4b2 3258 return CURSEG_COLD_DATA;
b6a06cbb 3259 if (file_is_hot(inode) ||
b4c3ca8b 3260 is_inode_flag_set(inode, FI_HOT_DATA) ||
2079f115
CY
3261 f2fs_is_atomic_file(inode) ||
3262 f2fs_is_volatile_file(inode))
ef095d19 3263 return CURSEG_HOT_DATA;
4d57b86d 3264 return f2fs_rw_hint_to_seg_type(inode->i_write_hint);
351df4b2 3265 } else {
81377bd6
JK
3266 if (IS_DNODE(fio->page))
3267 return is_cold_node(fio->page) ? CURSEG_WARM_NODE :
351df4b2 3268 CURSEG_HOT_NODE;
ef095d19 3269 return CURSEG_COLD_NODE;
351df4b2
JK
3270 }
3271}
3272
81377bd6 3273static int __get_segment_type(struct f2fs_io_info *fio)
351df4b2 3274{
a912b54d
JK
3275 int type = 0;
3276
63189b78 3277 switch (F2FS_OPTION(fio->sbi).active_logs) {
351df4b2 3278 case 2:
a912b54d
JK
3279 type = __get_segment_type_2(fio);
3280 break;
351df4b2 3281 case 4:
a912b54d
JK
3282 type = __get_segment_type_4(fio);
3283 break;
3284 case 6:
3285 type = __get_segment_type_6(fio);
3286 break;
3287 default:
3288 f2fs_bug_on(fio->sbi, true);
351df4b2 3289 }
81377bd6 3290
a912b54d
JK
3291 if (IS_HOT(type))
3292 fio->temp = HOT;
3293 else if (IS_WARM(type))
3294 fio->temp = WARM;
3295 else
3296 fio->temp = COLD;
3297 return type;
351df4b2
JK
3298}
3299
4d57b86d 3300void f2fs_allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
bfad7c2d 3301 block_t old_blkaddr, block_t *new_blkaddr,
fb830fc5 3302 struct f2fs_summary *sum, int type,
093749e2 3303 struct f2fs_io_info *fio)
351df4b2
JK
3304{
3305 struct sit_info *sit_i = SIT_I(sbi);
6ae1be13 3306 struct curseg_info *curseg = CURSEG_I(sbi, type);
c5d02785 3307 unsigned long long old_mtime;
093749e2
CY
3308 bool from_gc = (type == CURSEG_ALL_DATA_ATGC);
3309 struct seg_entry *se = NULL;
351df4b2 3310
2b60311d
CY
3311 down_read(&SM_I(sbi)->curseg_lock);
3312
351df4b2 3313 mutex_lock(&curseg->curseg_mutex);
3d26fa6b 3314 down_write(&sit_i->sentry_lock);
351df4b2 3315
093749e2
CY
3316 if (from_gc) {
3317 f2fs_bug_on(sbi, GET_SEGNO(sbi, old_blkaddr) == NULL_SEGNO);
3318 se = get_seg_entry(sbi, GET_SEGNO(sbi, old_blkaddr));
3319 sanity_check_seg_type(sbi, se->type);
3320 f2fs_bug_on(sbi, IS_NODESEG(se->type));
3321 }
351df4b2 3322 *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
351df4b2 3323
093749e2
CY
3324 f2fs_bug_on(sbi, curseg->next_blkoff >= sbi->blocks_per_seg);
3325
4e6a8d9b
JK
3326 f2fs_wait_discard_bio(sbi, *new_blkaddr);
3327
351df4b2
JK
3328 /*
3329 * __add_sum_entry should be resided under the curseg_mutex
3330 * because, this function updates a summary entry in the
3331 * current summary block.
3332 */
e79efe3b 3333 __add_sum_entry(sbi, type, sum);
351df4b2 3334
351df4b2 3335 __refresh_next_blkoff(sbi, curseg);
dcdfff65
JK
3336
3337 stat_inc_block_count(sbi, curseg);
351df4b2 3338
c5d02785
CY
3339 if (from_gc) {
3340 old_mtime = get_segment_mtime(sbi, old_blkaddr);
3341 } else {
3342 update_segment_mtime(sbi, old_blkaddr, 0);
3343 old_mtime = 0;
3344 }
3345 update_segment_mtime(sbi, *new_blkaddr, old_mtime);
3346
65f1b80b
YS
3347 /*
3348 * SIT information should be updated before segment allocation,
3349 * since SSR needs latest valid block information.
3350 */
3351 update_sit_entry(sbi, *new_blkaddr, 1);
3352 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO)
3353 update_sit_entry(sbi, old_blkaddr, -1);
3354
093749e2
CY
3355 if (!__has_curseg_space(sbi, curseg)) {
3356 if (from_gc)
3357 get_atssr_segment(sbi, type, se->type,
3358 AT_SSR, se->mtime);
3359 else
3360 sit_i->s_ops->allocate_segment(sbi, type, false);
3361 }
351df4b2 3362 /*
65f1b80b
YS
3363 * segment dirty status should be updated after segment allocation,
3364 * so we just need to update status only one time after previous
3365 * segment being closed.
351df4b2 3366 */
65f1b80b
YS
3367 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
3368 locate_dirty_segment(sbi, GET_SEGNO(sbi, *new_blkaddr));
5e443818 3369
3d26fa6b 3370 up_write(&sit_i->sentry_lock);
351df4b2 3371
704956ec 3372 if (page && IS_NODESEG(type)) {
351df4b2
JK
3373 fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg));
3374
704956ec
CY
3375 f2fs_inode_chksum_set(sbi, page);
3376 }
3377
8223ecc4
CY
3378 if (F2FS_IO_ALIGNED(sbi))
3379 fio->retry = false;
3380
f608c38c 3381 if (fio) {
fb830fc5
CY
3382 struct f2fs_bio_info *io;
3383
3384 INIT_LIST_HEAD(&fio->list);
3385 fio->in_list = true;
3386 io = sbi->write_io[fio->type] + fio->temp;
3387 spin_lock(&io->io_lock);
3388 list_add_tail(&fio->list, &io->io_list);
3389 spin_unlock(&io->io_lock);
3390 }
3391
bfad7c2d 3392 mutex_unlock(&curseg->curseg_mutex);
2b60311d
CY
3393
3394 up_read(&SM_I(sbi)->curseg_lock);
bfad7c2d
JK
3395}
3396
39d787be
CY
3397static void update_device_state(struct f2fs_io_info *fio)
3398{
3399 struct f2fs_sb_info *sbi = fio->sbi;
3400 unsigned int devidx;
3401
0916878d 3402 if (!f2fs_is_multi_device(sbi))
39d787be
CY
3403 return;
3404
3405 devidx = f2fs_target_device_index(sbi, fio->new_blkaddr);
3406
3407 /* update device state for fsync */
4d57b86d 3408 f2fs_set_dirty_device(sbi, fio->ino, devidx, FLUSH_INO);
1228b482
CY
3409
3410 /* update device state for checkpoint */
3411 if (!f2fs_test_bit(devidx, (char *)&sbi->dirty_device)) {
3412 spin_lock(&sbi->dev_lock);
3413 f2fs_set_bit(devidx, (char *)&sbi->dirty_device);
3414 spin_unlock(&sbi->dev_lock);
3415 }
39d787be
CY
3416}
3417
05ca3632 3418static void do_write_page(struct f2fs_summary *sum, struct f2fs_io_info *fio)
bfad7c2d 3419{
81377bd6 3420 int type = __get_segment_type(fio);
b0332a0f 3421 bool keep_order = (f2fs_lfs_mode(fio->sbi) && type == CURSEG_COLD_DATA);
bfad7c2d 3422
107a805d
CY
3423 if (keep_order)
3424 down_read(&fio->sbi->io_order_lock);
0a595eba 3425reallocate:
4d57b86d 3426 f2fs_allocate_data_block(fio->sbi, fio->page, fio->old_blkaddr,
093749e2 3427 &fio->new_blkaddr, sum, type, fio);
6aa58d8a
CY
3428 if (GET_SEGNO(fio->sbi, fio->old_blkaddr) != NULL_SEGNO)
3429 invalidate_mapping_pages(META_MAPPING(fio->sbi),
3430 fio->old_blkaddr, fio->old_blkaddr);
bfad7c2d 3431
351df4b2 3432 /* writeout dirty page into bdev */
fe16efe6
CY
3433 f2fs_submit_page_write(fio);
3434 if (fio->retry) {
0a595eba
JK
3435 fio->old_blkaddr = fio->new_blkaddr;
3436 goto reallocate;
3437 }
fe16efe6
CY
3438
3439 update_device_state(fio);
3440
107a805d
CY
3441 if (keep_order)
3442 up_read(&fio->sbi->io_order_lock);
351df4b2
JK
3443}
3444
4d57b86d 3445void f2fs_do_write_meta_page(struct f2fs_sb_info *sbi, struct page *page,
b0af6d49 3446 enum iostat_type io_type)
351df4b2 3447{
458e6197 3448 struct f2fs_io_info fio = {
05ca3632 3449 .sbi = sbi,
458e6197 3450 .type = META,
0cdd3195 3451 .temp = HOT,
04d328de 3452 .op = REQ_OP_WRITE,
70fd7614 3453 .op_flags = REQ_SYNC | REQ_META | REQ_PRIO,
7a9d7548
CY
3454 .old_blkaddr = page->index,
3455 .new_blkaddr = page->index,
05ca3632 3456 .page = page,
4375a336 3457 .encrypted_page = NULL,
fb830fc5 3458 .in_list = false,
458e6197
JK
3459 };
3460
2b947003 3461 if (unlikely(page->index >= MAIN_BLKADDR(sbi)))
04d328de 3462 fio.op_flags &= ~REQ_META;
2b947003 3463
351df4b2 3464 set_page_writeback(page);
17c50035 3465 ClearPageError(page);
b9109b0e 3466 f2fs_submit_page_write(&fio);
b0af6d49 3467
b63e7be5 3468 stat_inc_meta_count(sbi, page->index);
b0af6d49 3469 f2fs_update_iostat(sbi, io_type, F2FS_BLKSIZE);
351df4b2
JK
3470}
3471
4d57b86d 3472void f2fs_do_write_node_page(unsigned int nid, struct f2fs_io_info *fio)
351df4b2
JK
3473{
3474 struct f2fs_summary sum;
05ca3632 3475
351df4b2 3476 set_summary(&sum, nid, 0, 0);
05ca3632 3477 do_write_page(&sum, fio);
b0af6d49
CY
3478
3479 f2fs_update_iostat(fio->sbi, fio->io_type, F2FS_BLKSIZE);
351df4b2
JK
3480}
3481
4d57b86d
CY
3482void f2fs_outplace_write_data(struct dnode_of_data *dn,
3483 struct f2fs_io_info *fio)
351df4b2 3484{
05ca3632 3485 struct f2fs_sb_info *sbi = fio->sbi;
351df4b2 3486 struct f2fs_summary sum;
351df4b2 3487
9850cf4a 3488 f2fs_bug_on(sbi, dn->data_blkaddr == NULL_ADDR);
7735730d 3489 set_summary(&sum, dn->nid, dn->ofs_in_node, fio->version);
05ca3632 3490 do_write_page(&sum, fio);
f28b3434 3491 f2fs_update_data_blkaddr(dn, fio->new_blkaddr);
b0af6d49
CY
3492
3493 f2fs_update_iostat(sbi, fio->io_type, F2FS_BLKSIZE);
351df4b2
JK
3494}
3495
4d57b86d 3496int f2fs_inplace_write_data(struct f2fs_io_info *fio)
351df4b2 3497{
b0af6d49 3498 int err;
d21b0f23 3499 struct f2fs_sb_info *sbi = fio->sbi;
05573d6c 3500 unsigned int segno;
b0af6d49 3501
7a9d7548 3502 fio->new_blkaddr = fio->old_blkaddr;
0cdd3195
HL
3503 /* i/o temperature is needed for passing down write hints */
3504 __get_segment_type(fio);
d21b0f23 3505
05573d6c
CY
3506 segno = GET_SEGNO(sbi, fio->new_blkaddr);
3507
3508 if (!IS_DATASEG(get_seg_entry(sbi, segno)->type)) {
3509 set_sbi_flag(sbi, SBI_NEED_FSCK);
2d821c12
CY
3510 f2fs_warn(sbi, "%s: incorrect segment(%u) type, run fsck to fix.",
3511 __func__, segno);
10f966bb 3512 return -EFSCORRUPTED;
05573d6c 3513 }
d21b0f23 3514
05ca3632 3515 stat_inc_inplace_blocks(fio->sbi);
b0af6d49 3516
0e7f4197 3517 if (fio->bio && !(SM_I(sbi)->ipu_policy & (1 << F2FS_IPU_NOCACHE)))
8648de2c
CY
3518 err = f2fs_merge_page_bio(fio);
3519 else
3520 err = f2fs_submit_page_bio(fio);
e46f6bd8 3521 if (!err) {
39d787be 3522 update_device_state(fio);
e46f6bd8
CY
3523 f2fs_update_iostat(fio->sbi, fio->io_type, F2FS_BLKSIZE);
3524 }
b0af6d49
CY
3525
3526 return err;
351df4b2
JK
3527}
3528
2b60311d
CY
3529static inline int __f2fs_get_curseg(struct f2fs_sb_info *sbi,
3530 unsigned int segno)
3531{
3532 int i;
3533
3534 for (i = CURSEG_HOT_DATA; i < NO_CHECK_TYPE; i++) {
3535 if (CURSEG_I(sbi, i)->segno == segno)
3536 break;
3537 }
3538 return i;
3539}
3540
4d57b86d 3541void f2fs_do_replace_block(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
19f106bc 3542 block_t old_blkaddr, block_t new_blkaddr,
c5d02785
CY
3543 bool recover_curseg, bool recover_newaddr,
3544 bool from_gc)
351df4b2
JK
3545{
3546 struct sit_info *sit_i = SIT_I(sbi);
3547 struct curseg_info *curseg;
3548 unsigned int segno, old_cursegno;
3549 struct seg_entry *se;
3550 int type;
19f106bc 3551 unsigned short old_blkoff;
351df4b2
JK
3552
3553 segno = GET_SEGNO(sbi, new_blkaddr);
3554 se = get_seg_entry(sbi, segno);
3555 type = se->type;
3556
2b60311d
CY
3557 down_write(&SM_I(sbi)->curseg_lock);
3558
19f106bc
CY
3559 if (!recover_curseg) {
3560 /* for recovery flow */
3561 if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) {
3562 if (old_blkaddr == NULL_ADDR)
3563 type = CURSEG_COLD_DATA;
3564 else
3565 type = CURSEG_WARM_DATA;
3566 }
3567 } else {
2b60311d
CY
3568 if (IS_CURSEG(sbi, segno)) {
3569 /* se->type is volatile as SSR allocation */
3570 type = __f2fs_get_curseg(sbi, segno);
3571 f2fs_bug_on(sbi, type == NO_CHECK_TYPE);
3572 } else {
351df4b2 3573 type = CURSEG_WARM_DATA;
2b60311d 3574 }
351df4b2 3575 }
19f106bc 3576
2c190504 3577 f2fs_bug_on(sbi, !IS_DATASEG(type));
351df4b2
JK
3578 curseg = CURSEG_I(sbi, type);
3579
3580 mutex_lock(&curseg->curseg_mutex);
3d26fa6b 3581 down_write(&sit_i->sentry_lock);
351df4b2
JK
3582
3583 old_cursegno = curseg->segno;
19f106bc 3584 old_blkoff = curseg->next_blkoff;
351df4b2
JK
3585
3586 /* change the current segment */
3587 if (segno != curseg->segno) {
3588 curseg->next_segno = segno;
093749e2 3589 change_curseg(sbi, type, true);
351df4b2
JK
3590 }
3591
491c0854 3592 curseg->next_blkoff = GET_BLKOFF_FROM_SEG0(sbi, new_blkaddr);
e79efe3b 3593 __add_sum_entry(sbi, type, sum);
351df4b2 3594
c5d02785
CY
3595 if (!recover_curseg || recover_newaddr) {
3596 if (!from_gc)
3597 update_segment_mtime(sbi, new_blkaddr, 0);
6e2c64ad 3598 update_sit_entry(sbi, new_blkaddr, 1);
c5d02785 3599 }
6aa58d8a
CY
3600 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO) {
3601 invalidate_mapping_pages(META_MAPPING(sbi),
3602 old_blkaddr, old_blkaddr);
c5d02785
CY
3603 if (!from_gc)
3604 update_segment_mtime(sbi, old_blkaddr, 0);
6e2c64ad 3605 update_sit_entry(sbi, old_blkaddr, -1);
6aa58d8a 3606 }
6e2c64ad
JK
3607
3608 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
3609 locate_dirty_segment(sbi, GET_SEGNO(sbi, new_blkaddr));
3610
351df4b2 3611 locate_dirty_segment(sbi, old_cursegno);
351df4b2 3612
19f106bc
CY
3613 if (recover_curseg) {
3614 if (old_cursegno != curseg->segno) {
3615 curseg->next_segno = old_cursegno;
093749e2 3616 change_curseg(sbi, type, true);
19f106bc
CY
3617 }
3618 curseg->next_blkoff = old_blkoff;
3619 }
3620
3d26fa6b 3621 up_write(&sit_i->sentry_lock);
351df4b2 3622 mutex_unlock(&curseg->curseg_mutex);
2b60311d 3623 up_write(&SM_I(sbi)->curseg_lock);
351df4b2
JK
3624}
3625
528e3459
CY
3626void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn,
3627 block_t old_addr, block_t new_addr,
28bc106b
CY
3628 unsigned char version, bool recover_curseg,
3629 bool recover_newaddr)
528e3459
CY
3630{
3631 struct f2fs_summary sum;
3632
3633 set_summary(&sum, dn->nid, dn->ofs_in_node, version);
3634
4d57b86d 3635 f2fs_do_replace_block(sbi, &sum, old_addr, new_addr,
c5d02785 3636 recover_curseg, recover_newaddr, false);
528e3459 3637
f28b3434 3638 f2fs_update_data_blkaddr(dn, new_addr);
528e3459
CY
3639}
3640
93dfe2ac 3641void f2fs_wait_on_page_writeback(struct page *page,
bae0ee7a 3642 enum page_type type, bool ordered, bool locked)
93dfe2ac 3643{
93dfe2ac 3644 if (PageWriteback(page)) {
4081363f
JK
3645 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
3646
0b20fcec 3647 /* submit cached LFS IO */
bab475c5 3648 f2fs_submit_merged_write_cond(sbi, NULL, page, 0, type);
0b20fcec
CY
3649 /* sbumit cached IPU IO */
3650 f2fs_submit_merged_ipu_write(sbi, NULL, page);
bae0ee7a 3651 if (ordered) {
fec1d657 3652 wait_on_page_writeback(page);
bae0ee7a
CY
3653 f2fs_bug_on(sbi, locked && PageWriteback(page));
3654 } else {
fec1d657 3655 wait_for_stable_page(page);
bae0ee7a 3656 }
93dfe2ac
JK
3657 }
3658}
3659
0ded69f6 3660void f2fs_wait_on_block_writeback(struct inode *inode, block_t blkaddr)
08b39fbd 3661{
0ded69f6 3662 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
08b39fbd
CY
3663 struct page *cpage;
3664
0ded69f6
JK
3665 if (!f2fs_post_read_required(inode))
3666 return;
3667
93770ab7 3668 if (!__is_valid_data_blkaddr(blkaddr))
08b39fbd
CY
3669 return;
3670
08b39fbd
CY
3671 cpage = find_lock_page(META_MAPPING(sbi), blkaddr);
3672 if (cpage) {
bae0ee7a 3673 f2fs_wait_on_page_writeback(cpage, DATA, true, true);
08b39fbd
CY
3674 f2fs_put_page(cpage, 1);
3675 }
3676}
3677
1e78e8bd
ST
3678void f2fs_wait_on_block_writeback_range(struct inode *inode, block_t blkaddr,
3679 block_t len)
3680{
3681 block_t i;
3682
3683 for (i = 0; i < len; i++)
3684 f2fs_wait_on_block_writeback(inode, blkaddr + i);
3685}
3686
7735730d 3687static int read_compacted_summaries(struct f2fs_sb_info *sbi)
351df4b2
JK
3688{
3689 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
3690 struct curseg_info *seg_i;
3691 unsigned char *kaddr;
3692 struct page *page;
3693 block_t start;
3694 int i, j, offset;
3695
3696 start = start_sum_block(sbi);
3697
4d57b86d 3698 page = f2fs_get_meta_page(sbi, start++);
7735730d
CY
3699 if (IS_ERR(page))
3700 return PTR_ERR(page);
351df4b2
JK
3701 kaddr = (unsigned char *)page_address(page);
3702
3703 /* Step 1: restore nat cache */
3704 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 3705 memcpy(seg_i->journal, kaddr, SUM_JOURNAL_SIZE);
351df4b2
JK
3706
3707 /* Step 2: restore sit cache */
3708 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 3709 memcpy(seg_i->journal, kaddr + SUM_JOURNAL_SIZE, SUM_JOURNAL_SIZE);
351df4b2
JK
3710 offset = 2 * SUM_JOURNAL_SIZE;
3711
3712 /* Step 3: restore summary entries */
3713 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
3714 unsigned short blk_off;
3715 unsigned int segno;
3716
3717 seg_i = CURSEG_I(sbi, i);
3718 segno = le32_to_cpu(ckpt->cur_data_segno[i]);
3719 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]);
3720 seg_i->next_segno = segno;
3721 reset_curseg(sbi, i, 0);
3722 seg_i->alloc_type = ckpt->alloc_type[i];
3723 seg_i->next_blkoff = blk_off;
3724
3725 if (seg_i->alloc_type == SSR)
3726 blk_off = sbi->blocks_per_seg;
3727
3728 for (j = 0; j < blk_off; j++) {
3729 struct f2fs_summary *s;
3730 s = (struct f2fs_summary *)(kaddr + offset);
3731 seg_i->sum_blk->entries[j] = *s;
3732 offset += SUMMARY_SIZE;
09cbfeaf 3733 if (offset + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK
3734 SUM_FOOTER_SIZE)
3735 continue;
3736
3737 f2fs_put_page(page, 1);
3738 page = NULL;
3739
4d57b86d 3740 page = f2fs_get_meta_page(sbi, start++);
7735730d
CY
3741 if (IS_ERR(page))
3742 return PTR_ERR(page);
351df4b2
JK
3743 kaddr = (unsigned char *)page_address(page);
3744 offset = 0;
3745 }
3746 }
3747 f2fs_put_page(page, 1);
7735730d 3748 return 0;
351df4b2
JK
3749}
3750
3751static int read_normal_summaries(struct f2fs_sb_info *sbi, int type)
3752{
3753 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
3754 struct f2fs_summary_block *sum;
3755 struct curseg_info *curseg;
3756 struct page *new;
3757 unsigned short blk_off;
3758 unsigned int segno = 0;
3759 block_t blk_addr = 0;
7735730d 3760 int err = 0;
351df4b2
JK
3761
3762 /* get segment number and block addr */
3763 if (IS_DATASEG(type)) {
3764 segno = le32_to_cpu(ckpt->cur_data_segno[type]);
3765 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type -
3766 CURSEG_HOT_DATA]);
119ee914 3767 if (__exist_node_summaries(sbi))
d0b9e42a 3768 blk_addr = sum_blk_addr(sbi, NR_CURSEG_PERSIST_TYPE, type);
351df4b2
JK
3769 else
3770 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type);
3771 } else {
3772 segno = le32_to_cpu(ckpt->cur_node_segno[type -
3773 CURSEG_HOT_NODE]);
3774 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type -
3775 CURSEG_HOT_NODE]);
119ee914 3776 if (__exist_node_summaries(sbi))
351df4b2
JK
3777 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE,
3778 type - CURSEG_HOT_NODE);
3779 else
3780 blk_addr = GET_SUM_BLOCK(sbi, segno);
3781 }
3782
4d57b86d 3783 new = f2fs_get_meta_page(sbi, blk_addr);
7735730d
CY
3784 if (IS_ERR(new))
3785 return PTR_ERR(new);
351df4b2
JK
3786 sum = (struct f2fs_summary_block *)page_address(new);
3787
3788 if (IS_NODESEG(type)) {
119ee914 3789 if (__exist_node_summaries(sbi)) {
351df4b2
JK
3790 struct f2fs_summary *ns = &sum->entries[0];
3791 int i;
3792 for (i = 0; i < sbi->blocks_per_seg; i++, ns++) {
3793 ns->version = 0;
3794 ns->ofs_in_node = 0;
3795 }
3796 } else {
7735730d
CY
3797 err = f2fs_restore_node_summary(sbi, segno, sum);
3798 if (err)
3799 goto out;
351df4b2
JK
3800 }
3801 }
3802
3803 /* set uncompleted segment to curseg */
3804 curseg = CURSEG_I(sbi, type);
3805 mutex_lock(&curseg->curseg_mutex);
b7ad7512
CY
3806
3807 /* update journal info */
3808 down_write(&curseg->journal_rwsem);
3809 memcpy(curseg->journal, &sum->journal, SUM_JOURNAL_SIZE);
3810 up_write(&curseg->journal_rwsem);
3811
3812 memcpy(curseg->sum_blk->entries, sum->entries, SUM_ENTRY_SIZE);
3813 memcpy(&curseg->sum_blk->footer, &sum->footer, SUM_FOOTER_SIZE);
351df4b2
JK
3814 curseg->next_segno = segno;
3815 reset_curseg(sbi, type, 0);
3816 curseg->alloc_type = ckpt->alloc_type[type];
3817 curseg->next_blkoff = blk_off;
3818 mutex_unlock(&curseg->curseg_mutex);
7735730d 3819out:
351df4b2 3820 f2fs_put_page(new, 1);
7735730d 3821 return err;
351df4b2
JK
3822}
3823
3824static int restore_curseg_summaries(struct f2fs_sb_info *sbi)
3825{
21d3f8e1
JQ
3826 struct f2fs_journal *sit_j = CURSEG_I(sbi, CURSEG_COLD_DATA)->journal;
3827 struct f2fs_journal *nat_j = CURSEG_I(sbi, CURSEG_HOT_DATA)->journal;
351df4b2 3828 int type = CURSEG_HOT_DATA;
e4fc5fbf 3829 int err;
351df4b2 3830
aaec2b1d 3831 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG)) {
4d57b86d 3832 int npages = f2fs_npages_for_summary_flush(sbi, true);
3fa06d7b
CY
3833
3834 if (npages >= 2)
4d57b86d 3835 f2fs_ra_meta_pages(sbi, start_sum_block(sbi), npages,
26879fb1 3836 META_CP, true);
3fa06d7b 3837
351df4b2 3838 /* restore for compacted data summary */
7735730d
CY
3839 err = read_compacted_summaries(sbi);
3840 if (err)
3841 return err;
351df4b2
JK
3842 type = CURSEG_HOT_NODE;
3843 }
3844
119ee914 3845 if (__exist_node_summaries(sbi))
d0b9e42a
CY
3846 f2fs_ra_meta_pages(sbi,
3847 sum_blk_addr(sbi, NR_CURSEG_PERSIST_TYPE, type),
3848 NR_CURSEG_PERSIST_TYPE - type, META_CP, true);
3fa06d7b 3849
e4fc5fbf
CY
3850 for (; type <= CURSEG_COLD_NODE; type++) {
3851 err = read_normal_summaries(sbi, type);
3852 if (err)
3853 return err;
3854 }
3855
21d3f8e1
JQ
3856 /* sanity check for summary blocks */
3857 if (nats_in_cursum(nat_j) > NAT_JOURNAL_ENTRIES ||
9227d522 3858 sits_in_cursum(sit_j) > SIT_JOURNAL_ENTRIES) {
dcbb4c10
JP
3859 f2fs_err(sbi, "invalid journal entries nats %u sits %u\n",
3860 nats_in_cursum(nat_j), sits_in_cursum(sit_j));
21d3f8e1 3861 return -EINVAL;
9227d522 3862 }
21d3f8e1 3863
351df4b2
JK
3864 return 0;
3865}
3866
3867static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr)
3868{
3869 struct page *page;
3870 unsigned char *kaddr;
3871 struct f2fs_summary *summary;
3872 struct curseg_info *seg_i;
3873 int written_size = 0;
3874 int i, j;
3875
4d57b86d 3876 page = f2fs_grab_meta_page(sbi, blkaddr++);
351df4b2 3877 kaddr = (unsigned char *)page_address(page);
81114baa 3878 memset(kaddr, 0, PAGE_SIZE);
351df4b2
JK
3879
3880 /* Step 1: write nat cache */
3881 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
b7ad7512 3882 memcpy(kaddr, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK
3883 written_size += SUM_JOURNAL_SIZE;
3884
3885 /* Step 2: write sit cache */
3886 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 3887 memcpy(kaddr + written_size, seg_i->journal, SUM_JOURNAL_SIZE);
351df4b2
JK
3888 written_size += SUM_JOURNAL_SIZE;
3889
351df4b2
JK
3890 /* Step 3: write summary entries */
3891 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
3892 unsigned short blkoff;
3893 seg_i = CURSEG_I(sbi, i);
3894 if (sbi->ckpt->alloc_type[i] == SSR)
3895 blkoff = sbi->blocks_per_seg;
3896 else
3897 blkoff = curseg_blkoff(sbi, i);
3898
3899 for (j = 0; j < blkoff; j++) {
3900 if (!page) {
4d57b86d 3901 page = f2fs_grab_meta_page(sbi, blkaddr++);
351df4b2 3902 kaddr = (unsigned char *)page_address(page);
81114baa 3903 memset(kaddr, 0, PAGE_SIZE);
351df4b2
JK
3904 written_size = 0;
3905 }
3906 summary = (struct f2fs_summary *)(kaddr + written_size);
3907 *summary = seg_i->sum_blk->entries[j];
3908 written_size += SUMMARY_SIZE;
351df4b2 3909
09cbfeaf 3910 if (written_size + SUMMARY_SIZE <= PAGE_SIZE -
351df4b2
JK
3911 SUM_FOOTER_SIZE)
3912 continue;
3913
e8d61a74 3914 set_page_dirty(page);
351df4b2
JK
3915 f2fs_put_page(page, 1);
3916 page = NULL;
3917 }
3918 }
e8d61a74
CY
3919 if (page) {
3920 set_page_dirty(page);
351df4b2 3921 f2fs_put_page(page, 1);
e8d61a74 3922 }
351df4b2
JK
3923}
3924
3925static void write_normal_summaries(struct f2fs_sb_info *sbi,
3926 block_t blkaddr, int type)
3927{
3928 int i, end;
3929 if (IS_DATASEG(type))
3930 end = type + NR_CURSEG_DATA_TYPE;
3931 else
3932 end = type + NR_CURSEG_NODE_TYPE;
3933
b7ad7512
CY
3934 for (i = type; i < end; i++)
3935 write_current_sum_page(sbi, i, blkaddr + (i - type));
351df4b2
JK
3936}
3937
4d57b86d 3938void f2fs_write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
351df4b2 3939{
aaec2b1d 3940 if (is_set_ckpt_flags(sbi, CP_COMPACT_SUM_FLAG))
351df4b2
JK
3941 write_compacted_summaries(sbi, start_blk);
3942 else
3943 write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA);
3944}
3945
4d57b86d 3946void f2fs_write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
351df4b2 3947{
119ee914 3948 write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE);
351df4b2
JK
3949}
3950
4d57b86d 3951int f2fs_lookup_journal_in_cursum(struct f2fs_journal *journal, int type,
351df4b2
JK
3952 unsigned int val, int alloc)
3953{
3954 int i;
3955
3956 if (type == NAT_JOURNAL) {
dfc08a12
CY
3957 for (i = 0; i < nats_in_cursum(journal); i++) {
3958 if (le32_to_cpu(nid_in_journal(journal, i)) == val)
351df4b2
JK
3959 return i;
3960 }
dfc08a12
CY
3961 if (alloc && __has_cursum_space(journal, 1, NAT_JOURNAL))
3962 return update_nats_in_cursum(journal, 1);
351df4b2 3963 } else if (type == SIT_JOURNAL) {
dfc08a12
CY
3964 for (i = 0; i < sits_in_cursum(journal); i++)
3965 if (le32_to_cpu(segno_in_journal(journal, i)) == val)
351df4b2 3966 return i;
dfc08a12
CY
3967 if (alloc && __has_cursum_space(journal, 1, SIT_JOURNAL))
3968 return update_sits_in_cursum(journal, 1);
351df4b2
JK
3969 }
3970 return -1;
3971}
3972
3973static struct page *get_current_sit_page(struct f2fs_sb_info *sbi,
3974 unsigned int segno)
3975{
86f33603 3976 return f2fs_get_meta_page(sbi, current_sit_addr(sbi, segno));
351df4b2
JK
3977}
3978
3979static struct page *get_next_sit_page(struct f2fs_sb_info *sbi,
3980 unsigned int start)
3981{
3982 struct sit_info *sit_i = SIT_I(sbi);
068c3cd8 3983 struct page *page;
351df4b2 3984 pgoff_t src_off, dst_off;
351df4b2
JK
3985
3986 src_off = current_sit_addr(sbi, start);
3987 dst_off = next_sit_addr(sbi, src_off);
3988
4d57b86d 3989 page = f2fs_grab_meta_page(sbi, dst_off);
068c3cd8 3990 seg_info_to_sit_page(sbi, page, start);
351df4b2 3991
068c3cd8 3992 set_page_dirty(page);
351df4b2
JK
3993 set_to_next_sit(sit_i, start);
3994
068c3cd8 3995 return page;
351df4b2
JK
3996}
3997
184a5cd2
CY
3998static struct sit_entry_set *grab_sit_entry_set(void)
3999{
4000 struct sit_entry_set *ses =
80c54505 4001 f2fs_kmem_cache_alloc(sit_entry_set_slab, GFP_NOFS);
184a5cd2
CY
4002
4003 ses->entry_cnt = 0;
4004 INIT_LIST_HEAD(&ses->set_list);
4005 return ses;
4006}
4007
4008static void release_sit_entry_set(struct sit_entry_set *ses)
4009{
4010 list_del(&ses->set_list);
4011 kmem_cache_free(sit_entry_set_slab, ses);
4012}
4013
4014static void adjust_sit_entry_set(struct sit_entry_set *ses,
4015 struct list_head *head)
4016{
4017 struct sit_entry_set *next = ses;
4018
4019 if (list_is_last(&ses->set_list, head))
4020 return;
4021
4022 list_for_each_entry_continue(next, head, set_list)
4023 if (ses->entry_cnt <= next->entry_cnt)
4024 break;
4025
4026 list_move_tail(&ses->set_list, &next->set_list);
4027}
4028
4029static void add_sit_entry(unsigned int segno, struct list_head *head)
4030{
4031 struct sit_entry_set *ses;
4032 unsigned int start_segno = START_SEGNO(segno);
4033
4034 list_for_each_entry(ses, head, set_list) {
4035 if (ses->start_segno == start_segno) {
4036 ses->entry_cnt++;
4037 adjust_sit_entry_set(ses, head);
4038 return;
4039 }
4040 }
4041
4042 ses = grab_sit_entry_set();
4043
4044 ses->start_segno = start_segno;
4045 ses->entry_cnt++;
4046 list_add(&ses->set_list, head);
4047}
4048
4049static void add_sits_in_set(struct f2fs_sb_info *sbi)
4050{
4051 struct f2fs_sm_info *sm_info = SM_I(sbi);
4052 struct list_head *set_list = &sm_info->sit_entry_set;
4053 unsigned long *bitmap = SIT_I(sbi)->dirty_sentries_bitmap;
184a5cd2
CY
4054 unsigned int segno;
4055
7cd8558b 4056 for_each_set_bit(segno, bitmap, MAIN_SEGS(sbi))
184a5cd2
CY
4057 add_sit_entry(segno, set_list);
4058}
4059
4060static void remove_sits_in_journal(struct f2fs_sb_info *sbi)
351df4b2
JK
4061{
4062 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 4063 struct f2fs_journal *journal = curseg->journal;
351df4b2
JK
4064 int i;
4065
b7ad7512 4066 down_write(&curseg->journal_rwsem);
dfc08a12 4067 for (i = 0; i < sits_in_cursum(journal); i++) {
184a5cd2
CY
4068 unsigned int segno;
4069 bool dirtied;
4070
dfc08a12 4071 segno = le32_to_cpu(segno_in_journal(journal, i));
184a5cd2
CY
4072 dirtied = __mark_sit_entry_dirty(sbi, segno);
4073
4074 if (!dirtied)
4075 add_sit_entry(segno, &SM_I(sbi)->sit_entry_set);
351df4b2 4076 }
dfc08a12 4077 update_sits_in_cursum(journal, -i);
b7ad7512 4078 up_write(&curseg->journal_rwsem);
351df4b2
JK
4079}
4080
0a8165d7 4081/*
351df4b2
JK
4082 * CP calls this function, which flushes SIT entries including sit_journal,
4083 * and moves prefree segs to free segs.
4084 */
4d57b86d 4085void f2fs_flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc)
351df4b2
JK
4086{
4087 struct sit_info *sit_i = SIT_I(sbi);
4088 unsigned long *bitmap = sit_i->dirty_sentries_bitmap;
4089 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 4090 struct f2fs_journal *journal = curseg->journal;
184a5cd2
CY
4091 struct sit_entry_set *ses, *tmp;
4092 struct list_head *head = &SM_I(sbi)->sit_entry_set;
04f0b2ea 4093 bool to_journal = !is_sbi_flag_set(sbi, SBI_IS_RESIZEFS);
4b2fecc8 4094 struct seg_entry *se;
351df4b2 4095
3d26fa6b 4096 down_write(&sit_i->sentry_lock);
351df4b2 4097
2b11a74b
WL
4098 if (!sit_i->dirty_sentries)
4099 goto out;
4100
351df4b2 4101 /*
184a5cd2
CY
4102 * add and account sit entries of dirty bitmap in sit entry
4103 * set temporarily
351df4b2 4104 */
184a5cd2 4105 add_sits_in_set(sbi);
351df4b2 4106
184a5cd2
CY
4107 /*
4108 * if there are no enough space in journal to store dirty sit
4109 * entries, remove all entries from journal and add and account
4110 * them in sit entry set.
4111 */
04f0b2ea
QS
4112 if (!__has_cursum_space(journal, sit_i->dirty_sentries, SIT_JOURNAL) ||
4113 !to_journal)
184a5cd2 4114 remove_sits_in_journal(sbi);
b2955550 4115
184a5cd2
CY
4116 /*
4117 * there are two steps to flush sit entries:
4118 * #1, flush sit entries to journal in current cold data summary block.
4119 * #2, flush sit entries to sit page.
4120 */
4121 list_for_each_entry_safe(ses, tmp, head, set_list) {
4a257ed6 4122 struct page *page = NULL;
184a5cd2
CY
4123 struct f2fs_sit_block *raw_sit = NULL;
4124 unsigned int start_segno = ses->start_segno;
4125 unsigned int end = min(start_segno + SIT_ENTRY_PER_BLOCK,
7cd8558b 4126 (unsigned long)MAIN_SEGS(sbi));
184a5cd2
CY
4127 unsigned int segno = start_segno;
4128
4129 if (to_journal &&
dfc08a12 4130 !__has_cursum_space(journal, ses->entry_cnt, SIT_JOURNAL))
184a5cd2
CY
4131 to_journal = false;
4132
b7ad7512
CY
4133 if (to_journal) {
4134 down_write(&curseg->journal_rwsem);
4135 } else {
184a5cd2
CY
4136 page = get_next_sit_page(sbi, start_segno);
4137 raw_sit = page_address(page);
351df4b2 4138 }
351df4b2 4139
184a5cd2
CY
4140 /* flush dirty sit entries in region of current sit set */
4141 for_each_set_bit_from(segno, bitmap, end) {
4142 int offset, sit_offset;
4b2fecc8
JK
4143
4144 se = get_seg_entry(sbi, segno);
56b07e7e
ZZ
4145#ifdef CONFIG_F2FS_CHECK_FS
4146 if (memcmp(se->cur_valid_map, se->cur_valid_map_mir,
4147 SIT_VBLOCK_MAP_SIZE))
4148 f2fs_bug_on(sbi, 1);
4149#endif
184a5cd2
CY
4150
4151 /* add discard candidates */
c473f1a9 4152 if (!(cpc->reason & CP_DISCARD)) {
4b2fecc8 4153 cpc->trim_start = segno;
25290fa5 4154 add_discard_addrs(sbi, cpc, false);
4b2fecc8 4155 }
184a5cd2
CY
4156
4157 if (to_journal) {
4d57b86d 4158 offset = f2fs_lookup_journal_in_cursum(journal,
184a5cd2
CY
4159 SIT_JOURNAL, segno, 1);
4160 f2fs_bug_on(sbi, offset < 0);
dfc08a12 4161 segno_in_journal(journal, offset) =
184a5cd2
CY
4162 cpu_to_le32(segno);
4163 seg_info_to_raw_sit(se,
dfc08a12 4164 &sit_in_journal(journal, offset));
56b07e7e
ZZ
4165 check_block_count(sbi, segno,
4166 &sit_in_journal(journal, offset));
184a5cd2
CY
4167 } else {
4168 sit_offset = SIT_ENTRY_OFFSET(sit_i, segno);
4169 seg_info_to_raw_sit(se,
4170 &raw_sit->entries[sit_offset]);
56b07e7e
ZZ
4171 check_block_count(sbi, segno,
4172 &raw_sit->entries[sit_offset]);
184a5cd2 4173 }
351df4b2 4174
184a5cd2
CY
4175 __clear_bit(segno, bitmap);
4176 sit_i->dirty_sentries--;
4177 ses->entry_cnt--;
351df4b2
JK
4178 }
4179
b7ad7512
CY
4180 if (to_journal)
4181 up_write(&curseg->journal_rwsem);
4182 else
184a5cd2
CY
4183 f2fs_put_page(page, 1);
4184
4185 f2fs_bug_on(sbi, ses->entry_cnt);
4186 release_sit_entry_set(ses);
351df4b2 4187 }
184a5cd2
CY
4188
4189 f2fs_bug_on(sbi, !list_empty(head));
4190 f2fs_bug_on(sbi, sit_i->dirty_sentries);
184a5cd2 4191out:
c473f1a9 4192 if (cpc->reason & CP_DISCARD) {
650d3c4e
YH
4193 __u64 trim_start = cpc->trim_start;
4194
4b2fecc8 4195 for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++)
25290fa5 4196 add_discard_addrs(sbi, cpc, false);
650d3c4e
YH
4197
4198 cpc->trim_start = trim_start;
4b2fecc8 4199 }
3d26fa6b 4200 up_write(&sit_i->sentry_lock);
351df4b2 4201
351df4b2
JK
4202 set_prefree_as_free_segments(sbi);
4203}
4204
4205static int build_sit_info(struct f2fs_sb_info *sbi)
4206{
4207 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
351df4b2
JK
4208 struct sit_info *sit_i;
4209 unsigned int sit_segs, start;
2fde3dd1 4210 char *src_bitmap, *bitmap;
bbf9f7d9 4211 unsigned int bitmap_size, main_bitmap_size, sit_bitmap_size;
351df4b2
JK
4212
4213 /* allocate memory for SIT information */
acbf054d 4214 sit_i = f2fs_kzalloc(sbi, sizeof(struct sit_info), GFP_KERNEL);
351df4b2
JK
4215 if (!sit_i)
4216 return -ENOMEM;
4217
4218 SM_I(sbi)->sit_info = sit_i;
4219
9d2a789c
KC
4220 sit_i->sentries =
4221 f2fs_kvzalloc(sbi, array_size(sizeof(struct seg_entry),
4222 MAIN_SEGS(sbi)),
4223 GFP_KERNEL);
351df4b2
JK
4224 if (!sit_i->sentries)
4225 return -ENOMEM;
4226
bbf9f7d9
ST
4227 main_bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
4228 sit_i->dirty_sentries_bitmap = f2fs_kvzalloc(sbi, main_bitmap_size,
628b3d14 4229 GFP_KERNEL);
351df4b2
JK
4230 if (!sit_i->dirty_sentries_bitmap)
4231 return -ENOMEM;
4232
2fde3dd1
CY
4233#ifdef CONFIG_F2FS_CHECK_FS
4234 bitmap_size = MAIN_SEGS(sbi) * SIT_VBLOCK_MAP_SIZE * 4;
4235#else
4236 bitmap_size = MAIN_SEGS(sbi) * SIT_VBLOCK_MAP_SIZE * 3;
4237#endif
4238 sit_i->bitmap = f2fs_kvzalloc(sbi, bitmap_size, GFP_KERNEL);
4239 if (!sit_i->bitmap)
4240 return -ENOMEM;
4241
4242 bitmap = sit_i->bitmap;
4243
7cd8558b 4244 for (start = 0; start < MAIN_SEGS(sbi); start++) {
2fde3dd1
CY
4245 sit_i->sentries[start].cur_valid_map = bitmap;
4246 bitmap += SIT_VBLOCK_MAP_SIZE;
4247
4248 sit_i->sentries[start].ckpt_valid_map = bitmap;
4249 bitmap += SIT_VBLOCK_MAP_SIZE;
3e025740 4250
355e7891 4251#ifdef CONFIG_F2FS_CHECK_FS
2fde3dd1
CY
4252 sit_i->sentries[start].cur_valid_map_mir = bitmap;
4253 bitmap += SIT_VBLOCK_MAP_SIZE;
355e7891
CY
4254#endif
4255
2fde3dd1
CY
4256 sit_i->sentries[start].discard_map = bitmap;
4257 bitmap += SIT_VBLOCK_MAP_SIZE;
351df4b2
JK
4258 }
4259
acbf054d 4260 sit_i->tmp_map = f2fs_kzalloc(sbi, SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
60a3b782
JK
4261 if (!sit_i->tmp_map)
4262 return -ENOMEM;
4263
2c70c5e3 4264 if (__is_large_section(sbi)) {
9d2a789c
KC
4265 sit_i->sec_entries =
4266 f2fs_kvzalloc(sbi, array_size(sizeof(struct sec_entry),
4267 MAIN_SECS(sbi)),
4268 GFP_KERNEL);
351df4b2
JK
4269 if (!sit_i->sec_entries)
4270 return -ENOMEM;
4271 }
4272
4273 /* get information related with SIT */
4274 sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1;
4275
4276 /* setup SIT bitmap from ckeckpoint pack */
bbf9f7d9 4277 sit_bitmap_size = __bitmap_size(sbi, SIT_BITMAP);
351df4b2
JK
4278 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP);
4279
bbf9f7d9 4280 sit_i->sit_bitmap = kmemdup(src_bitmap, sit_bitmap_size, GFP_KERNEL);
ae27d62e 4281 if (!sit_i->sit_bitmap)
351df4b2 4282 return -ENOMEM;
351df4b2 4283
ae27d62e 4284#ifdef CONFIG_F2FS_CHECK_FS
bbf9f7d9
ST
4285 sit_i->sit_bitmap_mir = kmemdup(src_bitmap,
4286 sit_bitmap_size, GFP_KERNEL);
ae27d62e
CY
4287 if (!sit_i->sit_bitmap_mir)
4288 return -ENOMEM;
bbf9f7d9
ST
4289
4290 sit_i->invalid_segmap = f2fs_kvzalloc(sbi,
4291 main_bitmap_size, GFP_KERNEL);
4292 if (!sit_i->invalid_segmap)
4293 return -ENOMEM;
ae27d62e
CY
4294#endif
4295
351df4b2
JK
4296 /* init SIT information */
4297 sit_i->s_ops = &default_salloc_ops;
4298
4299 sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr);
4300 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg;
c79b7ff1 4301 sit_i->written_valid_blocks = 0;
bbf9f7d9 4302 sit_i->bitmap_size = sit_bitmap_size;
351df4b2
JK
4303 sit_i->dirty_sentries = 0;
4304 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK;
4305 sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time);
a7e679b5 4306 sit_i->mounted_time = ktime_get_boottime_seconds();
3d26fa6b 4307 init_rwsem(&sit_i->sentry_lock);
351df4b2
JK
4308 return 0;
4309}
4310
4311static int build_free_segmap(struct f2fs_sb_info *sbi)
4312{
351df4b2
JK
4313 struct free_segmap_info *free_i;
4314 unsigned int bitmap_size, sec_bitmap_size;
4315
4316 /* allocate memory for free segmap information */
acbf054d 4317 free_i = f2fs_kzalloc(sbi, sizeof(struct free_segmap_info), GFP_KERNEL);
351df4b2
JK
4318 if (!free_i)
4319 return -ENOMEM;
4320
4321 SM_I(sbi)->free_info = free_i;
4322
7cd8558b 4323 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
628b3d14 4324 free_i->free_segmap = f2fs_kvmalloc(sbi, bitmap_size, GFP_KERNEL);
351df4b2
JK
4325 if (!free_i->free_segmap)
4326 return -ENOMEM;
4327
7cd8558b 4328 sec_bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
628b3d14 4329 free_i->free_secmap = f2fs_kvmalloc(sbi, sec_bitmap_size, GFP_KERNEL);
351df4b2
JK
4330 if (!free_i->free_secmap)
4331 return -ENOMEM;
4332
4333 /* set all segments as dirty temporarily */
4334 memset(free_i->free_segmap, 0xff, bitmap_size);
4335 memset(free_i->free_secmap, 0xff, sec_bitmap_size);
4336
4337 /* init free segmap information */
7cd8558b 4338 free_i->start_segno = GET_SEGNO_FROM_SEG0(sbi, MAIN_BLKADDR(sbi));
351df4b2
JK
4339 free_i->free_segments = 0;
4340 free_i->free_sections = 0;
1a118ccf 4341 spin_lock_init(&free_i->segmap_lock);
351df4b2
JK
4342 return 0;
4343}
4344
4345static int build_curseg(struct f2fs_sb_info *sbi)
4346{
1042d60f 4347 struct curseg_info *array;
351df4b2
JK
4348 int i;
4349
d0b9e42a
CY
4350 array = f2fs_kzalloc(sbi, array_size(NR_CURSEG_TYPE,
4351 sizeof(*array)), GFP_KERNEL);
351df4b2
JK
4352 if (!array)
4353 return -ENOMEM;
4354
4355 SM_I(sbi)->curseg_array = array;
4356
d0b9e42a 4357 for (i = 0; i < NO_CHECK_TYPE; i++) {
351df4b2 4358 mutex_init(&array[i].curseg_mutex);
acbf054d 4359 array[i].sum_blk = f2fs_kzalloc(sbi, PAGE_SIZE, GFP_KERNEL);
351df4b2
JK
4360 if (!array[i].sum_blk)
4361 return -ENOMEM;
b7ad7512 4362 init_rwsem(&array[i].journal_rwsem);
acbf054d
CY
4363 array[i].journal = f2fs_kzalloc(sbi,
4364 sizeof(struct f2fs_journal), GFP_KERNEL);
b7ad7512
CY
4365 if (!array[i].journal)
4366 return -ENOMEM;
d0b9e42a
CY
4367 if (i < NR_PERSISTENT_LOG)
4368 array[i].seg_type = CURSEG_HOT_DATA + i;
4369 else if (i == CURSEG_COLD_DATA_PINNED)
4370 array[i].seg_type = CURSEG_COLD_DATA;
093749e2
CY
4371 else if (i == CURSEG_ALL_DATA_ATGC)
4372 array[i].seg_type = CURSEG_COLD_DATA;
351df4b2
JK
4373 array[i].segno = NULL_SEGNO;
4374 array[i].next_blkoff = 0;
d0b9e42a 4375 array[i].inited = false;
351df4b2
JK
4376 }
4377 return restore_curseg_summaries(sbi);
4378}
4379
c39a1b34 4380static int build_sit_entries(struct f2fs_sb_info *sbi)
351df4b2
JK
4381{
4382 struct sit_info *sit_i = SIT_I(sbi);
4383 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
b7ad7512 4384 struct f2fs_journal *journal = curseg->journal;
9c094040
YH
4385 struct seg_entry *se;
4386 struct f2fs_sit_entry sit;
74de593a
CY
4387 int sit_blk_cnt = SIT_BLK_CNT(sbi);
4388 unsigned int i, start, end;
4389 unsigned int readed, start_blk = 0;
c39a1b34 4390 int err = 0;
8a29c126 4391 block_t total_node_blocks = 0;
351df4b2 4392
74de593a 4393 do {
4d57b86d 4394 readed = f2fs_ra_meta_pages(sbi, start_blk, BIO_MAX_PAGES,
664ba972 4395 META_SIT, true);
74de593a
CY
4396
4397 start = start_blk * sit_i->sents_per_block;
4398 end = (start_blk + readed) * sit_i->sents_per_block;
4399
7cd8558b 4400 for (; start < end && start < MAIN_SEGS(sbi); start++) {
74de593a 4401 struct f2fs_sit_block *sit_blk;
74de593a
CY
4402 struct page *page;
4403
9c094040 4404 se = &sit_i->sentries[start];
74de593a 4405 page = get_current_sit_page(sbi, start);
edc55aaf
JK
4406 if (IS_ERR(page))
4407 return PTR_ERR(page);
74de593a
CY
4408 sit_blk = (struct f2fs_sit_block *)page_address(page);
4409 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)];
4410 f2fs_put_page(page, 1);
d600af23 4411
c39a1b34
JK
4412 err = check_block_count(sbi, start, &sit);
4413 if (err)
4414 return err;
74de593a 4415 seg_info_from_raw_sit(se, &sit);
8a29c126
JK
4416 if (IS_NODESEG(se->type))
4417 total_node_blocks += se->valid_blocks;
a66cdd98
JK
4418
4419 /* build discard map only one time */
7d20c8ab
CY
4420 if (is_set_ckpt_flags(sbi, CP_TRIMMED_FLAG)) {
4421 memset(se->discard_map, 0xff,
4422 SIT_VBLOCK_MAP_SIZE);
4423 } else {
4424 memcpy(se->discard_map,
4425 se->cur_valid_map,
4426 SIT_VBLOCK_MAP_SIZE);
4427 sbi->discard_blks +=
4428 sbi->blocks_per_seg -
4429 se->valid_blocks;
3e025740 4430 }
a66cdd98 4431
2c70c5e3 4432 if (__is_large_section(sbi))
d600af23
CY
4433 get_sec_entry(sbi, start)->valid_blocks +=
4434 se->valid_blocks;
351df4b2 4435 }
74de593a
CY
4436 start_blk += readed;
4437 } while (start_blk < sit_blk_cnt);
d600af23
CY
4438
4439 down_read(&curseg->journal_rwsem);
4440 for (i = 0; i < sits_in_cursum(journal); i++) {
d600af23
CY
4441 unsigned int old_valid_blocks;
4442
4443 start = le32_to_cpu(segno_in_journal(journal, i));
b2ca374f 4444 if (start >= MAIN_SEGS(sbi)) {
dcbb4c10
JP
4445 f2fs_err(sbi, "Wrong journal entry on segno %u",
4446 start);
10f966bb 4447 err = -EFSCORRUPTED;
b2ca374f
JK
4448 break;
4449 }
4450
d600af23
CY
4451 se = &sit_i->sentries[start];
4452 sit = sit_in_journal(journal, i);
4453
4454 old_valid_blocks = se->valid_blocks;
8a29c126
JK
4455 if (IS_NODESEG(se->type))
4456 total_node_blocks -= old_valid_blocks;
d600af23 4457
c39a1b34
JK
4458 err = check_block_count(sbi, start, &sit);
4459 if (err)
4460 break;
d600af23 4461 seg_info_from_raw_sit(se, &sit);
8a29c126
JK
4462 if (IS_NODESEG(se->type))
4463 total_node_blocks += se->valid_blocks;
d600af23 4464
7d20c8ab
CY
4465 if (is_set_ckpt_flags(sbi, CP_TRIMMED_FLAG)) {
4466 memset(se->discard_map, 0xff, SIT_VBLOCK_MAP_SIZE);
4467 } else {
4468 memcpy(se->discard_map, se->cur_valid_map,
4469 SIT_VBLOCK_MAP_SIZE);
4470 sbi->discard_blks += old_valid_blocks;
4471 sbi->discard_blks -= se->valid_blocks;
d600af23
CY
4472 }
4473
2c70c5e3 4474 if (__is_large_section(sbi)) {
d600af23 4475 get_sec_entry(sbi, start)->valid_blocks +=
a9af3fdc
CY
4476 se->valid_blocks;
4477 get_sec_entry(sbi, start)->valid_blocks -=
4478 old_valid_blocks;
4479 }
d600af23
CY
4480 }
4481 up_read(&curseg->journal_rwsem);
8a29c126
JK
4482
4483 if (!err && total_node_blocks != valid_node_count(sbi)) {
dcbb4c10
JP
4484 f2fs_err(sbi, "SIT is corrupted node# %u vs %u",
4485 total_node_blocks, valid_node_count(sbi));
10f966bb 4486 err = -EFSCORRUPTED;
8a29c126
JK
4487 }
4488
c39a1b34 4489 return err;
351df4b2
JK
4490}
4491
4492static void init_free_segmap(struct f2fs_sb_info *sbi)
4493{
4494 unsigned int start;
4495 int type;
de881df9 4496 struct seg_entry *sentry;
351df4b2 4497
7cd8558b 4498 for (start = 0; start < MAIN_SEGS(sbi); start++) {
de881df9
AR
4499 if (f2fs_usable_blks_in_seg(sbi, start) == 0)
4500 continue;
4501 sentry = get_seg_entry(sbi, start);
351df4b2
JK
4502 if (!sentry->valid_blocks)
4503 __set_free(sbi, start);
c79b7ff1
JK
4504 else
4505 SIT_I(sbi)->written_valid_blocks +=
4506 sentry->valid_blocks;
351df4b2
JK
4507 }
4508
4509 /* set use the current segments */
4510 for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) {
4511 struct curseg_info *curseg_t = CURSEG_I(sbi, type);
4512 __set_test_and_inuse(sbi, curseg_t->segno);
4513 }
4514}
4515
4516static void init_dirty_segmap(struct f2fs_sb_info *sbi)
4517{
4518 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
4519 struct free_segmap_info *free_i = FREE_I(sbi);
da52f8ad 4520 unsigned int segno = 0, offset = 0, secno;
de881df9 4521 block_t valid_blocks, usable_blks_in_seg;
123aaf77 4522 block_t blks_per_sec = BLKS_PER_SEC(sbi);
351df4b2 4523
8736fbf0 4524 while (1) {
351df4b2 4525 /* find dirty segment based on free segmap */
7cd8558b
JK
4526 segno = find_next_inuse(free_i, MAIN_SEGS(sbi), offset);
4527 if (segno >= MAIN_SEGS(sbi))
351df4b2
JK
4528 break;
4529 offset = segno + 1;
302bd348 4530 valid_blocks = get_valid_blocks(sbi, segno, false);
de881df9
AR
4531 usable_blks_in_seg = f2fs_usable_blks_in_seg(sbi, segno);
4532 if (valid_blocks == usable_blks_in_seg || !valid_blocks)
351df4b2 4533 continue;
de881df9 4534 if (valid_blocks > usable_blks_in_seg) {
ec325b52
JK
4535 f2fs_bug_on(sbi, 1);
4536 continue;
4537 }
351df4b2
JK
4538 mutex_lock(&dirty_i->seglist_lock);
4539 __locate_dirty_segment(sbi, segno, DIRTY);
4540 mutex_unlock(&dirty_i->seglist_lock);
4541 }
da52f8ad
JQ
4542
4543 if (!__is_large_section(sbi))
4544 return;
4545
4546 mutex_lock(&dirty_i->seglist_lock);
4547 for (segno = 0; segno < MAIN_SECS(sbi); segno += blks_per_sec) {
4548 valid_blocks = get_valid_blocks(sbi, segno, true);
4549 secno = GET_SEC_FROM_SEG(sbi, segno);
4550
4551 if (!valid_blocks || valid_blocks == blks_per_sec)
4552 continue;
4553 if (IS_CURSEC(sbi, secno))
4554 continue;
4555 set_bit(secno, dirty_i->dirty_secmap);
4556 }
4557 mutex_unlock(&dirty_i->seglist_lock);
351df4b2
JK
4558}
4559
5ec4e49f 4560static int init_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK
4561{
4562 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
7cd8558b 4563 unsigned int bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
351df4b2 4564
628b3d14 4565 dirty_i->victim_secmap = f2fs_kvzalloc(sbi, bitmap_size, GFP_KERNEL);
5ec4e49f 4566 if (!dirty_i->victim_secmap)
351df4b2
JK
4567 return -ENOMEM;
4568 return 0;
4569}
4570
4571static int build_dirty_segmap(struct f2fs_sb_info *sbi)
4572{
4573 struct dirty_seglist_info *dirty_i;
4574 unsigned int bitmap_size, i;
4575
4576 /* allocate memory for dirty segments list information */
acbf054d
CY
4577 dirty_i = f2fs_kzalloc(sbi, sizeof(struct dirty_seglist_info),
4578 GFP_KERNEL);
351df4b2
JK
4579 if (!dirty_i)
4580 return -ENOMEM;
4581
4582 SM_I(sbi)->dirty_info = dirty_i;
4583 mutex_init(&dirty_i->seglist_lock);
4584
7cd8558b 4585 bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi));
351df4b2
JK
4586
4587 for (i = 0; i < NR_DIRTY_TYPE; i++) {
628b3d14
CY
4588 dirty_i->dirty_segmap[i] = f2fs_kvzalloc(sbi, bitmap_size,
4589 GFP_KERNEL);
351df4b2
JK
4590 if (!dirty_i->dirty_segmap[i])
4591 return -ENOMEM;
4592 }
4593
da52f8ad
JQ
4594 if (__is_large_section(sbi)) {
4595 bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi));
4596 dirty_i->dirty_secmap = f2fs_kvzalloc(sbi,
4597 bitmap_size, GFP_KERNEL);
4598 if (!dirty_i->dirty_secmap)
4599 return -ENOMEM;
4600 }
4601
351df4b2 4602 init_dirty_segmap(sbi);
5ec4e49f 4603 return init_victim_secmap(sbi);
351df4b2
JK
4604}
4605
c854f4d6
CY
4606static int sanity_check_curseg(struct f2fs_sb_info *sbi)
4607{
4608 int i;
4609
4610 /*
4611 * In LFS/SSR curseg, .next_blkoff should point to an unused blkaddr;
4612 * In LFS curseg, all blkaddr after .next_blkoff should be unused.
4613 */
d0b9e42a 4614 for (i = 0; i < NR_PERSISTENT_LOG; i++) {
c854f4d6
CY
4615 struct curseg_info *curseg = CURSEG_I(sbi, i);
4616 struct seg_entry *se = get_seg_entry(sbi, curseg->segno);
4617 unsigned int blkofs = curseg->next_blkoff;
4618
093749e2
CY
4619 sanity_check_seg_type(sbi, curseg->seg_type);
4620
c854f4d6
CY
4621 if (f2fs_test_bit(blkofs, se->cur_valid_map))
4622 goto out;
4623
4624 if (curseg->alloc_type == SSR)
4625 continue;
4626
4627 for (blkofs += 1; blkofs < sbi->blocks_per_seg; blkofs++) {
4628 if (!f2fs_test_bit(blkofs, se->cur_valid_map))
4629 continue;
4630out:
dcbb4c10
JP
4631 f2fs_err(sbi,
4632 "Current segment's next free block offset is inconsistent with bitmap, logtype:%u, segno:%u, type:%u, next_blkoff:%u, blkofs:%u",
4633 i, curseg->segno, curseg->alloc_type,
4634 curseg->next_blkoff, blkofs);
10f966bb 4635 return -EFSCORRUPTED;
c854f4d6
CY
4636 }
4637 }
4638 return 0;
4639}
4640
c426d991
SK
4641#ifdef CONFIG_BLK_DEV_ZONED
4642
d508c94e
SK
4643static int check_zone_write_pointer(struct f2fs_sb_info *sbi,
4644 struct f2fs_dev_info *fdev,
4645 struct blk_zone *zone)
4646{
4647 unsigned int wp_segno, wp_blkoff, zone_secno, zone_segno, segno;
4648 block_t zone_block, wp_block, last_valid_block;
4649 unsigned int log_sectors_per_block = sbi->log_blocksize - SECTOR_SHIFT;
4650 int i, s, b, ret;
4651 struct seg_entry *se;
4652
4653 if (zone->type != BLK_ZONE_TYPE_SEQWRITE_REQ)
4654 return 0;
4655
4656 wp_block = fdev->start_blk + (zone->wp >> log_sectors_per_block);
4657 wp_segno = GET_SEGNO(sbi, wp_block);
4658 wp_blkoff = wp_block - START_BLOCK(sbi, wp_segno);
4659 zone_block = fdev->start_blk + (zone->start >> log_sectors_per_block);
4660 zone_segno = GET_SEGNO(sbi, zone_block);
4661 zone_secno = GET_SEC_FROM_SEG(sbi, zone_segno);
4662
4663 if (zone_segno >= MAIN_SEGS(sbi))
4664 return 0;
4665
4666 /*
4667 * Skip check of zones cursegs point to, since
4668 * fix_curseg_write_pointer() checks them.
4669 */
4670 for (i = 0; i < NO_CHECK_TYPE; i++)
4671 if (zone_secno == GET_SEC_FROM_SEG(sbi,
4672 CURSEG_I(sbi, i)->segno))
4673 return 0;
4674
4675 /*
4676 * Get last valid block of the zone.
4677 */
4678 last_valid_block = zone_block - 1;
4679 for (s = sbi->segs_per_sec - 1; s >= 0; s--) {
4680 segno = zone_segno + s;
4681 se = get_seg_entry(sbi, segno);
4682 for (b = sbi->blocks_per_seg - 1; b >= 0; b--)
4683 if (f2fs_test_bit(b, se->cur_valid_map)) {
4684 last_valid_block = START_BLOCK(sbi, segno) + b;
4685 break;
4686 }
4687 if (last_valid_block >= zone_block)
4688 break;
4689 }
4690
4691 /*
4692 * If last valid block is beyond the write pointer, report the
4693 * inconsistency. This inconsistency does not cause write error
4694 * because the zone will not be selected for write operation until
4695 * it get discarded. Just report it.
4696 */
4697 if (last_valid_block >= wp_block) {
4698 f2fs_notice(sbi, "Valid block beyond write pointer: "
4699 "valid block[0x%x,0x%x] wp[0x%x,0x%x]",
4700 GET_SEGNO(sbi, last_valid_block),
4701 GET_BLKOFF_FROM_SEG0(sbi, last_valid_block),
4702 wp_segno, wp_blkoff);
4703 return 0;
4704 }
4705
4706 /*
4707 * If there is no valid block in the zone and if write pointer is
4708 * not at zone start, reset the write pointer.
4709 */
4710 if (last_valid_block + 1 == zone_block && zone->wp != zone->start) {
4711 f2fs_notice(sbi,
4712 "Zone without valid block has non-zero write "
4713 "pointer. Reset the write pointer: wp[0x%x,0x%x]",
4714 wp_segno, wp_blkoff);
4715 ret = __f2fs_issue_discard_zone(sbi, fdev->bdev, zone_block,
4716 zone->len >> log_sectors_per_block);
4717 if (ret) {
4718 f2fs_err(sbi, "Discard zone failed: %s (errno=%d)",
4719 fdev->path, ret);
4720 return ret;
4721 }
4722 }
4723
4724 return 0;
4725}
4726
c426d991
SK
4727static struct f2fs_dev_info *get_target_zoned_dev(struct f2fs_sb_info *sbi,
4728 block_t zone_blkaddr)
4729{
4730 int i;
4731
4732 for (i = 0; i < sbi->s_ndevs; i++) {
4733 if (!bdev_is_zoned(FDEV(i).bdev))
4734 continue;
4735 if (sbi->s_ndevs == 1 || (FDEV(i).start_blk <= zone_blkaddr &&
4736 zone_blkaddr <= FDEV(i).end_blk))
4737 return &FDEV(i);
4738 }
4739
4740 return NULL;
4741}
4742
4743static int report_one_zone_cb(struct blk_zone *zone, unsigned int idx,
4744 void *data) {
4745 memcpy(data, zone, sizeof(struct blk_zone));
4746 return 0;
4747}
4748
4749static int fix_curseg_write_pointer(struct f2fs_sb_info *sbi, int type)
4750{
4751 struct curseg_info *cs = CURSEG_I(sbi, type);
4752 struct f2fs_dev_info *zbd;
4753 struct blk_zone zone;
4754 unsigned int cs_section, wp_segno, wp_blkoff, wp_sector_off;
4755 block_t cs_zone_block, wp_block;
4756 unsigned int log_sectors_per_block = sbi->log_blocksize - SECTOR_SHIFT;
4757 sector_t zone_sector;
4758 int err;
4759
4760 cs_section = GET_SEC_FROM_SEG(sbi, cs->segno);
4761 cs_zone_block = START_BLOCK(sbi, GET_SEG_FROM_SEC(sbi, cs_section));
4762
4763 zbd = get_target_zoned_dev(sbi, cs_zone_block);
4764 if (!zbd)
4765 return 0;
4766
4767 /* report zone for the sector the curseg points to */
4768 zone_sector = (sector_t)(cs_zone_block - zbd->start_blk)
4769 << log_sectors_per_block;
4770 err = blkdev_report_zones(zbd->bdev, zone_sector, 1,
4771 report_one_zone_cb, &zone);
4772 if (err != 1) {
4773 f2fs_err(sbi, "Report zone failed: %s errno=(%d)",
4774 zbd->path, err);
4775 return err;
4776 }
4777
4778 if (zone.type != BLK_ZONE_TYPE_SEQWRITE_REQ)
4779 return 0;
4780
4781 wp_block = zbd->start_blk + (zone.wp >> log_sectors_per_block);
4782 wp_segno = GET_SEGNO(sbi, wp_block);
4783 wp_blkoff = wp_block - START_BLOCK(sbi, wp_segno);
4784 wp_sector_off = zone.wp & GENMASK(log_sectors_per_block - 1, 0);
4785
4786 if (cs->segno == wp_segno && cs->next_blkoff == wp_blkoff &&
4787 wp_sector_off == 0)
4788 return 0;
4789
4790 f2fs_notice(sbi, "Unaligned curseg[%d] with write pointer: "
4791 "curseg[0x%x,0x%x] wp[0x%x,0x%x]",
4792 type, cs->segno, cs->next_blkoff, wp_segno, wp_blkoff);
4793
4794 f2fs_notice(sbi, "Assign new section to curseg[%d]: "
4795 "curseg[0x%x,0x%x]", type, cs->segno, cs->next_blkoff);
4796 allocate_segment_by_default(sbi, type, true);
4797
d508c94e
SK
4798 /* check consistency of the zone curseg pointed to */
4799 if (check_zone_write_pointer(sbi, zbd, &zone))
4800 return -EIO;
4801
c426d991
SK
4802 /* check newly assigned zone */
4803 cs_section = GET_SEC_FROM_SEG(sbi, cs->segno);
4804 cs_zone_block = START_BLOCK(sbi, GET_SEG_FROM_SEC(sbi, cs_section));
4805
4806 zbd = get_target_zoned_dev(sbi, cs_zone_block);
4807 if (!zbd)
4808 return 0;
4809
4810 zone_sector = (sector_t)(cs_zone_block - zbd->start_blk)
4811 << log_sectors_per_block;
4812 err = blkdev_report_zones(zbd->bdev, zone_sector, 1,
4813 report_one_zone_cb, &zone);
4814 if (err != 1) {
4815 f2fs_err(sbi, "Report zone failed: %s errno=(%d)",
4816 zbd->path, err);
4817 return err;
4818 }
4819
4820 if (zone.type != BLK_ZONE_TYPE_SEQWRITE_REQ)
4821 return 0;
4822
4823 if (zone.wp != zone.start) {
4824 f2fs_notice(sbi,
4825 "New zone for curseg[%d] is not yet discarded. "
4826 "Reset the zone: curseg[0x%x,0x%x]",
4827 type, cs->segno, cs->next_blkoff);
4828 err = __f2fs_issue_discard_zone(sbi, zbd->bdev,
4829 zone_sector >> log_sectors_per_block,
4830 zone.len >> log_sectors_per_block);
4831 if (err) {
4832 f2fs_err(sbi, "Discard zone failed: %s (errno=%d)",
4833 zbd->path, err);
4834 return err;
4835 }
4836 }
4837
4838 return 0;
4839}
4840
4841int f2fs_fix_curseg_write_pointer(struct f2fs_sb_info *sbi)
4842{
4843 int i, ret;
4844
d0b9e42a 4845 for (i = 0; i < NR_PERSISTENT_LOG; i++) {
c426d991
SK
4846 ret = fix_curseg_write_pointer(sbi, i);
4847 if (ret)
4848 return ret;
4849 }
4850
4851 return 0;
4852}
d508c94e
SK
4853
4854struct check_zone_write_pointer_args {
4855 struct f2fs_sb_info *sbi;
4856 struct f2fs_dev_info *fdev;
4857};
4858
4859static int check_zone_write_pointer_cb(struct blk_zone *zone, unsigned int idx,
4860 void *data) {
4861 struct check_zone_write_pointer_args *args;
4862 args = (struct check_zone_write_pointer_args *)data;
4863
4864 return check_zone_write_pointer(args->sbi, args->fdev, zone);
4865}
4866
4867int f2fs_check_write_pointer(struct f2fs_sb_info *sbi)
4868{
4869 int i, ret;
4870 struct check_zone_write_pointer_args args;
4871
4872 for (i = 0; i < sbi->s_ndevs; i++) {
4873 if (!bdev_is_zoned(FDEV(i).bdev))
4874 continue;
4875
4876 args.sbi = sbi;
4877 args.fdev = &FDEV(i);
4878 ret = blkdev_report_zones(FDEV(i).bdev, 0, BLK_ALL_ZONES,
4879 check_zone_write_pointer_cb, &args);
4880 if (ret < 0)
4881 return ret;
4882 }
4883
4884 return 0;
4885}
de881df9
AR
4886
4887static bool is_conv_zone(struct f2fs_sb_info *sbi, unsigned int zone_idx,
4888 unsigned int dev_idx)
4889{
4890 if (!bdev_is_zoned(FDEV(dev_idx).bdev))
4891 return true;
4892 return !test_bit(zone_idx, FDEV(dev_idx).blkz_seq);
4893}
4894
4895/* Return the zone index in the given device */
4896static unsigned int get_zone_idx(struct f2fs_sb_info *sbi, unsigned int secno,
4897 int dev_idx)
4898{
4899 block_t sec_start_blkaddr = START_BLOCK(sbi, GET_SEG_FROM_SEC(sbi, secno));
4900
4901 return (sec_start_blkaddr - FDEV(dev_idx).start_blk) >>
4902 sbi->log_blocks_per_blkz;
4903}
4904
4905/*
4906 * Return the usable segments in a section based on the zone's
4907 * corresponding zone capacity. Zone is equal to a section.
4908 */
4909static inline unsigned int f2fs_usable_zone_segs_in_sec(
4910 struct f2fs_sb_info *sbi, unsigned int segno)
4911{
4912 unsigned int dev_idx, zone_idx, unusable_segs_in_sec;
4913
4914 dev_idx = f2fs_target_device_index(sbi, START_BLOCK(sbi, segno));
4915 zone_idx = get_zone_idx(sbi, GET_SEC_FROM_SEG(sbi, segno), dev_idx);
4916
4917 /* Conventional zone's capacity is always equal to zone size */
4918 if (is_conv_zone(sbi, zone_idx, dev_idx))
4919 return sbi->segs_per_sec;
4920
4921 /*
4922 * If the zone_capacity_blocks array is NULL, then zone capacity
4923 * is equal to the zone size for all zones
4924 */
4925 if (!FDEV(dev_idx).zone_capacity_blocks)
4926 return sbi->segs_per_sec;
4927
4928 /* Get the segment count beyond zone capacity block */
4929 unusable_segs_in_sec = (sbi->blocks_per_blkz -
4930 FDEV(dev_idx).zone_capacity_blocks[zone_idx]) >>
4931 sbi->log_blocks_per_seg;
4932 return sbi->segs_per_sec - unusable_segs_in_sec;
4933}
4934
4935/*
4936 * Return the number of usable blocks in a segment. The number of blocks
4937 * returned is always equal to the number of blocks in a segment for
4938 * segments fully contained within a sequential zone capacity or a
4939 * conventional zone. For segments partially contained in a sequential
4940 * zone capacity, the number of usable blocks up to the zone capacity
4941 * is returned. 0 is returned in all other cases.
4942 */
4943static inline unsigned int f2fs_usable_zone_blks_in_seg(
4944 struct f2fs_sb_info *sbi, unsigned int segno)
4945{
4946 block_t seg_start, sec_start_blkaddr, sec_cap_blkaddr;
4947 unsigned int zone_idx, dev_idx, secno;
4948
4949 secno = GET_SEC_FROM_SEG(sbi, segno);
4950 seg_start = START_BLOCK(sbi, segno);
4951 dev_idx = f2fs_target_device_index(sbi, seg_start);
4952 zone_idx = get_zone_idx(sbi, secno, dev_idx);
4953
4954 /*
4955 * Conventional zone's capacity is always equal to zone size,
4956 * so, blocks per segment is unchanged.
4957 */
4958 if (is_conv_zone(sbi, zone_idx, dev_idx))
4959 return sbi->blocks_per_seg;
4960
4961 if (!FDEV(dev_idx).zone_capacity_blocks)
4962 return sbi->blocks_per_seg;
4963
4964 sec_start_blkaddr = START_BLOCK(sbi, GET_SEG_FROM_SEC(sbi, secno));
4965 sec_cap_blkaddr = sec_start_blkaddr +
4966 FDEV(dev_idx).zone_capacity_blocks[zone_idx];
4967
4968 /*
4969 * If segment starts before zone capacity and spans beyond
4970 * zone capacity, then usable blocks are from seg start to
4971 * zone capacity. If the segment starts after the zone capacity,
4972 * then there are no usable blocks.
4973 */
4974 if (seg_start >= sec_cap_blkaddr)
4975 return 0;
4976 if (seg_start + sbi->blocks_per_seg > sec_cap_blkaddr)
4977 return sec_cap_blkaddr - seg_start;
4978
4979 return sbi->blocks_per_seg;
4980}
c426d991
SK
4981#else
4982int f2fs_fix_curseg_write_pointer(struct f2fs_sb_info *sbi)
4983{
4984 return 0;
4985}
d508c94e
SK
4986
4987int f2fs_check_write_pointer(struct f2fs_sb_info *sbi)
4988{
4989 return 0;
4990}
de881df9
AR
4991
4992static inline unsigned int f2fs_usable_zone_blks_in_seg(struct f2fs_sb_info *sbi,
4993 unsigned int segno)
4994{
4995 return 0;
4996}
4997
4998static inline unsigned int f2fs_usable_zone_segs_in_sec(struct f2fs_sb_info *sbi,
4999 unsigned int segno)
5000{
5001 return 0;
5002}
c426d991 5003#endif
de881df9
AR
5004unsigned int f2fs_usable_blks_in_seg(struct f2fs_sb_info *sbi,
5005 unsigned int segno)
5006{
5007 if (f2fs_sb_has_blkzoned(sbi))
5008 return f2fs_usable_zone_blks_in_seg(sbi, segno);
5009
5010 return sbi->blocks_per_seg;
5011}
5012
5013unsigned int f2fs_usable_segs_in_sec(struct f2fs_sb_info *sbi,
5014 unsigned int segno)
5015{
5016 if (f2fs_sb_has_blkzoned(sbi))
5017 return f2fs_usable_zone_segs_in_sec(sbi, segno);
5018
5019 return sbi->segs_per_sec;
5020}
c426d991 5021
0a8165d7 5022/*
351df4b2
JK
5023 * Update min, max modified time for cost-benefit GC algorithm
5024 */
5025static void init_min_max_mtime(struct f2fs_sb_info *sbi)
5026{
5027 struct sit_info *sit_i = SIT_I(sbi);
5028 unsigned int segno;
5029
3d26fa6b 5030 down_write(&sit_i->sentry_lock);
351df4b2 5031
5ad25442 5032 sit_i->min_mtime = ULLONG_MAX;
351df4b2 5033
7cd8558b 5034 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
351df4b2
JK
5035 unsigned int i;
5036 unsigned long long mtime = 0;
5037
5038 for (i = 0; i < sbi->segs_per_sec; i++)
5039 mtime += get_seg_entry(sbi, segno + i)->mtime;
5040
5041 mtime = div_u64(mtime, sbi->segs_per_sec);
5042
5043 if (sit_i->min_mtime > mtime)
5044 sit_i->min_mtime = mtime;
5045 }
a1f72ac2 5046 sit_i->max_mtime = get_mtime(sbi, false);
093749e2 5047 sit_i->dirty_max_mtime = 0;
3d26fa6b 5048 up_write(&sit_i->sentry_lock);
351df4b2
JK
5049}
5050
4d57b86d 5051int f2fs_build_segment_manager(struct f2fs_sb_info *sbi)
351df4b2
JK
5052{
5053 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
5054 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1042d60f 5055 struct f2fs_sm_info *sm_info;
351df4b2
JK
5056 int err;
5057
acbf054d 5058 sm_info = f2fs_kzalloc(sbi, sizeof(struct f2fs_sm_info), GFP_KERNEL);
351df4b2
JK
5059 if (!sm_info)
5060 return -ENOMEM;
5061
5062 /* init sm info */
5063 sbi->sm_info = sm_info;
351df4b2
JK
5064 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr);
5065 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr);
5066 sm_info->segment_count = le32_to_cpu(raw_super->segment_count);
5067 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count);
5068 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count);
5069 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main);
5070 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr);
58c41035
JK
5071 sm_info->rec_prefree_segments = sm_info->main_segments *
5072 DEF_RECLAIM_PREFREE_SEGMENTS / 100;
44a83499
JK
5073 if (sm_info->rec_prefree_segments > DEF_MAX_RECLAIM_PREFREE_SEGMENTS)
5074 sm_info->rec_prefree_segments = DEF_MAX_RECLAIM_PREFREE_SEGMENTS;
5075
b0332a0f 5076 if (!f2fs_lfs_mode(sbi))
52763a4b 5077 sm_info->ipu_policy = 1 << F2FS_IPU_FSYNC;
216fbd64 5078 sm_info->min_ipu_util = DEF_MIN_IPU_UTIL;
c1ce1b02 5079 sm_info->min_fsync_blocks = DEF_MIN_FSYNC_BLOCKS;
853137ce 5080 sm_info->min_seq_blocks = sbi->blocks_per_seg * sbi->segs_per_sec;
ef095d19 5081 sm_info->min_hot_blocks = DEF_MIN_HOT_BLOCKS;
a2a12b67 5082 sm_info->min_ssr_sections = reserved_sections(sbi);
351df4b2 5083
184a5cd2
CY
5084 INIT_LIST_HEAD(&sm_info->sit_entry_set);
5085
2b60311d
CY
5086 init_rwsem(&sm_info->curseg_lock);
5087
d4fdf8ba 5088 if (!f2fs_readonly(sbi->sb)) {
4d57b86d 5089 err = f2fs_create_flush_cmd_control(sbi);
2163d198 5090 if (err)
a688b9d9 5091 return err;
6b4afdd7
JK
5092 }
5093
0b54fb84
JK
5094 err = create_discard_cmd_control(sbi);
5095 if (err)
5096 return err;
5097
351df4b2
JK
5098 err = build_sit_info(sbi);
5099 if (err)
5100 return err;
5101 err = build_free_segmap(sbi);
5102 if (err)
5103 return err;
5104 err = build_curseg(sbi);
5105 if (err)
5106 return err;
5107
5108 /* reinit free segmap based on SIT */
c39a1b34
JK
5109 err = build_sit_entries(sbi);
5110 if (err)
5111 return err;
351df4b2
JK
5112
5113 init_free_segmap(sbi);
5114 err = build_dirty_segmap(sbi);
5115 if (err)
5116 return err;
5117
c854f4d6
CY
5118 err = sanity_check_curseg(sbi);
5119 if (err)
5120 return err;
5121
351df4b2
JK
5122 init_min_max_mtime(sbi);
5123 return 0;
5124}
5125
5126static void discard_dirty_segmap(struct f2fs_sb_info *sbi,
5127 enum dirty_type dirty_type)
5128{
5129 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5130
5131 mutex_lock(&dirty_i->seglist_lock);
39307a8e 5132 kvfree(dirty_i->dirty_segmap[dirty_type]);
351df4b2
JK
5133 dirty_i->nr_dirty[dirty_type] = 0;
5134 mutex_unlock(&dirty_i->seglist_lock);
5135}
5136
5ec4e49f 5137static void destroy_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK
5138{
5139 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
39307a8e 5140 kvfree(dirty_i->victim_secmap);
351df4b2
JK
5141}
5142
5143static void destroy_dirty_segmap(struct f2fs_sb_info *sbi)
5144{
5145 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5146 int i;
5147
5148 if (!dirty_i)
5149 return;
5150
5151 /* discard pre-free/dirty segments list */
5152 for (i = 0; i < NR_DIRTY_TYPE; i++)
5153 discard_dirty_segmap(sbi, i);
5154
da52f8ad
JQ
5155 if (__is_large_section(sbi)) {
5156 mutex_lock(&dirty_i->seglist_lock);
5157 kvfree(dirty_i->dirty_secmap);
5158 mutex_unlock(&dirty_i->seglist_lock);
5159 }
5160
5ec4e49f 5161 destroy_victim_secmap(sbi);
351df4b2 5162 SM_I(sbi)->dirty_info = NULL;
c8eb7024 5163 kfree(dirty_i);
351df4b2
JK
5164}
5165
5166static void destroy_curseg(struct f2fs_sb_info *sbi)
5167{
5168 struct curseg_info *array = SM_I(sbi)->curseg_array;
5169 int i;
5170
5171 if (!array)
5172 return;
5173 SM_I(sbi)->curseg_array = NULL;
b7ad7512 5174 for (i = 0; i < NR_CURSEG_TYPE; i++) {
c8eb7024
CY
5175 kfree(array[i].sum_blk);
5176 kfree(array[i].journal);
b7ad7512 5177 }
c8eb7024 5178 kfree(array);
351df4b2
JK
5179}
5180
5181static void destroy_free_segmap(struct f2fs_sb_info *sbi)
5182{
5183 struct free_segmap_info *free_i = SM_I(sbi)->free_info;
5184 if (!free_i)
5185 return;
5186 SM_I(sbi)->free_info = NULL;
39307a8e
JK
5187 kvfree(free_i->free_segmap);
5188 kvfree(free_i->free_secmap);
c8eb7024 5189 kfree(free_i);
351df4b2
JK
5190}
5191
5192static void destroy_sit_info(struct f2fs_sb_info *sbi)
5193{
5194 struct sit_info *sit_i = SIT_I(sbi);
351df4b2
JK
5195
5196 if (!sit_i)
5197 return;
5198
2fde3dd1
CY
5199 if (sit_i->sentries)
5200 kvfree(sit_i->bitmap);
c8eb7024 5201 kfree(sit_i->tmp_map);
60a3b782 5202
39307a8e
JK
5203 kvfree(sit_i->sentries);
5204 kvfree(sit_i->sec_entries);
5205 kvfree(sit_i->dirty_sentries_bitmap);
351df4b2
JK
5206
5207 SM_I(sbi)->sit_info = NULL;
5222595d 5208 kvfree(sit_i->sit_bitmap);
ae27d62e 5209#ifdef CONFIG_F2FS_CHECK_FS
5222595d 5210 kvfree(sit_i->sit_bitmap_mir);
bbf9f7d9 5211 kvfree(sit_i->invalid_segmap);
ae27d62e 5212#endif
c8eb7024 5213 kfree(sit_i);
351df4b2
JK
5214}
5215
4d57b86d 5216void f2fs_destroy_segment_manager(struct f2fs_sb_info *sbi)
351df4b2
JK
5217{
5218 struct f2fs_sm_info *sm_info = SM_I(sbi);
a688b9d9 5219
3b03f724
CY
5220 if (!sm_info)
5221 return;
4d57b86d 5222 f2fs_destroy_flush_cmd_control(sbi, true);
f099405f 5223 destroy_discard_cmd_control(sbi);
351df4b2
JK
5224 destroy_dirty_segmap(sbi);
5225 destroy_curseg(sbi);
5226 destroy_free_segmap(sbi);
5227 destroy_sit_info(sbi);
5228 sbi->sm_info = NULL;
c8eb7024 5229 kfree(sm_info);
351df4b2 5230}
7fd9e544 5231
4d57b86d 5232int __init f2fs_create_segment_manager_caches(void)
7fd9e544 5233{
98510003 5234 discard_entry_slab = f2fs_kmem_cache_create("f2fs_discard_entry",
e8512d2e 5235 sizeof(struct discard_entry));
7fd9e544 5236 if (!discard_entry_slab)
184a5cd2
CY
5237 goto fail;
5238
98510003 5239 discard_cmd_slab = f2fs_kmem_cache_create("f2fs_discard_cmd",
b01a9201
JK
5240 sizeof(struct discard_cmd));
5241 if (!discard_cmd_slab)
6ab2a308 5242 goto destroy_discard_entry;
275b66b0 5243
98510003 5244 sit_entry_set_slab = f2fs_kmem_cache_create("f2fs_sit_entry_set",
c9ee0085 5245 sizeof(struct sit_entry_set));
184a5cd2 5246 if (!sit_entry_set_slab)
b01a9201 5247 goto destroy_discard_cmd;
88b88a66 5248
98510003 5249 inmem_entry_slab = f2fs_kmem_cache_create("f2fs_inmem_page_entry",
88b88a66
JK
5250 sizeof(struct inmem_pages));
5251 if (!inmem_entry_slab)
5252 goto destroy_sit_entry_set;
7fd9e544 5253 return 0;
184a5cd2 5254
88b88a66
JK
5255destroy_sit_entry_set:
5256 kmem_cache_destroy(sit_entry_set_slab);
b01a9201
JK
5257destroy_discard_cmd:
5258 kmem_cache_destroy(discard_cmd_slab);
6ab2a308 5259destroy_discard_entry:
184a5cd2
CY
5260 kmem_cache_destroy(discard_entry_slab);
5261fail:
5262 return -ENOMEM;
7fd9e544
JK
5263}
5264
4d57b86d 5265void f2fs_destroy_segment_manager_caches(void)
7fd9e544 5266{
184a5cd2 5267 kmem_cache_destroy(sit_entry_set_slab);
b01a9201 5268 kmem_cache_destroy(discard_cmd_slab);
7fd9e544 5269 kmem_cache_destroy(discard_entry_slab);
88b88a66 5270 kmem_cache_destroy(inmem_entry_slab);
7fd9e544 5271}