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