425 	struct victim_entry *ve = NULL;  in __lookup_victim_entry()  local
428 		ve = rb_entry(node, struct victim_entry, rb_node);  in __lookup_victim_entry()
430 		if (mtime < ve->mtime)  in __lookup_victim_entry()
435 	return ve;  in __lookup_victim_entry()
442 	struct victim_entry *ve;  in __create_victim_entry()  local
444 	ve =  f2fs_kmem_cache_alloc(victim_entry_slab, GFP_NOFS, true, NULL);  in __create_victim_entry()
446 	ve->mtime = mtime;  in __create_victim_entry()
447 	ve->segno = segno;  in __create_victim_entry()
449 	list_add_tail(&ve->list, &am->victim_list);  in __create_victim_entry()
452 	return ve;  in __create_victim_entry()
462 	struct victim_entry *ve;  in __insert_victim_entry()  local
468 		ve = rb_entry(parent, struct victim_entry, rb_node);  in __insert_victim_entry()
470 		if (mtime < ve->mtime) {  in __insert_victim_entry()
478 	ve = __create_victim_entry(sbi, mtime, segno);  in __insert_victim_entry()
480 	rb_link_node(&ve->rb_node, parent, p);  in __insert_victim_entry()
481 	rb_insert_color_cached(&ve->rb_node, root, left_most);  in __insert_victim_entry()
527 	struct victim_entry *ve;  in atgc_lookup_victim()  local
553 	ve = rb_entry_safe(node, struct victim_entry, rb_node);  in atgc_lookup_victim()
554 	if (!ve)  in atgc_lookup_victim()
557 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)  in atgc_lookup_victim()
561 	age = div64_u64(accu * (max_mtime - ve->mtime), total_time) *  in atgc_lookup_victim()
564 	vblocks = get_valid_blocks(sbi, ve->segno, true);  in atgc_lookup_victim()
580 		p->min_segno = ve->segno;  in atgc_lookup_victim()
598 	struct victim_entry *ve;  in atssr_lookup_victim()  local
615 	ve = __lookup_victim_entry(sbi, p->age);  in atssr_lookup_victim()
617 	if (!ve) {  in atssr_lookup_victim()
623 	if (ve->mtime >= max_mtime || ve->mtime < min_mtime)  in atssr_lookup_victim()
626 	age = max_mtime - ve->mtime;  in atssr_lookup_victim()
628 	vblocks = get_seg_entry(sbi, ve->segno)->ckpt_valid_blocks;  in atssr_lookup_victim()
644 		p->min_segno = ve->segno;  in atssr_lookup_victim()
648 		ve = rb_entry(stage == 0 ? rb_prev(&ve->rb_node) :  in atssr_lookup_victim()
649 					rb_next(&ve->rb_node),  in atssr_lookup_victim()
674 	struct victim_entry *ve, *tmp;  in release_victim_entry()  local
676 	list_for_each_entry_safe(ve, tmp, &am->victim_list, list) {  in release_victim_entry()
677 		list_del(&ve->list);  in release_victim_entry()
678 		kmem_cache_free(victim_entry_slab, ve);  in release_victim_entry()