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