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