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