4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
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.
12 #include <linux/f2fs_fs.h>
13 #include <linux/bio.h>
14 #include <linux/blkdev.h>
15 #include <linux/prefetch.h>
16 #include <linux/kthread.h>
17 #include <linux/vmalloc.h>
18 #include <linux/swap.h>
23 #include <trace/events/f2fs.h>
25 #define __reverse_ffz(x) __reverse_ffs(~(x))
27 static struct kmem_cache
*discard_entry_slab
;
28 static struct kmem_cache
*sit_entry_set_slab
;
29 static struct kmem_cache
*inmem_entry_slab
;
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.
35 static inline unsigned long __reverse_ffs(unsigned long word
)
39 #if BITS_PER_LONG == 64
40 if ((word
& 0xffffffff) == 0) {
45 if ((word
& 0xffff) == 0) {
49 if ((word
& 0xff) == 0) {
53 if ((word
& 0xf0) == 0)
57 if ((word
& 0xc) == 0)
61 if ((word
& 0x2) == 0)
67 * __find_rev_next(_zero)_bit is copied from lib/find_next_bit.c because
68 * f2fs_set_bit makes MSB and LSB reversed in a byte.
71 * f2fs_set_bit(0, bitmap) => 0000 0001
72 * f2fs_set_bit(7, bitmap) => 1000 0000
74 static unsigned long __find_rev_next_bit(const unsigned long *addr
,
75 unsigned long size
, unsigned long offset
)
77 const unsigned long *p
= addr
+ BIT_WORD(offset
);
78 unsigned long result
= offset
& ~(BITS_PER_LONG
- 1);
80 unsigned long mask
, submask
;
81 unsigned long quot
, rest
;
87 offset
%= BITS_PER_LONG
;
92 quot
= (offset
>> 3) << 3;
95 submask
= (unsigned char)(0xff << rest
) >> rest
;
99 if (size
< BITS_PER_LONG
)
104 size
-= BITS_PER_LONG
;
105 result
+= BITS_PER_LONG
;
107 while (size
& ~(BITS_PER_LONG
-1)) {
111 result
+= BITS_PER_LONG
;
112 size
-= BITS_PER_LONG
;
118 tmp
&= (~0UL >> (BITS_PER_LONG
- size
));
119 if (tmp
== 0UL) /* Are any bits set? */
120 return result
+ size
; /* Nope. */
122 return result
+ __reverse_ffs(tmp
);
125 static unsigned long __find_rev_next_zero_bit(const unsigned long *addr
,
126 unsigned long size
, unsigned long offset
)
128 const unsigned long *p
= addr
+ BIT_WORD(offset
);
129 unsigned long result
= offset
& ~(BITS_PER_LONG
- 1);
131 unsigned long mask
, submask
;
132 unsigned long quot
, rest
;
138 offset
%= BITS_PER_LONG
;
143 quot
= (offset
>> 3) << 3;
145 mask
= ~(~0UL << quot
);
146 submask
= (unsigned char)~((unsigned char)(0xff << rest
) >> rest
);
150 if (size
< BITS_PER_LONG
)
155 size
-= BITS_PER_LONG
;
156 result
+= BITS_PER_LONG
;
158 while (size
& ~(BITS_PER_LONG
- 1)) {
162 result
+= BITS_PER_LONG
;
163 size
-= BITS_PER_LONG
;
171 if (tmp
== ~0UL) /* Are any bits zero? */
172 return result
+ size
; /* Nope. */
174 return result
+ __reverse_ffz(tmp
);
177 void register_inmem_page(struct inode
*inode
, struct page
*page
)
179 struct f2fs_inode_info
*fi
= F2FS_I(inode
);
180 struct inmem_pages
*new;
183 SetPagePrivate(page
);
185 new = f2fs_kmem_cache_alloc(inmem_entry_slab
, GFP_NOFS
);
187 /* add atomic page indices to the list */
189 INIT_LIST_HEAD(&new->list
);
191 /* increase reference count with clean state */
192 mutex_lock(&fi
->inmem_lock
);
193 err
= radix_tree_insert(&fi
->inmem_root
, page
->index
, new);
194 if (err
== -EEXIST
) {
195 mutex_unlock(&fi
->inmem_lock
);
196 kmem_cache_free(inmem_entry_slab
, new);
199 mutex_unlock(&fi
->inmem_lock
);
203 list_add_tail(&new->list
, &fi
->inmem_pages
);
204 inc_page_count(F2FS_I_SB(inode
), F2FS_INMEM_PAGES
);
205 mutex_unlock(&fi
->inmem_lock
);
208 void invalidate_inmem_page(struct inode
*inode
, struct page
*page
)
210 struct f2fs_inode_info
*fi
= F2FS_I(inode
);
211 struct inmem_pages
*cur
;
213 mutex_lock(&fi
->inmem_lock
);
214 cur
= radix_tree_lookup(&fi
->inmem_root
, page
->index
);
216 radix_tree_delete(&fi
->inmem_root
, cur
->page
->index
);
217 f2fs_put_page(cur
->page
, 0);
218 list_del(&cur
->list
);
219 kmem_cache_free(inmem_entry_slab
, cur
);
220 dec_page_count(F2FS_I_SB(inode
), F2FS_INMEM_PAGES
);
222 mutex_unlock(&fi
->inmem_lock
);
225 void commit_inmem_pages(struct inode
*inode
, bool abort
)
227 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
228 struct f2fs_inode_info
*fi
= F2FS_I(inode
);
229 struct inmem_pages
*cur
, *tmp
;
230 bool submit_bio
= false;
231 struct f2fs_io_info fio
= {
233 .rw
= WRITE_SYNC
| REQ_PRIO
,
237 * The abort is true only when f2fs_evict_inode is called.
238 * Basically, the f2fs_evict_inode doesn't produce any data writes, so
239 * that we don't need to call f2fs_balance_fs.
240 * Otherwise, f2fs_gc in f2fs_balance_fs can wait forever until this
241 * inode becomes free by iget_locked in f2fs_iget.
244 f2fs_balance_fs(sbi
);
248 mutex_lock(&fi
->inmem_lock
);
249 list_for_each_entry_safe(cur
, tmp
, &fi
->inmem_pages
, list
) {
251 lock_page(cur
->page
);
252 if (cur
->page
->mapping
== inode
->i_mapping
) {
253 f2fs_wait_on_page_writeback(cur
->page
, DATA
);
254 if (clear_page_dirty_for_io(cur
->page
))
255 inode_dec_dirty_pages(inode
);
256 do_write_data_page(cur
->page
, &fio
);
259 f2fs_put_page(cur
->page
, 1);
263 radix_tree_delete(&fi
->inmem_root
, cur
->page
->index
);
264 list_del(&cur
->list
);
265 kmem_cache_free(inmem_entry_slab
, cur
);
266 dec_page_count(F2FS_I_SB(inode
), F2FS_INMEM_PAGES
);
268 mutex_unlock(&fi
->inmem_lock
);
273 f2fs_submit_merged_bio(sbi
, DATA
, WRITE
);
278 * This function balances dirty node and dentry pages.
279 * In addition, it controls garbage collection.
281 void f2fs_balance_fs(struct f2fs_sb_info
*sbi
)
284 * We should do GC or end up with checkpoint, if there are so many dirty
285 * dir/node pages without enough free segments.
287 if (has_not_enough_free_secs(sbi
, 0)) {
288 mutex_lock(&sbi
->gc_mutex
);
293 void f2fs_balance_fs_bg(struct f2fs_sb_info
*sbi
)
295 /* check the # of cached NAT entries and prefree segments */
296 if (try_to_free_nats(sbi
, NAT_ENTRY_PER_BLOCK
) ||
297 excess_prefree_segs(sbi
) ||
298 !available_free_memory(sbi
, INO_ENTRIES
))
299 f2fs_sync_fs(sbi
->sb
, true);
302 static int issue_flush_thread(void *data
)
304 struct f2fs_sb_info
*sbi
= data
;
305 struct flush_cmd_control
*fcc
= SM_I(sbi
)->cmd_control_info
;
306 wait_queue_head_t
*q
= &fcc
->flush_wait_queue
;
308 if (kthread_should_stop())
311 if (!llist_empty(&fcc
->issue_list
)) {
312 struct bio
*bio
= bio_alloc(GFP_NOIO
, 0);
313 struct flush_cmd
*cmd
, *next
;
316 fcc
->dispatch_list
= llist_del_all(&fcc
->issue_list
);
317 fcc
->dispatch_list
= llist_reverse_order(fcc
->dispatch_list
);
319 bio
->bi_bdev
= sbi
->sb
->s_bdev
;
320 ret
= submit_bio_wait(WRITE_FLUSH
, bio
);
322 llist_for_each_entry_safe(cmd
, next
,
323 fcc
->dispatch_list
, llnode
) {
325 complete(&cmd
->wait
);
328 fcc
->dispatch_list
= NULL
;
331 wait_event_interruptible(*q
,
332 kthread_should_stop() || !llist_empty(&fcc
->issue_list
));
336 int f2fs_issue_flush(struct f2fs_sb_info
*sbi
)
338 struct flush_cmd_control
*fcc
= SM_I(sbi
)->cmd_control_info
;
339 struct flush_cmd cmd
;
341 trace_f2fs_issue_flush(sbi
->sb
, test_opt(sbi
, NOBARRIER
),
342 test_opt(sbi
, FLUSH_MERGE
));
344 if (test_opt(sbi
, NOBARRIER
))
347 if (!test_opt(sbi
, FLUSH_MERGE
))
348 return blkdev_issue_flush(sbi
->sb
->s_bdev
, GFP_KERNEL
, NULL
);
350 init_completion(&cmd
.wait
);
352 llist_add(&cmd
.llnode
, &fcc
->issue_list
);
354 if (!fcc
->dispatch_list
)
355 wake_up(&fcc
->flush_wait_queue
);
357 wait_for_completion(&cmd
.wait
);
362 int create_flush_cmd_control(struct f2fs_sb_info
*sbi
)
364 dev_t dev
= sbi
->sb
->s_bdev
->bd_dev
;
365 struct flush_cmd_control
*fcc
;
368 fcc
= kzalloc(sizeof(struct flush_cmd_control
), GFP_KERNEL
);
371 init_waitqueue_head(&fcc
->flush_wait_queue
);
372 init_llist_head(&fcc
->issue_list
);
373 SM_I(sbi
)->cmd_control_info
= fcc
;
374 fcc
->f2fs_issue_flush
= kthread_run(issue_flush_thread
, sbi
,
375 "f2fs_flush-%u:%u", MAJOR(dev
), MINOR(dev
));
376 if (IS_ERR(fcc
->f2fs_issue_flush
)) {
377 err
= PTR_ERR(fcc
->f2fs_issue_flush
);
379 SM_I(sbi
)->cmd_control_info
= NULL
;
386 void destroy_flush_cmd_control(struct f2fs_sb_info
*sbi
)
388 struct flush_cmd_control
*fcc
= SM_I(sbi
)->cmd_control_info
;
390 if (fcc
&& fcc
->f2fs_issue_flush
)
391 kthread_stop(fcc
->f2fs_issue_flush
);
393 SM_I(sbi
)->cmd_control_info
= NULL
;
396 static void __locate_dirty_segment(struct f2fs_sb_info
*sbi
, unsigned int segno
,
397 enum dirty_type dirty_type
)
399 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
401 /* need not be added */
402 if (IS_CURSEG(sbi
, segno
))
405 if (!test_and_set_bit(segno
, dirty_i
->dirty_segmap
[dirty_type
]))
406 dirty_i
->nr_dirty
[dirty_type
]++;
408 if (dirty_type
== DIRTY
) {
409 struct seg_entry
*sentry
= get_seg_entry(sbi
, segno
);
410 enum dirty_type t
= sentry
->type
;
412 if (unlikely(t
>= DIRTY
)) {
416 if (!test_and_set_bit(segno
, dirty_i
->dirty_segmap
[t
]))
417 dirty_i
->nr_dirty
[t
]++;
421 static void __remove_dirty_segment(struct f2fs_sb_info
*sbi
, unsigned int segno
,
422 enum dirty_type dirty_type
)
424 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
426 if (test_and_clear_bit(segno
, dirty_i
->dirty_segmap
[dirty_type
]))
427 dirty_i
->nr_dirty
[dirty_type
]--;
429 if (dirty_type
== DIRTY
) {
430 struct seg_entry
*sentry
= get_seg_entry(sbi
, segno
);
431 enum dirty_type t
= sentry
->type
;
433 if (test_and_clear_bit(segno
, dirty_i
->dirty_segmap
[t
]))
434 dirty_i
->nr_dirty
[t
]--;
436 if (get_valid_blocks(sbi
, segno
, sbi
->segs_per_sec
) == 0)
437 clear_bit(GET_SECNO(sbi
, segno
),
438 dirty_i
->victim_secmap
);
443 * Should not occur error such as -ENOMEM.
444 * Adding dirty entry into seglist is not critical operation.
445 * If a given segment is one of current working segments, it won't be added.
447 static void locate_dirty_segment(struct f2fs_sb_info
*sbi
, unsigned int segno
)
449 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
450 unsigned short valid_blocks
;
452 if (segno
== NULL_SEGNO
|| IS_CURSEG(sbi
, segno
))
455 mutex_lock(&dirty_i
->seglist_lock
);
457 valid_blocks
= get_valid_blocks(sbi
, segno
, 0);
459 if (valid_blocks
== 0) {
460 __locate_dirty_segment(sbi
, segno
, PRE
);
461 __remove_dirty_segment(sbi
, segno
, DIRTY
);
462 } else if (valid_blocks
< sbi
->blocks_per_seg
) {
463 __locate_dirty_segment(sbi
, segno
, DIRTY
);
465 /* Recovery routine with SSR needs this */
466 __remove_dirty_segment(sbi
, segno
, DIRTY
);
469 mutex_unlock(&dirty_i
->seglist_lock
);
472 static int f2fs_issue_discard(struct f2fs_sb_info
*sbi
,
473 block_t blkstart
, block_t blklen
)
475 sector_t start
= SECTOR_FROM_BLOCK(blkstart
);
476 sector_t len
= SECTOR_FROM_BLOCK(blklen
);
477 trace_f2fs_issue_discard(sbi
->sb
, blkstart
, blklen
);
478 return blkdev_issue_discard(sbi
->sb
->s_bdev
, start
, len
, GFP_NOFS
, 0);
481 void discard_next_dnode(struct f2fs_sb_info
*sbi
, block_t blkaddr
)
483 if (f2fs_issue_discard(sbi
, blkaddr
, 1)) {
484 struct page
*page
= grab_meta_page(sbi
, blkaddr
);
485 /* zero-filled page */
486 set_page_dirty(page
);
487 f2fs_put_page(page
, 1);
491 static void __add_discard_entry(struct f2fs_sb_info
*sbi
,
492 struct cp_control
*cpc
, unsigned int start
, unsigned int end
)
494 struct list_head
*head
= &SM_I(sbi
)->discard_list
;
495 struct discard_entry
*new, *last
;
497 if (!list_empty(head
)) {
498 last
= list_last_entry(head
, struct discard_entry
, list
);
499 if (START_BLOCK(sbi
, cpc
->trim_start
) + start
==
500 last
->blkaddr
+ last
->len
) {
501 last
->len
+= end
- start
;
506 new = f2fs_kmem_cache_alloc(discard_entry_slab
, GFP_NOFS
);
507 INIT_LIST_HEAD(&new->list
);
508 new->blkaddr
= START_BLOCK(sbi
, cpc
->trim_start
) + start
;
509 new->len
= end
- start
;
510 list_add_tail(&new->list
, head
);
512 SM_I(sbi
)->nr_discards
+= end
- start
;
513 cpc
->trimmed
+= end
- start
;
516 static void add_discard_addrs(struct f2fs_sb_info
*sbi
, struct cp_control
*cpc
)
518 int entries
= SIT_VBLOCK_MAP_SIZE
/ sizeof(unsigned long);
519 int max_blocks
= sbi
->blocks_per_seg
;
520 struct seg_entry
*se
= get_seg_entry(sbi
, cpc
->trim_start
);
521 unsigned long *cur_map
= (unsigned long *)se
->cur_valid_map
;
522 unsigned long *ckpt_map
= (unsigned long *)se
->ckpt_valid_map
;
523 unsigned long dmap
[entries
];
524 unsigned int start
= 0, end
= -1;
525 bool force
= (cpc
->reason
== CP_DISCARD
);
528 if (!force
&& !test_opt(sbi
, DISCARD
))
531 if (force
&& !se
->valid_blocks
) {
532 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
534 * if this segment is registered in the prefree list, then
535 * we should skip adding a discard candidate, and let the
536 * checkpoint do that later.
538 mutex_lock(&dirty_i
->seglist_lock
);
539 if (test_bit(cpc
->trim_start
, dirty_i
->dirty_segmap
[PRE
])) {
540 mutex_unlock(&dirty_i
->seglist_lock
);
541 cpc
->trimmed
+= sbi
->blocks_per_seg
;
544 mutex_unlock(&dirty_i
->seglist_lock
);
546 __add_discard_entry(sbi
, cpc
, 0, sbi
->blocks_per_seg
);
550 /* zero block will be discarded through the prefree list */
551 if (!se
->valid_blocks
|| se
->valid_blocks
== max_blocks
)
554 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
555 for (i
= 0; i
< entries
; i
++)
556 dmap
[i
] = ~(cur_map
[i
] | ckpt_map
[i
]);
558 while (force
|| SM_I(sbi
)->nr_discards
<= SM_I(sbi
)->max_discards
) {
559 start
= __find_rev_next_bit(dmap
, max_blocks
, end
+ 1);
560 if (start
>= max_blocks
)
563 end
= __find_rev_next_zero_bit(dmap
, max_blocks
, start
+ 1);
565 if (end
- start
< cpc
->trim_minlen
)
568 __add_discard_entry(sbi
, cpc
, start
, end
);
572 void release_discard_addrs(struct f2fs_sb_info
*sbi
)
574 struct list_head
*head
= &(SM_I(sbi
)->discard_list
);
575 struct discard_entry
*entry
, *this;
578 list_for_each_entry_safe(entry
, this, head
, list
) {
579 list_del(&entry
->list
);
580 kmem_cache_free(discard_entry_slab
, entry
);
585 * Should call clear_prefree_segments after checkpoint is done.
587 static void set_prefree_as_free_segments(struct f2fs_sb_info
*sbi
)
589 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
592 mutex_lock(&dirty_i
->seglist_lock
);
593 for_each_set_bit(segno
, dirty_i
->dirty_segmap
[PRE
], MAIN_SEGS(sbi
))
594 __set_test_and_free(sbi
, segno
);
595 mutex_unlock(&dirty_i
->seglist_lock
);
598 void clear_prefree_segments(struct f2fs_sb_info
*sbi
)
600 struct list_head
*head
= &(SM_I(sbi
)->discard_list
);
601 struct discard_entry
*entry
, *this;
602 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
603 unsigned long *prefree_map
= dirty_i
->dirty_segmap
[PRE
];
604 unsigned int start
= 0, end
= -1;
606 mutex_lock(&dirty_i
->seglist_lock
);
610 start
= find_next_bit(prefree_map
, MAIN_SEGS(sbi
), end
+ 1);
611 if (start
>= MAIN_SEGS(sbi
))
613 end
= find_next_zero_bit(prefree_map
, MAIN_SEGS(sbi
),
616 for (i
= start
; i
< end
; i
++)
617 clear_bit(i
, prefree_map
);
619 dirty_i
->nr_dirty
[PRE
] -= end
- start
;
621 if (!test_opt(sbi
, DISCARD
))
624 f2fs_issue_discard(sbi
, START_BLOCK(sbi
, start
),
625 (end
- start
) << sbi
->log_blocks_per_seg
);
627 mutex_unlock(&dirty_i
->seglist_lock
);
629 /* send small discards */
630 list_for_each_entry_safe(entry
, this, head
, list
) {
631 f2fs_issue_discard(sbi
, entry
->blkaddr
, entry
->len
);
632 list_del(&entry
->list
);
633 SM_I(sbi
)->nr_discards
-= entry
->len
;
634 kmem_cache_free(discard_entry_slab
, entry
);
638 static bool __mark_sit_entry_dirty(struct f2fs_sb_info
*sbi
, unsigned int segno
)
640 struct sit_info
*sit_i
= SIT_I(sbi
);
642 if (!__test_and_set_bit(segno
, sit_i
->dirty_sentries_bitmap
)) {
643 sit_i
->dirty_sentries
++;
650 static void __set_sit_entry_type(struct f2fs_sb_info
*sbi
, int type
,
651 unsigned int segno
, int modified
)
653 struct seg_entry
*se
= get_seg_entry(sbi
, segno
);
656 __mark_sit_entry_dirty(sbi
, segno
);
659 static void update_sit_entry(struct f2fs_sb_info
*sbi
, block_t blkaddr
, int del
)
661 struct seg_entry
*se
;
662 unsigned int segno
, offset
;
663 long int new_vblocks
;
665 segno
= GET_SEGNO(sbi
, blkaddr
);
667 se
= get_seg_entry(sbi
, segno
);
668 new_vblocks
= se
->valid_blocks
+ del
;
669 offset
= GET_BLKOFF_FROM_SEG0(sbi
, blkaddr
);
671 f2fs_bug_on(sbi
, (new_vblocks
>> (sizeof(unsigned short) << 3) ||
672 (new_vblocks
> sbi
->blocks_per_seg
)));
674 se
->valid_blocks
= new_vblocks
;
675 se
->mtime
= get_mtime(sbi
);
676 SIT_I(sbi
)->max_mtime
= se
->mtime
;
678 /* Update valid block bitmap */
680 if (f2fs_test_and_set_bit(offset
, se
->cur_valid_map
))
683 if (!f2fs_test_and_clear_bit(offset
, se
->cur_valid_map
))
686 if (!f2fs_test_bit(offset
, se
->ckpt_valid_map
))
687 se
->ckpt_valid_blocks
+= del
;
689 __mark_sit_entry_dirty(sbi
, segno
);
691 /* update total number of valid blocks to be written in ckpt area */
692 SIT_I(sbi
)->written_valid_blocks
+= del
;
694 if (sbi
->segs_per_sec
> 1)
695 get_sec_entry(sbi
, segno
)->valid_blocks
+= del
;
698 void refresh_sit_entry(struct f2fs_sb_info
*sbi
, block_t old
, block_t
new)
700 update_sit_entry(sbi
, new, 1);
701 if (GET_SEGNO(sbi
, old
) != NULL_SEGNO
)
702 update_sit_entry(sbi
, old
, -1);
704 locate_dirty_segment(sbi
, GET_SEGNO(sbi
, old
));
705 locate_dirty_segment(sbi
, GET_SEGNO(sbi
, new));
708 void invalidate_blocks(struct f2fs_sb_info
*sbi
, block_t addr
)
710 unsigned int segno
= GET_SEGNO(sbi
, addr
);
711 struct sit_info
*sit_i
= SIT_I(sbi
);
713 f2fs_bug_on(sbi
, addr
== NULL_ADDR
);
714 if (addr
== NEW_ADDR
)
717 /* add it into sit main buffer */
718 mutex_lock(&sit_i
->sentry_lock
);
720 update_sit_entry(sbi
, addr
, -1);
722 /* add it into dirty seglist */
723 locate_dirty_segment(sbi
, segno
);
725 mutex_unlock(&sit_i
->sentry_lock
);
729 * This function should be resided under the curseg_mutex lock
731 static void __add_sum_entry(struct f2fs_sb_info
*sbi
, int type
,
732 struct f2fs_summary
*sum
)
734 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
735 void *addr
= curseg
->sum_blk
;
736 addr
+= curseg
->next_blkoff
* sizeof(struct f2fs_summary
);
737 memcpy(addr
, sum
, sizeof(struct f2fs_summary
));
741 * Calculate the number of current summary pages for writing
743 int npages_for_summary_flush(struct f2fs_sb_info
*sbi
)
745 int valid_sum_count
= 0;
748 for (i
= CURSEG_HOT_DATA
; i
<= CURSEG_COLD_DATA
; i
++) {
749 if (sbi
->ckpt
->alloc_type
[i
] == SSR
)
750 valid_sum_count
+= sbi
->blocks_per_seg
;
752 valid_sum_count
+= curseg_blkoff(sbi
, i
);
755 sum_in_page
= (PAGE_CACHE_SIZE
- 2 * SUM_JOURNAL_SIZE
-
756 SUM_FOOTER_SIZE
) / SUMMARY_SIZE
;
757 if (valid_sum_count
<= sum_in_page
)
759 else if ((valid_sum_count
- sum_in_page
) <=
760 (PAGE_CACHE_SIZE
- SUM_FOOTER_SIZE
) / SUMMARY_SIZE
)
766 * Caller should put this summary page
768 struct page
*get_sum_page(struct f2fs_sb_info
*sbi
, unsigned int segno
)
770 return get_meta_page(sbi
, GET_SUM_BLOCK(sbi
, segno
));
773 static void write_sum_page(struct f2fs_sb_info
*sbi
,
774 struct f2fs_summary_block
*sum_blk
, block_t blk_addr
)
776 struct page
*page
= grab_meta_page(sbi
, blk_addr
);
777 void *kaddr
= page_address(page
);
778 memcpy(kaddr
, sum_blk
, PAGE_CACHE_SIZE
);
779 set_page_dirty(page
);
780 f2fs_put_page(page
, 1);
783 static int is_next_segment_free(struct f2fs_sb_info
*sbi
, int type
)
785 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
786 unsigned int segno
= curseg
->segno
+ 1;
787 struct free_segmap_info
*free_i
= FREE_I(sbi
);
789 if (segno
< MAIN_SEGS(sbi
) && segno
% sbi
->segs_per_sec
)
790 return !test_bit(segno
, free_i
->free_segmap
);
795 * Find a new segment from the free segments bitmap to right order
796 * This function should be returned with success, otherwise BUG
798 static void get_new_segment(struct f2fs_sb_info
*sbi
,
799 unsigned int *newseg
, bool new_sec
, int dir
)
801 struct free_segmap_info
*free_i
= FREE_I(sbi
);
802 unsigned int segno
, secno
, zoneno
;
803 unsigned int total_zones
= MAIN_SECS(sbi
) / sbi
->secs_per_zone
;
804 unsigned int hint
= *newseg
/ sbi
->segs_per_sec
;
805 unsigned int old_zoneno
= GET_ZONENO_FROM_SEGNO(sbi
, *newseg
);
806 unsigned int left_start
= hint
;
811 write_lock(&free_i
->segmap_lock
);
813 if (!new_sec
&& ((*newseg
+ 1) % sbi
->segs_per_sec
)) {
814 segno
= find_next_zero_bit(free_i
->free_segmap
,
815 MAIN_SEGS(sbi
), *newseg
+ 1);
816 if (segno
- *newseg
< sbi
->segs_per_sec
-
817 (*newseg
% sbi
->segs_per_sec
))
821 secno
= find_next_zero_bit(free_i
->free_secmap
, MAIN_SECS(sbi
), hint
);
822 if (secno
>= MAIN_SECS(sbi
)) {
823 if (dir
== ALLOC_RIGHT
) {
824 secno
= find_next_zero_bit(free_i
->free_secmap
,
826 f2fs_bug_on(sbi
, secno
>= MAIN_SECS(sbi
));
829 left_start
= hint
- 1;
835 while (test_bit(left_start
, free_i
->free_secmap
)) {
836 if (left_start
> 0) {
840 left_start
= find_next_zero_bit(free_i
->free_secmap
,
842 f2fs_bug_on(sbi
, left_start
>= MAIN_SECS(sbi
));
848 segno
= secno
* sbi
->segs_per_sec
;
849 zoneno
= secno
/ sbi
->secs_per_zone
;
851 /* give up on finding another zone */
854 if (sbi
->secs_per_zone
== 1)
856 if (zoneno
== old_zoneno
)
858 if (dir
== ALLOC_LEFT
) {
859 if (!go_left
&& zoneno
+ 1 >= total_zones
)
861 if (go_left
&& zoneno
== 0)
864 for (i
= 0; i
< NR_CURSEG_TYPE
; i
++)
865 if (CURSEG_I(sbi
, i
)->zone
== zoneno
)
868 if (i
< NR_CURSEG_TYPE
) {
869 /* zone is in user, try another */
871 hint
= zoneno
* sbi
->secs_per_zone
- 1;
872 else if (zoneno
+ 1 >= total_zones
)
875 hint
= (zoneno
+ 1) * sbi
->secs_per_zone
;
877 goto find_other_zone
;
880 /* set it as dirty segment in free segmap */
881 f2fs_bug_on(sbi
, test_bit(segno
, free_i
->free_segmap
));
882 __set_inuse(sbi
, segno
);
884 write_unlock(&free_i
->segmap_lock
);
887 static void reset_curseg(struct f2fs_sb_info
*sbi
, int type
, int modified
)
889 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
890 struct summary_footer
*sum_footer
;
892 curseg
->segno
= curseg
->next_segno
;
893 curseg
->zone
= GET_ZONENO_FROM_SEGNO(sbi
, curseg
->segno
);
894 curseg
->next_blkoff
= 0;
895 curseg
->next_segno
= NULL_SEGNO
;
897 sum_footer
= &(curseg
->sum_blk
->footer
);
898 memset(sum_footer
, 0, sizeof(struct summary_footer
));
899 if (IS_DATASEG(type
))
900 SET_SUM_TYPE(sum_footer
, SUM_TYPE_DATA
);
901 if (IS_NODESEG(type
))
902 SET_SUM_TYPE(sum_footer
, SUM_TYPE_NODE
);
903 __set_sit_entry_type(sbi
, type
, curseg
->segno
, modified
);
907 * Allocate a current working segment.
908 * This function always allocates a free segment in LFS manner.
910 static void new_curseg(struct f2fs_sb_info
*sbi
, int type
, bool new_sec
)
912 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
913 unsigned int segno
= curseg
->segno
;
914 int dir
= ALLOC_LEFT
;
916 write_sum_page(sbi
, curseg
->sum_blk
,
917 GET_SUM_BLOCK(sbi
, segno
));
918 if (type
== CURSEG_WARM_DATA
|| type
== CURSEG_COLD_DATA
)
921 if (test_opt(sbi
, NOHEAP
))
924 get_new_segment(sbi
, &segno
, new_sec
, dir
);
925 curseg
->next_segno
= segno
;
926 reset_curseg(sbi
, type
, 1);
927 curseg
->alloc_type
= LFS
;
930 static void __next_free_blkoff(struct f2fs_sb_info
*sbi
,
931 struct curseg_info
*seg
, block_t start
)
933 struct seg_entry
*se
= get_seg_entry(sbi
, seg
->segno
);
934 int entries
= SIT_VBLOCK_MAP_SIZE
/ sizeof(unsigned long);
935 unsigned long target_map
[entries
];
936 unsigned long *ckpt_map
= (unsigned long *)se
->ckpt_valid_map
;
937 unsigned long *cur_map
= (unsigned long *)se
->cur_valid_map
;
940 for (i
= 0; i
< entries
; i
++)
941 target_map
[i
] = ckpt_map
[i
] | cur_map
[i
];
943 pos
= __find_rev_next_zero_bit(target_map
, sbi
->blocks_per_seg
, start
);
945 seg
->next_blkoff
= pos
;
949 * If a segment is written by LFS manner, next block offset is just obtained
950 * by increasing the current block offset. However, if a segment is written by
951 * SSR manner, next block offset obtained by calling __next_free_blkoff
953 static void __refresh_next_blkoff(struct f2fs_sb_info
*sbi
,
954 struct curseg_info
*seg
)
956 if (seg
->alloc_type
== SSR
)
957 __next_free_blkoff(sbi
, seg
, seg
->next_blkoff
+ 1);
963 * This function always allocates a used segment(from dirty seglist) by SSR
964 * manner, so it should recover the existing segment information of valid blocks
966 static void change_curseg(struct f2fs_sb_info
*sbi
, int type
, bool reuse
)
968 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
969 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
970 unsigned int new_segno
= curseg
->next_segno
;
971 struct f2fs_summary_block
*sum_node
;
972 struct page
*sum_page
;
974 write_sum_page(sbi
, curseg
->sum_blk
,
975 GET_SUM_BLOCK(sbi
, curseg
->segno
));
976 __set_test_and_inuse(sbi
, new_segno
);
978 mutex_lock(&dirty_i
->seglist_lock
);
979 __remove_dirty_segment(sbi
, new_segno
, PRE
);
980 __remove_dirty_segment(sbi
, new_segno
, DIRTY
);
981 mutex_unlock(&dirty_i
->seglist_lock
);
983 reset_curseg(sbi
, type
, 1);
984 curseg
->alloc_type
= SSR
;
985 __next_free_blkoff(sbi
, curseg
, 0);
988 sum_page
= get_sum_page(sbi
, new_segno
);
989 sum_node
= (struct f2fs_summary_block
*)page_address(sum_page
);
990 memcpy(curseg
->sum_blk
, sum_node
, SUM_ENTRY_SIZE
);
991 f2fs_put_page(sum_page
, 1);
995 static int get_ssr_segment(struct f2fs_sb_info
*sbi
, int type
)
997 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
998 const struct victim_selection
*v_ops
= DIRTY_I(sbi
)->v_ops
;
1000 if (IS_NODESEG(type
) || !has_not_enough_free_secs(sbi
, 0))
1001 return v_ops
->get_victim(sbi
,
1002 &(curseg
)->next_segno
, BG_GC
, type
, SSR
);
1004 /* For data segments, let's do SSR more intensively */
1005 for (; type
>= CURSEG_HOT_DATA
; type
--)
1006 if (v_ops
->get_victim(sbi
, &(curseg
)->next_segno
,
1013 * flush out current segment and replace it with new segment
1014 * This function should be returned with success, otherwise BUG
1016 static void allocate_segment_by_default(struct f2fs_sb_info
*sbi
,
1017 int type
, bool force
)
1019 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
1022 new_curseg(sbi
, type
, true);
1023 else if (type
== CURSEG_WARM_NODE
)
1024 new_curseg(sbi
, type
, false);
1025 else if (curseg
->alloc_type
== LFS
&& is_next_segment_free(sbi
, type
))
1026 new_curseg(sbi
, type
, false);
1027 else if (need_SSR(sbi
) && get_ssr_segment(sbi
, type
))
1028 change_curseg(sbi
, type
, true);
1030 new_curseg(sbi
, type
, false);
1032 stat_inc_seg_type(sbi
, curseg
);
1035 void allocate_new_segments(struct f2fs_sb_info
*sbi
)
1037 struct curseg_info
*curseg
;
1038 unsigned int old_curseg
;
1041 for (i
= CURSEG_HOT_DATA
; i
<= CURSEG_COLD_DATA
; i
++) {
1042 curseg
= CURSEG_I(sbi
, i
);
1043 old_curseg
= curseg
->segno
;
1044 SIT_I(sbi
)->s_ops
->allocate_segment(sbi
, i
, true);
1045 locate_dirty_segment(sbi
, old_curseg
);
1049 static const struct segment_allocation default_salloc_ops
= {
1050 .allocate_segment
= allocate_segment_by_default
,
1053 int f2fs_trim_fs(struct f2fs_sb_info
*sbi
, struct fstrim_range
*range
)
1055 __u64 start
= range
->start
>> sbi
->log_blocksize
;
1056 __u64 end
= start
+ (range
->len
>> sbi
->log_blocksize
) - 1;
1057 unsigned int start_segno
, end_segno
;
1058 struct cp_control cpc
;
1060 if (range
->minlen
> SEGMENT_SIZE(sbi
) || start
>= MAX_BLKADDR(sbi
) ||
1061 range
->len
< sbi
->blocksize
)
1065 if (end
<= MAIN_BLKADDR(sbi
))
1068 /* start/end segment number in main_area */
1069 start_segno
= (start
<= MAIN_BLKADDR(sbi
)) ? 0 : GET_SEGNO(sbi
, start
);
1070 end_segno
= (end
>= MAX_BLKADDR(sbi
)) ? MAIN_SEGS(sbi
) - 1 :
1071 GET_SEGNO(sbi
, end
);
1072 cpc
.reason
= CP_DISCARD
;
1073 cpc
.trim_start
= start_segno
;
1074 cpc
.trim_end
= end_segno
;
1075 cpc
.trim_minlen
= range
->minlen
>> sbi
->log_blocksize
;
1077 /* do checkpoint to issue discard commands safely */
1078 mutex_lock(&sbi
->gc_mutex
);
1079 write_checkpoint(sbi
, &cpc
);
1080 mutex_unlock(&sbi
->gc_mutex
);
1082 range
->len
= cpc
.trimmed
<< sbi
->log_blocksize
;
1086 static bool __has_curseg_space(struct f2fs_sb_info
*sbi
, int type
)
1088 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
1089 if (curseg
->next_blkoff
< sbi
->blocks_per_seg
)
1094 static int __get_segment_type_2(struct page
*page
, enum page_type p_type
)
1097 return CURSEG_HOT_DATA
;
1099 return CURSEG_HOT_NODE
;
1102 static int __get_segment_type_4(struct page
*page
, enum page_type p_type
)
1104 if (p_type
== DATA
) {
1105 struct inode
*inode
= page
->mapping
->host
;
1107 if (S_ISDIR(inode
->i_mode
))
1108 return CURSEG_HOT_DATA
;
1110 return CURSEG_COLD_DATA
;
1112 if (IS_DNODE(page
) && is_cold_node(page
))
1113 return CURSEG_WARM_NODE
;
1115 return CURSEG_COLD_NODE
;
1119 static int __get_segment_type_6(struct page
*page
, enum page_type p_type
)
1121 if (p_type
== DATA
) {
1122 struct inode
*inode
= page
->mapping
->host
;
1124 if (S_ISDIR(inode
->i_mode
))
1125 return CURSEG_HOT_DATA
;
1126 else if (is_cold_data(page
) || file_is_cold(inode
))
1127 return CURSEG_COLD_DATA
;
1129 return CURSEG_WARM_DATA
;
1132 return is_cold_node(page
) ? CURSEG_WARM_NODE
:
1135 return CURSEG_COLD_NODE
;
1139 static int __get_segment_type(struct page
*page
, enum page_type p_type
)
1141 switch (F2FS_P_SB(page
)->active_logs
) {
1143 return __get_segment_type_2(page
, p_type
);
1145 return __get_segment_type_4(page
, p_type
);
1147 /* NR_CURSEG_TYPE(6) logs by default */
1148 f2fs_bug_on(F2FS_P_SB(page
),
1149 F2FS_P_SB(page
)->active_logs
!= NR_CURSEG_TYPE
);
1150 return __get_segment_type_6(page
, p_type
);
1153 void allocate_data_block(struct f2fs_sb_info
*sbi
, struct page
*page
,
1154 block_t old_blkaddr
, block_t
*new_blkaddr
,
1155 struct f2fs_summary
*sum
, int type
)
1157 struct sit_info
*sit_i
= SIT_I(sbi
);
1158 struct curseg_info
*curseg
;
1160 curseg
= CURSEG_I(sbi
, type
);
1162 mutex_lock(&curseg
->curseg_mutex
);
1164 *new_blkaddr
= NEXT_FREE_BLKADDR(sbi
, curseg
);
1167 * __add_sum_entry should be resided under the curseg_mutex
1168 * because, this function updates a summary entry in the
1169 * current summary block.
1171 __add_sum_entry(sbi
, type
, sum
);
1173 mutex_lock(&sit_i
->sentry_lock
);
1174 __refresh_next_blkoff(sbi
, curseg
);
1176 stat_inc_block_count(sbi
, curseg
);
1178 if (!__has_curseg_space(sbi
, type
))
1179 sit_i
->s_ops
->allocate_segment(sbi
, type
, false);
1181 * SIT information should be updated before segment allocation,
1182 * since SSR needs latest valid block information.
1184 refresh_sit_entry(sbi
, old_blkaddr
, *new_blkaddr
);
1186 mutex_unlock(&sit_i
->sentry_lock
);
1188 if (page
&& IS_NODESEG(type
))
1189 fill_node_footer_blkaddr(page
, NEXT_FREE_BLKADDR(sbi
, curseg
));
1191 mutex_unlock(&curseg
->curseg_mutex
);
1194 static void do_write_page(struct f2fs_sb_info
*sbi
, struct page
*page
,
1195 block_t old_blkaddr
, block_t
*new_blkaddr
,
1196 struct f2fs_summary
*sum
, struct f2fs_io_info
*fio
)
1198 int type
= __get_segment_type(page
, fio
->type
);
1200 allocate_data_block(sbi
, page
, old_blkaddr
, new_blkaddr
, sum
, type
);
1202 /* writeout dirty page into bdev */
1203 f2fs_submit_page_mbio(sbi
, page
, *new_blkaddr
, fio
);
1206 void write_meta_page(struct f2fs_sb_info
*sbi
, struct page
*page
)
1208 struct f2fs_io_info fio
= {
1210 .rw
= WRITE_SYNC
| REQ_META
| REQ_PRIO
1213 set_page_writeback(page
);
1214 f2fs_submit_page_mbio(sbi
, page
, page
->index
, &fio
);
1217 void write_node_page(struct f2fs_sb_info
*sbi
, struct page
*page
,
1218 struct f2fs_io_info
*fio
,
1219 unsigned int nid
, block_t old_blkaddr
, block_t
*new_blkaddr
)
1221 struct f2fs_summary sum
;
1222 set_summary(&sum
, nid
, 0, 0);
1223 do_write_page(sbi
, page
, old_blkaddr
, new_blkaddr
, &sum
, fio
);
1226 void write_data_page(struct page
*page
, struct dnode_of_data
*dn
,
1227 block_t
*new_blkaddr
, struct f2fs_io_info
*fio
)
1229 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dn
->inode
);
1230 struct f2fs_summary sum
;
1231 struct node_info ni
;
1233 f2fs_bug_on(sbi
, dn
->data_blkaddr
== NULL_ADDR
);
1234 get_node_info(sbi
, dn
->nid
, &ni
);
1235 set_summary(&sum
, dn
->nid
, dn
->ofs_in_node
, ni
.version
);
1237 do_write_page(sbi
, page
, dn
->data_blkaddr
, new_blkaddr
, &sum
, fio
);
1240 void rewrite_data_page(struct page
*page
, block_t old_blkaddr
,
1241 struct f2fs_io_info
*fio
)
1243 f2fs_submit_page_mbio(F2FS_P_SB(page
), page
, old_blkaddr
, fio
);
1246 void recover_data_page(struct f2fs_sb_info
*sbi
,
1247 struct page
*page
, struct f2fs_summary
*sum
,
1248 block_t old_blkaddr
, block_t new_blkaddr
)
1250 struct sit_info
*sit_i
= SIT_I(sbi
);
1251 struct curseg_info
*curseg
;
1252 unsigned int segno
, old_cursegno
;
1253 struct seg_entry
*se
;
1256 segno
= GET_SEGNO(sbi
, new_blkaddr
);
1257 se
= get_seg_entry(sbi
, segno
);
1260 if (se
->valid_blocks
== 0 && !IS_CURSEG(sbi
, segno
)) {
1261 if (old_blkaddr
== NULL_ADDR
)
1262 type
= CURSEG_COLD_DATA
;
1264 type
= CURSEG_WARM_DATA
;
1266 curseg
= CURSEG_I(sbi
, type
);
1268 mutex_lock(&curseg
->curseg_mutex
);
1269 mutex_lock(&sit_i
->sentry_lock
);
1271 old_cursegno
= curseg
->segno
;
1273 /* change the current segment */
1274 if (segno
!= curseg
->segno
) {
1275 curseg
->next_segno
= segno
;
1276 change_curseg(sbi
, type
, true);
1279 curseg
->next_blkoff
= GET_BLKOFF_FROM_SEG0(sbi
, new_blkaddr
);
1280 __add_sum_entry(sbi
, type
, sum
);
1282 refresh_sit_entry(sbi
, old_blkaddr
, new_blkaddr
);
1283 locate_dirty_segment(sbi
, old_cursegno
);
1285 mutex_unlock(&sit_i
->sentry_lock
);
1286 mutex_unlock(&curseg
->curseg_mutex
);
1289 static inline bool is_merged_page(struct f2fs_sb_info
*sbi
,
1290 struct page
*page
, enum page_type type
)
1292 enum page_type btype
= PAGE_TYPE_OF_BIO(type
);
1293 struct f2fs_bio_info
*io
= &sbi
->write_io
[btype
];
1294 struct bio_vec
*bvec
;
1297 down_read(&io
->io_rwsem
);
1301 bio_for_each_segment_all(bvec
, io
->bio
, i
) {
1302 if (page
== bvec
->bv_page
) {
1303 up_read(&io
->io_rwsem
);
1309 up_read(&io
->io_rwsem
);
1313 void f2fs_wait_on_page_writeback(struct page
*page
,
1314 enum page_type type
)
1316 if (PageWriteback(page
)) {
1317 struct f2fs_sb_info
*sbi
= F2FS_P_SB(page
);
1319 if (is_merged_page(sbi
, page
, type
))
1320 f2fs_submit_merged_bio(sbi
, type
, WRITE
);
1321 wait_on_page_writeback(page
);
1325 static int read_compacted_summaries(struct f2fs_sb_info
*sbi
)
1327 struct f2fs_checkpoint
*ckpt
= F2FS_CKPT(sbi
);
1328 struct curseg_info
*seg_i
;
1329 unsigned char *kaddr
;
1334 start
= start_sum_block(sbi
);
1336 page
= get_meta_page(sbi
, start
++);
1337 kaddr
= (unsigned char *)page_address(page
);
1339 /* Step 1: restore nat cache */
1340 seg_i
= CURSEG_I(sbi
, CURSEG_HOT_DATA
);
1341 memcpy(&seg_i
->sum_blk
->n_nats
, kaddr
, SUM_JOURNAL_SIZE
);
1343 /* Step 2: restore sit cache */
1344 seg_i
= CURSEG_I(sbi
, CURSEG_COLD_DATA
);
1345 memcpy(&seg_i
->sum_blk
->n_sits
, kaddr
+ SUM_JOURNAL_SIZE
,
1347 offset
= 2 * SUM_JOURNAL_SIZE
;
1349 /* Step 3: restore summary entries */
1350 for (i
= CURSEG_HOT_DATA
; i
<= CURSEG_COLD_DATA
; i
++) {
1351 unsigned short blk_off
;
1354 seg_i
= CURSEG_I(sbi
, i
);
1355 segno
= le32_to_cpu(ckpt
->cur_data_segno
[i
]);
1356 blk_off
= le16_to_cpu(ckpt
->cur_data_blkoff
[i
]);
1357 seg_i
->next_segno
= segno
;
1358 reset_curseg(sbi
, i
, 0);
1359 seg_i
->alloc_type
= ckpt
->alloc_type
[i
];
1360 seg_i
->next_blkoff
= blk_off
;
1362 if (seg_i
->alloc_type
== SSR
)
1363 blk_off
= sbi
->blocks_per_seg
;
1365 for (j
= 0; j
< blk_off
; j
++) {
1366 struct f2fs_summary
*s
;
1367 s
= (struct f2fs_summary
*)(kaddr
+ offset
);
1368 seg_i
->sum_blk
->entries
[j
] = *s
;
1369 offset
+= SUMMARY_SIZE
;
1370 if (offset
+ SUMMARY_SIZE
<= PAGE_CACHE_SIZE
-
1374 f2fs_put_page(page
, 1);
1377 page
= get_meta_page(sbi
, start
++);
1378 kaddr
= (unsigned char *)page_address(page
);
1382 f2fs_put_page(page
, 1);
1386 static int read_normal_summaries(struct f2fs_sb_info
*sbi
, int type
)
1388 struct f2fs_checkpoint
*ckpt
= F2FS_CKPT(sbi
);
1389 struct f2fs_summary_block
*sum
;
1390 struct curseg_info
*curseg
;
1392 unsigned short blk_off
;
1393 unsigned int segno
= 0;
1394 block_t blk_addr
= 0;
1396 /* get segment number and block addr */
1397 if (IS_DATASEG(type
)) {
1398 segno
= le32_to_cpu(ckpt
->cur_data_segno
[type
]);
1399 blk_off
= le16_to_cpu(ckpt
->cur_data_blkoff
[type
-
1401 if (is_set_ckpt_flags(ckpt
, CP_UMOUNT_FLAG
))
1402 blk_addr
= sum_blk_addr(sbi
, NR_CURSEG_TYPE
, type
);
1404 blk_addr
= sum_blk_addr(sbi
, NR_CURSEG_DATA_TYPE
, type
);
1406 segno
= le32_to_cpu(ckpt
->cur_node_segno
[type
-
1408 blk_off
= le16_to_cpu(ckpt
->cur_node_blkoff
[type
-
1410 if (is_set_ckpt_flags(ckpt
, CP_UMOUNT_FLAG
))
1411 blk_addr
= sum_blk_addr(sbi
, NR_CURSEG_NODE_TYPE
,
1412 type
- CURSEG_HOT_NODE
);
1414 blk_addr
= GET_SUM_BLOCK(sbi
, segno
);
1417 new = get_meta_page(sbi
, blk_addr
);
1418 sum
= (struct f2fs_summary_block
*)page_address(new);
1420 if (IS_NODESEG(type
)) {
1421 if (is_set_ckpt_flags(ckpt
, CP_UMOUNT_FLAG
)) {
1422 struct f2fs_summary
*ns
= &sum
->entries
[0];
1424 for (i
= 0; i
< sbi
->blocks_per_seg
; i
++, ns
++) {
1426 ns
->ofs_in_node
= 0;
1431 err
= restore_node_summary(sbi
, segno
, sum
);
1433 f2fs_put_page(new, 1);
1439 /* set uncompleted segment to curseg */
1440 curseg
= CURSEG_I(sbi
, type
);
1441 mutex_lock(&curseg
->curseg_mutex
);
1442 memcpy(curseg
->sum_blk
, sum
, PAGE_CACHE_SIZE
);
1443 curseg
->next_segno
= segno
;
1444 reset_curseg(sbi
, type
, 0);
1445 curseg
->alloc_type
= ckpt
->alloc_type
[type
];
1446 curseg
->next_blkoff
= blk_off
;
1447 mutex_unlock(&curseg
->curseg_mutex
);
1448 f2fs_put_page(new, 1);
1452 static int restore_curseg_summaries(struct f2fs_sb_info
*sbi
)
1454 int type
= CURSEG_HOT_DATA
;
1457 if (is_set_ckpt_flags(F2FS_CKPT(sbi
), CP_COMPACT_SUM_FLAG
)) {
1458 /* restore for compacted data summary */
1459 if (read_compacted_summaries(sbi
))
1461 type
= CURSEG_HOT_NODE
;
1464 for (; type
<= CURSEG_COLD_NODE
; type
++) {
1465 err
= read_normal_summaries(sbi
, type
);
1473 static void write_compacted_summaries(struct f2fs_sb_info
*sbi
, block_t blkaddr
)
1476 unsigned char *kaddr
;
1477 struct f2fs_summary
*summary
;
1478 struct curseg_info
*seg_i
;
1479 int written_size
= 0;
1482 page
= grab_meta_page(sbi
, blkaddr
++);
1483 kaddr
= (unsigned char *)page_address(page
);
1485 /* Step 1: write nat cache */
1486 seg_i
= CURSEG_I(sbi
, CURSEG_HOT_DATA
);
1487 memcpy(kaddr
, &seg_i
->sum_blk
->n_nats
, SUM_JOURNAL_SIZE
);
1488 written_size
+= SUM_JOURNAL_SIZE
;
1490 /* Step 2: write sit cache */
1491 seg_i
= CURSEG_I(sbi
, CURSEG_COLD_DATA
);
1492 memcpy(kaddr
+ written_size
, &seg_i
->sum_blk
->n_sits
,
1494 written_size
+= SUM_JOURNAL_SIZE
;
1496 /* Step 3: write summary entries */
1497 for (i
= CURSEG_HOT_DATA
; i
<= CURSEG_COLD_DATA
; i
++) {
1498 unsigned short blkoff
;
1499 seg_i
= CURSEG_I(sbi
, i
);
1500 if (sbi
->ckpt
->alloc_type
[i
] == SSR
)
1501 blkoff
= sbi
->blocks_per_seg
;
1503 blkoff
= curseg_blkoff(sbi
, i
);
1505 for (j
= 0; j
< blkoff
; j
++) {
1507 page
= grab_meta_page(sbi
, blkaddr
++);
1508 kaddr
= (unsigned char *)page_address(page
);
1511 summary
= (struct f2fs_summary
*)(kaddr
+ written_size
);
1512 *summary
= seg_i
->sum_blk
->entries
[j
];
1513 written_size
+= SUMMARY_SIZE
;
1515 if (written_size
+ SUMMARY_SIZE
<= PAGE_CACHE_SIZE
-
1519 set_page_dirty(page
);
1520 f2fs_put_page(page
, 1);
1525 set_page_dirty(page
);
1526 f2fs_put_page(page
, 1);
1530 static void write_normal_summaries(struct f2fs_sb_info
*sbi
,
1531 block_t blkaddr
, int type
)
1534 if (IS_DATASEG(type
))
1535 end
= type
+ NR_CURSEG_DATA_TYPE
;
1537 end
= type
+ NR_CURSEG_NODE_TYPE
;
1539 for (i
= type
; i
< end
; i
++) {
1540 struct curseg_info
*sum
= CURSEG_I(sbi
, i
);
1541 mutex_lock(&sum
->curseg_mutex
);
1542 write_sum_page(sbi
, sum
->sum_blk
, blkaddr
+ (i
- type
));
1543 mutex_unlock(&sum
->curseg_mutex
);
1547 void write_data_summaries(struct f2fs_sb_info
*sbi
, block_t start_blk
)
1549 if (is_set_ckpt_flags(F2FS_CKPT(sbi
), CP_COMPACT_SUM_FLAG
))
1550 write_compacted_summaries(sbi
, start_blk
);
1552 write_normal_summaries(sbi
, start_blk
, CURSEG_HOT_DATA
);
1555 void write_node_summaries(struct f2fs_sb_info
*sbi
, block_t start_blk
)
1557 if (is_set_ckpt_flags(F2FS_CKPT(sbi
), CP_UMOUNT_FLAG
))
1558 write_normal_summaries(sbi
, start_blk
, CURSEG_HOT_NODE
);
1561 int lookup_journal_in_cursum(struct f2fs_summary_block
*sum
, int type
,
1562 unsigned int val
, int alloc
)
1566 if (type
== NAT_JOURNAL
) {
1567 for (i
= 0; i
< nats_in_cursum(sum
); i
++) {
1568 if (le32_to_cpu(nid_in_journal(sum
, i
)) == val
)
1571 if (alloc
&& nats_in_cursum(sum
) < NAT_JOURNAL_ENTRIES
)
1572 return update_nats_in_cursum(sum
, 1);
1573 } else if (type
== SIT_JOURNAL
) {
1574 for (i
= 0; i
< sits_in_cursum(sum
); i
++)
1575 if (le32_to_cpu(segno_in_journal(sum
, i
)) == val
)
1577 if (alloc
&& sits_in_cursum(sum
) < SIT_JOURNAL_ENTRIES
)
1578 return update_sits_in_cursum(sum
, 1);
1583 static struct page
*get_current_sit_page(struct f2fs_sb_info
*sbi
,
1586 return get_meta_page(sbi
, current_sit_addr(sbi
, segno
));
1589 static struct page
*get_next_sit_page(struct f2fs_sb_info
*sbi
,
1592 struct sit_info
*sit_i
= SIT_I(sbi
);
1593 struct page
*src_page
, *dst_page
;
1594 pgoff_t src_off
, dst_off
;
1595 void *src_addr
, *dst_addr
;
1597 src_off
= current_sit_addr(sbi
, start
);
1598 dst_off
= next_sit_addr(sbi
, src_off
);
1600 /* get current sit block page without lock */
1601 src_page
= get_meta_page(sbi
, src_off
);
1602 dst_page
= grab_meta_page(sbi
, dst_off
);
1603 f2fs_bug_on(sbi
, PageDirty(src_page
));
1605 src_addr
= page_address(src_page
);
1606 dst_addr
= page_address(dst_page
);
1607 memcpy(dst_addr
, src_addr
, PAGE_CACHE_SIZE
);
1609 set_page_dirty(dst_page
);
1610 f2fs_put_page(src_page
, 1);
1612 set_to_next_sit(sit_i
, start
);
1617 static struct sit_entry_set
*grab_sit_entry_set(void)
1619 struct sit_entry_set
*ses
=
1620 f2fs_kmem_cache_alloc(sit_entry_set_slab
, GFP_ATOMIC
);
1623 INIT_LIST_HEAD(&ses
->set_list
);
1627 static void release_sit_entry_set(struct sit_entry_set
*ses
)
1629 list_del(&ses
->set_list
);
1630 kmem_cache_free(sit_entry_set_slab
, ses
);
1633 static void adjust_sit_entry_set(struct sit_entry_set
*ses
,
1634 struct list_head
*head
)
1636 struct sit_entry_set
*next
= ses
;
1638 if (list_is_last(&ses
->set_list
, head
))
1641 list_for_each_entry_continue(next
, head
, set_list
)
1642 if (ses
->entry_cnt
<= next
->entry_cnt
)
1645 list_move_tail(&ses
->set_list
, &next
->set_list
);
1648 static void add_sit_entry(unsigned int segno
, struct list_head
*head
)
1650 struct sit_entry_set
*ses
;
1651 unsigned int start_segno
= START_SEGNO(segno
);
1653 list_for_each_entry(ses
, head
, set_list
) {
1654 if (ses
->start_segno
== start_segno
) {
1656 adjust_sit_entry_set(ses
, head
);
1661 ses
= grab_sit_entry_set();
1663 ses
->start_segno
= start_segno
;
1665 list_add(&ses
->set_list
, head
);
1668 static void add_sits_in_set(struct f2fs_sb_info
*sbi
)
1670 struct f2fs_sm_info
*sm_info
= SM_I(sbi
);
1671 struct list_head
*set_list
= &sm_info
->sit_entry_set
;
1672 unsigned long *bitmap
= SIT_I(sbi
)->dirty_sentries_bitmap
;
1675 for_each_set_bit(segno
, bitmap
, MAIN_SEGS(sbi
))
1676 add_sit_entry(segno
, set_list
);
1679 static void remove_sits_in_journal(struct f2fs_sb_info
*sbi
)
1681 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_COLD_DATA
);
1682 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1685 for (i
= sits_in_cursum(sum
) - 1; i
>= 0; i
--) {
1689 segno
= le32_to_cpu(segno_in_journal(sum
, i
));
1690 dirtied
= __mark_sit_entry_dirty(sbi
, segno
);
1693 add_sit_entry(segno
, &SM_I(sbi
)->sit_entry_set
);
1695 update_sits_in_cursum(sum
, -sits_in_cursum(sum
));
1699 * CP calls this function, which flushes SIT entries including sit_journal,
1700 * and moves prefree segs to free segs.
1702 void flush_sit_entries(struct f2fs_sb_info
*sbi
, struct cp_control
*cpc
)
1704 struct sit_info
*sit_i
= SIT_I(sbi
);
1705 unsigned long *bitmap
= sit_i
->dirty_sentries_bitmap
;
1706 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_COLD_DATA
);
1707 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1708 struct sit_entry_set
*ses
, *tmp
;
1709 struct list_head
*head
= &SM_I(sbi
)->sit_entry_set
;
1710 bool to_journal
= true;
1711 struct seg_entry
*se
;
1713 mutex_lock(&curseg
->curseg_mutex
);
1714 mutex_lock(&sit_i
->sentry_lock
);
1717 * add and account sit entries of dirty bitmap in sit entry
1720 add_sits_in_set(sbi
);
1723 * if there are no enough space in journal to store dirty sit
1724 * entries, remove all entries from journal and add and account
1725 * them in sit entry set.
1727 if (!__has_cursum_space(sum
, sit_i
->dirty_sentries
, SIT_JOURNAL
))
1728 remove_sits_in_journal(sbi
);
1730 if (!sit_i
->dirty_sentries
)
1734 * there are two steps to flush sit entries:
1735 * #1, flush sit entries to journal in current cold data summary block.
1736 * #2, flush sit entries to sit page.
1738 list_for_each_entry_safe(ses
, tmp
, head
, set_list
) {
1739 struct page
*page
= NULL
;
1740 struct f2fs_sit_block
*raw_sit
= NULL
;
1741 unsigned int start_segno
= ses
->start_segno
;
1742 unsigned int end
= min(start_segno
+ SIT_ENTRY_PER_BLOCK
,
1743 (unsigned long)MAIN_SEGS(sbi
));
1744 unsigned int segno
= start_segno
;
1747 !__has_cursum_space(sum
, ses
->entry_cnt
, SIT_JOURNAL
))
1751 page
= get_next_sit_page(sbi
, start_segno
);
1752 raw_sit
= page_address(page
);
1755 /* flush dirty sit entries in region of current sit set */
1756 for_each_set_bit_from(segno
, bitmap
, end
) {
1757 int offset
, sit_offset
;
1759 se
= get_seg_entry(sbi
, segno
);
1761 /* add discard candidates */
1762 if (SM_I(sbi
)->nr_discards
< SM_I(sbi
)->max_discards
) {
1763 cpc
->trim_start
= segno
;
1764 add_discard_addrs(sbi
, cpc
);
1768 offset
= lookup_journal_in_cursum(sum
,
1769 SIT_JOURNAL
, segno
, 1);
1770 f2fs_bug_on(sbi
, offset
< 0);
1771 segno_in_journal(sum
, offset
) =
1773 seg_info_to_raw_sit(se
,
1774 &sit_in_journal(sum
, offset
));
1776 sit_offset
= SIT_ENTRY_OFFSET(sit_i
, segno
);
1777 seg_info_to_raw_sit(se
,
1778 &raw_sit
->entries
[sit_offset
]);
1781 __clear_bit(segno
, bitmap
);
1782 sit_i
->dirty_sentries
--;
1787 f2fs_put_page(page
, 1);
1789 f2fs_bug_on(sbi
, ses
->entry_cnt
);
1790 release_sit_entry_set(ses
);
1793 f2fs_bug_on(sbi
, !list_empty(head
));
1794 f2fs_bug_on(sbi
, sit_i
->dirty_sentries
);
1796 if (cpc
->reason
== CP_DISCARD
) {
1797 for (; cpc
->trim_start
<= cpc
->trim_end
; cpc
->trim_start
++)
1798 add_discard_addrs(sbi
, cpc
);
1800 mutex_unlock(&sit_i
->sentry_lock
);
1801 mutex_unlock(&curseg
->curseg_mutex
);
1803 set_prefree_as_free_segments(sbi
);
1806 static int build_sit_info(struct f2fs_sb_info
*sbi
)
1808 struct f2fs_super_block
*raw_super
= F2FS_RAW_SUPER(sbi
);
1809 struct f2fs_checkpoint
*ckpt
= F2FS_CKPT(sbi
);
1810 struct sit_info
*sit_i
;
1811 unsigned int sit_segs
, start
;
1812 char *src_bitmap
, *dst_bitmap
;
1813 unsigned int bitmap_size
;
1815 /* allocate memory for SIT information */
1816 sit_i
= kzalloc(sizeof(struct sit_info
), GFP_KERNEL
);
1820 SM_I(sbi
)->sit_info
= sit_i
;
1822 sit_i
->sentries
= vzalloc(MAIN_SEGS(sbi
) * sizeof(struct seg_entry
));
1823 if (!sit_i
->sentries
)
1826 bitmap_size
= f2fs_bitmap_size(MAIN_SEGS(sbi
));
1827 sit_i
->dirty_sentries_bitmap
= kzalloc(bitmap_size
, GFP_KERNEL
);
1828 if (!sit_i
->dirty_sentries_bitmap
)
1831 for (start
= 0; start
< MAIN_SEGS(sbi
); start
++) {
1832 sit_i
->sentries
[start
].cur_valid_map
1833 = kzalloc(SIT_VBLOCK_MAP_SIZE
, GFP_KERNEL
);
1834 sit_i
->sentries
[start
].ckpt_valid_map
1835 = kzalloc(SIT_VBLOCK_MAP_SIZE
, GFP_KERNEL
);
1836 if (!sit_i
->sentries
[start
].cur_valid_map
1837 || !sit_i
->sentries
[start
].ckpt_valid_map
)
1841 if (sbi
->segs_per_sec
> 1) {
1842 sit_i
->sec_entries
= vzalloc(MAIN_SECS(sbi
) *
1843 sizeof(struct sec_entry
));
1844 if (!sit_i
->sec_entries
)
1848 /* get information related with SIT */
1849 sit_segs
= le32_to_cpu(raw_super
->segment_count_sit
) >> 1;
1851 /* setup SIT bitmap from ckeckpoint pack */
1852 bitmap_size
= __bitmap_size(sbi
, SIT_BITMAP
);
1853 src_bitmap
= __bitmap_ptr(sbi
, SIT_BITMAP
);
1855 dst_bitmap
= kmemdup(src_bitmap
, bitmap_size
, GFP_KERNEL
);
1859 /* init SIT information */
1860 sit_i
->s_ops
= &default_salloc_ops
;
1862 sit_i
->sit_base_addr
= le32_to_cpu(raw_super
->sit_blkaddr
);
1863 sit_i
->sit_blocks
= sit_segs
<< sbi
->log_blocks_per_seg
;
1864 sit_i
->written_valid_blocks
= le64_to_cpu(ckpt
->valid_block_count
);
1865 sit_i
->sit_bitmap
= dst_bitmap
;
1866 sit_i
->bitmap_size
= bitmap_size
;
1867 sit_i
->dirty_sentries
= 0;
1868 sit_i
->sents_per_block
= SIT_ENTRY_PER_BLOCK
;
1869 sit_i
->elapsed_time
= le64_to_cpu(sbi
->ckpt
->elapsed_time
);
1870 sit_i
->mounted_time
= CURRENT_TIME_SEC
.tv_sec
;
1871 mutex_init(&sit_i
->sentry_lock
);
1875 static int build_free_segmap(struct f2fs_sb_info
*sbi
)
1877 struct free_segmap_info
*free_i
;
1878 unsigned int bitmap_size
, sec_bitmap_size
;
1880 /* allocate memory for free segmap information */
1881 free_i
= kzalloc(sizeof(struct free_segmap_info
), GFP_KERNEL
);
1885 SM_I(sbi
)->free_info
= free_i
;
1887 bitmap_size
= f2fs_bitmap_size(MAIN_SEGS(sbi
));
1888 free_i
->free_segmap
= kmalloc(bitmap_size
, GFP_KERNEL
);
1889 if (!free_i
->free_segmap
)
1892 sec_bitmap_size
= f2fs_bitmap_size(MAIN_SECS(sbi
));
1893 free_i
->free_secmap
= kmalloc(sec_bitmap_size
, GFP_KERNEL
);
1894 if (!free_i
->free_secmap
)
1897 /* set all segments as dirty temporarily */
1898 memset(free_i
->free_segmap
, 0xff, bitmap_size
);
1899 memset(free_i
->free_secmap
, 0xff, sec_bitmap_size
);
1901 /* init free segmap information */
1902 free_i
->start_segno
= GET_SEGNO_FROM_SEG0(sbi
, MAIN_BLKADDR(sbi
));
1903 free_i
->free_segments
= 0;
1904 free_i
->free_sections
= 0;
1905 rwlock_init(&free_i
->segmap_lock
);
1909 static int build_curseg(struct f2fs_sb_info
*sbi
)
1911 struct curseg_info
*array
;
1914 array
= kcalloc(NR_CURSEG_TYPE
, sizeof(*array
), GFP_KERNEL
);
1918 SM_I(sbi
)->curseg_array
= array
;
1920 for (i
= 0; i
< NR_CURSEG_TYPE
; i
++) {
1921 mutex_init(&array
[i
].curseg_mutex
);
1922 array
[i
].sum_blk
= kzalloc(PAGE_CACHE_SIZE
, GFP_KERNEL
);
1923 if (!array
[i
].sum_blk
)
1925 array
[i
].segno
= NULL_SEGNO
;
1926 array
[i
].next_blkoff
= 0;
1928 return restore_curseg_summaries(sbi
);
1931 static void build_sit_entries(struct f2fs_sb_info
*sbi
)
1933 struct sit_info
*sit_i
= SIT_I(sbi
);
1934 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_COLD_DATA
);
1935 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1936 int sit_blk_cnt
= SIT_BLK_CNT(sbi
);
1937 unsigned int i
, start
, end
;
1938 unsigned int readed
, start_blk
= 0;
1939 int nrpages
= MAX_BIO_BLOCKS(sbi
);
1942 readed
= ra_meta_pages(sbi
, start_blk
, nrpages
, META_SIT
);
1944 start
= start_blk
* sit_i
->sents_per_block
;
1945 end
= (start_blk
+ readed
) * sit_i
->sents_per_block
;
1947 for (; start
< end
&& start
< MAIN_SEGS(sbi
); start
++) {
1948 struct seg_entry
*se
= &sit_i
->sentries
[start
];
1949 struct f2fs_sit_block
*sit_blk
;
1950 struct f2fs_sit_entry sit
;
1953 mutex_lock(&curseg
->curseg_mutex
);
1954 for (i
= 0; i
< sits_in_cursum(sum
); i
++) {
1955 if (le32_to_cpu(segno_in_journal(sum
, i
))
1957 sit
= sit_in_journal(sum
, i
);
1958 mutex_unlock(&curseg
->curseg_mutex
);
1962 mutex_unlock(&curseg
->curseg_mutex
);
1964 page
= get_current_sit_page(sbi
, start
);
1965 sit_blk
= (struct f2fs_sit_block
*)page_address(page
);
1966 sit
= sit_blk
->entries
[SIT_ENTRY_OFFSET(sit_i
, start
)];
1967 f2fs_put_page(page
, 1);
1969 check_block_count(sbi
, start
, &sit
);
1970 seg_info_from_raw_sit(se
, &sit
);
1971 if (sbi
->segs_per_sec
> 1) {
1972 struct sec_entry
*e
= get_sec_entry(sbi
, start
);
1973 e
->valid_blocks
+= se
->valid_blocks
;
1976 start_blk
+= readed
;
1977 } while (start_blk
< sit_blk_cnt
);
1980 static void init_free_segmap(struct f2fs_sb_info
*sbi
)
1985 for (start
= 0; start
< MAIN_SEGS(sbi
); start
++) {
1986 struct seg_entry
*sentry
= get_seg_entry(sbi
, start
);
1987 if (!sentry
->valid_blocks
)
1988 __set_free(sbi
, start
);
1991 /* set use the current segments */
1992 for (type
= CURSEG_HOT_DATA
; type
<= CURSEG_COLD_NODE
; type
++) {
1993 struct curseg_info
*curseg_t
= CURSEG_I(sbi
, type
);
1994 __set_test_and_inuse(sbi
, curseg_t
->segno
);
1998 static void init_dirty_segmap(struct f2fs_sb_info
*sbi
)
2000 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
2001 struct free_segmap_info
*free_i
= FREE_I(sbi
);
2002 unsigned int segno
= 0, offset
= 0;
2003 unsigned short valid_blocks
;
2006 /* find dirty segment based on free segmap */
2007 segno
= find_next_inuse(free_i
, MAIN_SEGS(sbi
), offset
);
2008 if (segno
>= MAIN_SEGS(sbi
))
2011 valid_blocks
= get_valid_blocks(sbi
, segno
, 0);
2012 if (valid_blocks
== sbi
->blocks_per_seg
|| !valid_blocks
)
2014 if (valid_blocks
> sbi
->blocks_per_seg
) {
2015 f2fs_bug_on(sbi
, 1);
2018 mutex_lock(&dirty_i
->seglist_lock
);
2019 __locate_dirty_segment(sbi
, segno
, DIRTY
);
2020 mutex_unlock(&dirty_i
->seglist_lock
);
2024 static int init_victim_secmap(struct f2fs_sb_info
*sbi
)
2026 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
2027 unsigned int bitmap_size
= f2fs_bitmap_size(MAIN_SECS(sbi
));
2029 dirty_i
->victim_secmap
= kzalloc(bitmap_size
, GFP_KERNEL
);
2030 if (!dirty_i
->victim_secmap
)
2035 static int build_dirty_segmap(struct f2fs_sb_info
*sbi
)
2037 struct dirty_seglist_info
*dirty_i
;
2038 unsigned int bitmap_size
, i
;
2040 /* allocate memory for dirty segments list information */
2041 dirty_i
= kzalloc(sizeof(struct dirty_seglist_info
), GFP_KERNEL
);
2045 SM_I(sbi
)->dirty_info
= dirty_i
;
2046 mutex_init(&dirty_i
->seglist_lock
);
2048 bitmap_size
= f2fs_bitmap_size(MAIN_SEGS(sbi
));
2050 for (i
= 0; i
< NR_DIRTY_TYPE
; i
++) {
2051 dirty_i
->dirty_segmap
[i
] = kzalloc(bitmap_size
, GFP_KERNEL
);
2052 if (!dirty_i
->dirty_segmap
[i
])
2056 init_dirty_segmap(sbi
);
2057 return init_victim_secmap(sbi
);
2061 * Update min, max modified time for cost-benefit GC algorithm
2063 static void init_min_max_mtime(struct f2fs_sb_info
*sbi
)
2065 struct sit_info
*sit_i
= SIT_I(sbi
);
2068 mutex_lock(&sit_i
->sentry_lock
);
2070 sit_i
->min_mtime
= LLONG_MAX
;
2072 for (segno
= 0; segno
< MAIN_SEGS(sbi
); segno
+= sbi
->segs_per_sec
) {
2074 unsigned long long mtime
= 0;
2076 for (i
= 0; i
< sbi
->segs_per_sec
; i
++)
2077 mtime
+= get_seg_entry(sbi
, segno
+ i
)->mtime
;
2079 mtime
= div_u64(mtime
, sbi
->segs_per_sec
);
2081 if (sit_i
->min_mtime
> mtime
)
2082 sit_i
->min_mtime
= mtime
;
2084 sit_i
->max_mtime
= get_mtime(sbi
);
2085 mutex_unlock(&sit_i
->sentry_lock
);
2088 int build_segment_manager(struct f2fs_sb_info
*sbi
)
2090 struct f2fs_super_block
*raw_super
= F2FS_RAW_SUPER(sbi
);
2091 struct f2fs_checkpoint
*ckpt
= F2FS_CKPT(sbi
);
2092 struct f2fs_sm_info
*sm_info
;
2095 sm_info
= kzalloc(sizeof(struct f2fs_sm_info
), GFP_KERNEL
);
2100 sbi
->sm_info
= sm_info
;
2101 sm_info
->seg0_blkaddr
= le32_to_cpu(raw_super
->segment0_blkaddr
);
2102 sm_info
->main_blkaddr
= le32_to_cpu(raw_super
->main_blkaddr
);
2103 sm_info
->segment_count
= le32_to_cpu(raw_super
->segment_count
);
2104 sm_info
->reserved_segments
= le32_to_cpu(ckpt
->rsvd_segment_count
);
2105 sm_info
->ovp_segments
= le32_to_cpu(ckpt
->overprov_segment_count
);
2106 sm_info
->main_segments
= le32_to_cpu(raw_super
->segment_count_main
);
2107 sm_info
->ssa_blkaddr
= le32_to_cpu(raw_super
->ssa_blkaddr
);
2108 sm_info
->rec_prefree_segments
= sm_info
->main_segments
*
2109 DEF_RECLAIM_PREFREE_SEGMENTS
/ 100;
2110 sm_info
->ipu_policy
= 1 << F2FS_IPU_FSYNC
;
2111 sm_info
->min_ipu_util
= DEF_MIN_IPU_UTIL
;
2112 sm_info
->min_fsync_blocks
= DEF_MIN_FSYNC_BLOCKS
;
2114 INIT_LIST_HEAD(&sm_info
->discard_list
);
2115 sm_info
->nr_discards
= 0;
2116 sm_info
->max_discards
= 0;
2118 INIT_LIST_HEAD(&sm_info
->sit_entry_set
);
2120 if (test_opt(sbi
, FLUSH_MERGE
) && !f2fs_readonly(sbi
->sb
)) {
2121 err
= create_flush_cmd_control(sbi
);
2126 err
= build_sit_info(sbi
);
2129 err
= build_free_segmap(sbi
);
2132 err
= build_curseg(sbi
);
2136 /* reinit free segmap based on SIT */
2137 build_sit_entries(sbi
);
2139 init_free_segmap(sbi
);
2140 err
= build_dirty_segmap(sbi
);
2144 init_min_max_mtime(sbi
);
2148 static void discard_dirty_segmap(struct f2fs_sb_info
*sbi
,
2149 enum dirty_type dirty_type
)
2151 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
2153 mutex_lock(&dirty_i
->seglist_lock
);
2154 kfree(dirty_i
->dirty_segmap
[dirty_type
]);
2155 dirty_i
->nr_dirty
[dirty_type
] = 0;
2156 mutex_unlock(&dirty_i
->seglist_lock
);
2159 static void destroy_victim_secmap(struct f2fs_sb_info
*sbi
)
2161 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
2162 kfree(dirty_i
->victim_secmap
);
2165 static void destroy_dirty_segmap(struct f2fs_sb_info
*sbi
)
2167 struct dirty_seglist_info
*dirty_i
= DIRTY_I(sbi
);
2173 /* discard pre-free/dirty segments list */
2174 for (i
= 0; i
< NR_DIRTY_TYPE
; i
++)
2175 discard_dirty_segmap(sbi
, i
);
2177 destroy_victim_secmap(sbi
);
2178 SM_I(sbi
)->dirty_info
= NULL
;
2182 static void destroy_curseg(struct f2fs_sb_info
*sbi
)
2184 struct curseg_info
*array
= SM_I(sbi
)->curseg_array
;
2189 SM_I(sbi
)->curseg_array
= NULL
;
2190 for (i
= 0; i
< NR_CURSEG_TYPE
; i
++)
2191 kfree(array
[i
].sum_blk
);
2195 static void destroy_free_segmap(struct f2fs_sb_info
*sbi
)
2197 struct free_segmap_info
*free_i
= SM_I(sbi
)->free_info
;
2200 SM_I(sbi
)->free_info
= NULL
;
2201 kfree(free_i
->free_segmap
);
2202 kfree(free_i
->free_secmap
);
2206 static void destroy_sit_info(struct f2fs_sb_info
*sbi
)
2208 struct sit_info
*sit_i
= SIT_I(sbi
);
2214 if (sit_i
->sentries
) {
2215 for (start
= 0; start
< MAIN_SEGS(sbi
); start
++) {
2216 kfree(sit_i
->sentries
[start
].cur_valid_map
);
2217 kfree(sit_i
->sentries
[start
].ckpt_valid_map
);
2220 vfree(sit_i
->sentries
);
2221 vfree(sit_i
->sec_entries
);
2222 kfree(sit_i
->dirty_sentries_bitmap
);
2224 SM_I(sbi
)->sit_info
= NULL
;
2225 kfree(sit_i
->sit_bitmap
);
2229 void destroy_segment_manager(struct f2fs_sb_info
*sbi
)
2231 struct f2fs_sm_info
*sm_info
= SM_I(sbi
);
2235 destroy_flush_cmd_control(sbi
);
2236 destroy_dirty_segmap(sbi
);
2237 destroy_curseg(sbi
);
2238 destroy_free_segmap(sbi
);
2239 destroy_sit_info(sbi
);
2240 sbi
->sm_info
= NULL
;
2244 int __init
create_segment_manager_caches(void)
2246 discard_entry_slab
= f2fs_kmem_cache_create("discard_entry",
2247 sizeof(struct discard_entry
));
2248 if (!discard_entry_slab
)
2251 sit_entry_set_slab
= f2fs_kmem_cache_create("sit_entry_set",
2252 sizeof(struct sit_entry_set
));
2253 if (!sit_entry_set_slab
)
2254 goto destory_discard_entry
;
2256 inmem_entry_slab
= f2fs_kmem_cache_create("inmem_page_entry",
2257 sizeof(struct inmem_pages
));
2258 if (!inmem_entry_slab
)
2259 goto destroy_sit_entry_set
;
2262 destroy_sit_entry_set
:
2263 kmem_cache_destroy(sit_entry_set_slab
);
2264 destory_discard_entry
:
2265 kmem_cache_destroy(discard_entry_slab
);
2270 void destroy_segment_manager_caches(void)
2272 kmem_cache_destroy(sit_entry_set_slab
);
2273 kmem_cache_destroy(discard_entry_slab
);
2274 kmem_cache_destroy(inmem_entry_slab
);