fs/f2fs/gc.c

425 	struct victim_entry *ve = NULL;
428 		ve = rb_entry(node, struct victim_entry, rb_node);
430 		if (mtime < ve->mtime)
435 	return ve;
442 	struct victim_entry *ve;
444 	ve =  f2fs_kmem_cache_alloc(victim_entry_slab, GFP_NOFS, true, NULL);
446 	ve->mtime = mtime;
447 	ve->segno = segno;
449 	list_add_tail(&ve->list, &am->victim_list);
452 	return ve;
462 	struct victim_entry *ve;
468 		ve = rb_entry(parent, struct victim_entry, rb_node);
470 		if (mtime < ve->mtime) {
478 	ve = __create_victim_entry(sbi, mtime, segno);
480 	rb_link_node(&ve->rb_node, parent, p);
481 	rb_insert_color_cached(&ve->rb_node, root, left_most);
527 	struct victim_entry *ve;
553 	ve = rb_entry_safe(node, struct victim_entry, rb_node);
554 	if (!ve)
557 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)
561 	age = div64_u64(accu * (max_mtime - ve->mtime), total_time) *
564 	vblocks = get_valid_blocks(sbi, ve->segno, true);
580 		p->min_segno = ve->segno;
598 	struct victim_entry *ve;
614 	ve = __lookup_victim_entry(sbi, p->age);
616 	if (!ve) {
622 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)
625 	age = max_mtime - ve->mtime;
627 	vblocks = get_seg_entry(sbi, ve->segno)->ckpt_valid_blocks;
643 		p->min_segno = ve->segno;
647 		ve = rb_entry(stage == 0 ? rb_prev(&ve->rb_node) :
648 					rb_next(&ve->rb_node),
673 	struct victim_entry *ve, *tmp;
675 	list_for_each_entry_safe(ve, tmp, &am->victim_list, list) {
676 		list_del(&ve->list);
677 		kmem_cache_free(victim_entry_slab, ve);