218 	nid_t set = NAT_BLOCK_OFFSET(ne->ni.nid);  in __grab_nat_entry_set()  local
221 	head = radix_tree_lookup(&nm_i->nat_set_root, set);  in __grab_nat_entry_set()
227 		head->set = set;  in __grab_nat_entry_set()
229 		f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head);  in __grab_nat_entry_set()
269 		struct nat_entry_set *set, struct nat_entry *ne)  in __clear_nat_cache_dirty()  argument
276 	set->entry_cnt--;  in __clear_nat_cache_dirty()
2044 							bool set, bool build)  in update_free_nid_bitmap()  argument
2053 	if (set) {  in update_free_nid_bitmap()
2728 		struct nat_entry_set *set, struct cp_control *cpc)  in __flush_nat_entry_set()  argument
2732 	nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK;  in __flush_nat_entry_set()
2744 		!__has_cursum_space(journal, set->entry_cnt, NAT_JOURNAL))  in __flush_nat_entry_set()
2759 	list_for_each_entry_safe(ne, cur, &set->entry_list, list) {  in __flush_nat_entry_set()
2777 		__clear_nat_cache_dirty(NM_I(sbi), set, ne);  in __flush_nat_entry_set()
2795 	if (!set->entry_cnt) {  in __flush_nat_entry_set()
2796 		radix_tree_delete(&NM_I(sbi)->nat_set_root, set->set);  in __flush_nat_entry_set()
2797 		kmem_cache_free(nat_entry_set_slab, set);  in __flush_nat_entry_set()
2811 	struct nat_entry_set *set, *tmp;  in f2fs_flush_nat_entries()  local
2841 		set_idx = setvec[found - 1]->set + 1;  in f2fs_flush_nat_entries()
2848 	list_for_each_entry_safe(set, tmp, &sets, set_list) {  in f2fs_flush_nat_entries()
2849 		err = __flush_nat_entry_set(sbi, set, cpc);  in f2fs_flush_nat_entries()
3104 		nid = setvec[found - 1]->set + 1;  in f2fs_destroy_node_manager()
3108 			radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set);  in f2fs_destroy_node_manager()