427 	struct victim_entry *ve = NULL;  in __lookup_victim_entry()  local
430 		ve = rb_entry(node, struct victim_entry, rb_node);  in __lookup_victim_entry()
432 		if (mtime < ve->mtime)  in __lookup_victim_entry()
437 	return ve;  in __lookup_victim_entry()
444 	struct victim_entry *ve;  in __create_victim_entry()  local
446 	ve =  f2fs_kmem_cache_alloc(victim_entry_slab, GFP_NOFS, true, NULL);  in __create_victim_entry()
448 	ve->mtime = mtime;  in __create_victim_entry()
449 	ve->segno = segno;  in __create_victim_entry()
451 	list_add_tail(&ve->list, &am->victim_list);  in __create_victim_entry()
454 	return ve;  in __create_victim_entry()
464 	struct victim_entry *ve;  in __insert_victim_entry()  local
470 		ve = rb_entry(parent, struct victim_entry, rb_node);  in __insert_victim_entry()
472 		if (mtime < ve->mtime) {  in __insert_victim_entry()
480 	ve = __create_victim_entry(sbi, mtime, segno);  in __insert_victim_entry()
482 	rb_link_node(&ve->rb_node, parent, p);  in __insert_victim_entry()
483 	rb_insert_color_cached(&ve->rb_node, root, left_most);  in __insert_victim_entry()
529 	struct victim_entry *ve;  in atgc_lookup_victim()  local
555 	ve = rb_entry_safe(node, struct victim_entry, rb_node);  in atgc_lookup_victim()
556 	if (!ve)  in atgc_lookup_victim()
559 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)  in atgc_lookup_victim()
563 	age = div64_u64(accu * (max_mtime - ve->mtime), total_time) *  in atgc_lookup_victim()
566 	vblocks = get_valid_blocks(sbi, ve->segno, true);  in atgc_lookup_victim()
582 		p->min_segno = ve->segno;  in atgc_lookup_victim()
600 	struct victim_entry *ve;  in atssr_lookup_victim()  local
616 	ve = __lookup_victim_entry(sbi, p->age);  in atssr_lookup_victim()
618 	if (!ve) {  in atssr_lookup_victim()
624 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)  in atssr_lookup_victim()
627 	age = max_mtime - ve->mtime;  in atssr_lookup_victim()
629 	vblocks = get_seg_entry(sbi, ve->segno)->ckpt_valid_blocks;  in atssr_lookup_victim()
645 		p->min_segno = ve->segno;  in atssr_lookup_victim()
649 		ve = rb_entry(stage == 0 ? rb_prev(&ve->rb_node) :  in atssr_lookup_victim()
650 					rb_next(&ve->rb_node),  in atssr_lookup_victim()
675 	struct victim_entry *ve, *tmp;  in release_victim_entry()  local
677 	list_for_each_entry_safe(ve, tmp, &am->victim_list, list) {  in release_victim_entry()
678 		list_del(&ve->list);  in release_victim_entry()
679 		kmem_cache_free(victim_entry_slab, ve);  in release_victim_entry()