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