Lines Matching refs:nm_i
23 #define on_f2fs_build_free_nids(nmi) mutex_is_locked(&(nm_i)->build_lock)
47 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_available_free_memory() local
54 if (!nm_i) in f2fs_available_free_memory()
66 mem_size = (nm_i->nid_cnt[FREE_NID] * in f2fs_available_free_memory()
68 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); in f2fs_available_free_memory()
70 mem_size = (nm_i->nat_cnt[TOTAL_NAT] * in f2fs_available_free_memory()
72 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); in f2fs_available_free_memory()
79 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); in f2fs_available_free_memory()
87 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); in f2fs_available_free_memory()
97 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); in f2fs_available_free_memory()
101 res = mem_size < (avail_ram * nm_i->ram_thresh / 100); in f2fs_available_free_memory()
145 struct f2fs_nm_info *nm_i = NM_I(sbi); in get_next_nat_page() local
162 set_to_next_nat(nm_i, nid); in get_next_nat_page()
187 static struct nat_entry *__init_nat_entry(struct f2fs_nm_info *nm_i, in __init_nat_entry() argument
191 f2fs_radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne); in __init_nat_entry()
192 else if (radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne)) in __init_nat_entry()
198 spin_lock(&nm_i->nat_list_lock); in __init_nat_entry()
199 list_add_tail(&ne->list, &nm_i->nat_entries); in __init_nat_entry()
200 spin_unlock(&nm_i->nat_list_lock); in __init_nat_entry()
202 nm_i->nat_cnt[TOTAL_NAT]++; in __init_nat_entry()
203 nm_i->nat_cnt[RECLAIMABLE_NAT]++; in __init_nat_entry()
207 static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) in __lookup_nat_cache() argument
211 ne = radix_tree_lookup(&nm_i->nat_root, n); in __lookup_nat_cache()
215 spin_lock(&nm_i->nat_list_lock); in __lookup_nat_cache()
217 list_move_tail(&ne->list, &nm_i->nat_entries); in __lookup_nat_cache()
218 spin_unlock(&nm_i->nat_list_lock); in __lookup_nat_cache()
224 static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, in __gang_lookup_nat_cache() argument
227 return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); in __gang_lookup_nat_cache()
230 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) in __del_from_nat_cache() argument
232 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); in __del_from_nat_cache()
233 nm_i->nat_cnt[TOTAL_NAT]--; in __del_from_nat_cache()
234 nm_i->nat_cnt[RECLAIMABLE_NAT]--; in __del_from_nat_cache()
238 static struct nat_entry_set *__grab_nat_entry_set(struct f2fs_nm_info *nm_i, in __grab_nat_entry_set() argument
244 head = radix_tree_lookup(&nm_i->nat_set_root, set); in __grab_nat_entry_set()
253 f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head); in __grab_nat_entry_set()
258 static void __set_nat_cache_dirty(struct f2fs_nm_info *nm_i, in __set_nat_cache_dirty() argument
265 head = __grab_nat_entry_set(nm_i, ne); in __set_nat_cache_dirty()
281 nm_i->nat_cnt[DIRTY_NAT]++; in __set_nat_cache_dirty()
282 nm_i->nat_cnt[RECLAIMABLE_NAT]--; in __set_nat_cache_dirty()
285 spin_lock(&nm_i->nat_list_lock); in __set_nat_cache_dirty()
290 spin_unlock(&nm_i->nat_list_lock); in __set_nat_cache_dirty()
293 static void __clear_nat_cache_dirty(struct f2fs_nm_info *nm_i, in __clear_nat_cache_dirty() argument
296 spin_lock(&nm_i->nat_list_lock); in __clear_nat_cache_dirty()
297 list_move_tail(&ne->list, &nm_i->nat_entries); in __clear_nat_cache_dirty()
298 spin_unlock(&nm_i->nat_list_lock); in __clear_nat_cache_dirty()
302 nm_i->nat_cnt[DIRTY_NAT]--; in __clear_nat_cache_dirty()
303 nm_i->nat_cnt[RECLAIMABLE_NAT]++; in __clear_nat_cache_dirty()
306 static unsigned int __gang_lookup_nat_set(struct f2fs_nm_info *nm_i, in __gang_lookup_nat_set() argument
309 return radix_tree_gang_lookup(&nm_i->nat_set_root, (void **)ep, in __gang_lookup_nat_set()
382 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_need_dentry_mark() local
386 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_need_dentry_mark()
387 e = __lookup_nat_cache(nm_i, nid); in f2fs_need_dentry_mark()
393 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_need_dentry_mark()
399 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_is_checkpointed_node() local
403 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_is_checkpointed_node()
404 e = __lookup_nat_cache(nm_i, nid); in f2fs_is_checkpointed_node()
407 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_is_checkpointed_node()
413 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_need_inode_block_update() local
417 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_need_inode_block_update()
418 e = __lookup_nat_cache(nm_i, ino); in f2fs_need_inode_block_update()
423 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_need_inode_block_update()
431 struct f2fs_nm_info *nm_i = NM_I(sbi); in cache_nat_entry() local
442 f2fs_down_write(&nm_i->nat_tree_lock); in cache_nat_entry()
443 e = __lookup_nat_cache(nm_i, nid); in cache_nat_entry()
445 e = __init_nat_entry(nm_i, new, ne, false); in cache_nat_entry()
451 f2fs_up_write(&nm_i->nat_tree_lock); in cache_nat_entry()
459 struct f2fs_nm_info *nm_i = NM_I(sbi); in set_node_addr() local
463 f2fs_down_write(&nm_i->nat_tree_lock); in set_node_addr()
464 e = __lookup_nat_cache(nm_i, ni->nid); in set_node_addr()
466 e = __init_nat_entry(nm_i, new, NULL, true); in set_node_addr()
502 __set_nat_cache_dirty(nm_i, e); in set_node_addr()
506 e = __lookup_nat_cache(nm_i, ni->ino); in set_node_addr()
512 f2fs_up_write(&nm_i->nat_tree_lock); in set_node_addr()
517 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_try_to_free_nats() local
520 if (!f2fs_down_write_trylock(&nm_i->nat_tree_lock)) in f2fs_try_to_free_nats()
523 spin_lock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
527 if (list_empty(&nm_i->nat_entries)) in f2fs_try_to_free_nats()
530 ne = list_first_entry(&nm_i->nat_entries, in f2fs_try_to_free_nats()
533 spin_unlock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
535 __del_from_nat_cache(nm_i, ne); in f2fs_try_to_free_nats()
538 spin_lock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
540 spin_unlock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
542 f2fs_up_write(&nm_i->nat_tree_lock); in f2fs_try_to_free_nats()
549 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_get_node_info() local
564 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
565 e = __lookup_nat_cache(nm_i, nid); in f2fs_get_node_info()
570 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
582 } else if (f2fs_rwsem_is_contended(&nm_i->nat_tree_lock) || in f2fs_get_node_info()
584 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
595 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
601 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
2207 static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i, in __lookup_free_nid_list() argument
2210 return radix_tree_lookup(&nm_i->free_nid_root, n); in __lookup_free_nid_list()
2216 struct f2fs_nm_info *nm_i = NM_I(sbi); in __insert_free_nid() local
2217 int err = radix_tree_insert(&nm_i->free_nid_root, i->nid, i); in __insert_free_nid()
2222 nm_i->nid_cnt[FREE_NID]++; in __insert_free_nid()
2223 list_add_tail(&i->list, &nm_i->free_nid_list); in __insert_free_nid()
2230 struct f2fs_nm_info *nm_i = NM_I(sbi); in __remove_free_nid() local
2233 nm_i->nid_cnt[state]--; in __remove_free_nid()
2236 radix_tree_delete(&nm_i->free_nid_root, i->nid); in __remove_free_nid()
2242 struct f2fs_nm_info *nm_i = NM_I(sbi); in __move_free_nid() local
2246 nm_i->nid_cnt[org_state]--; in __move_free_nid()
2247 nm_i->nid_cnt[dst_state]++; in __move_free_nid()
2254 list_add_tail(&i->list, &nm_i->free_nid_list); in __move_free_nid()
2263 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_nat_bitmap_enabled() local
2267 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_nat_bitmap_enabled()
2268 for (i = 0; i < nm_i->nat_blocks; i++) { in f2fs_nat_bitmap_enabled()
2269 if (!test_bit_le(i, nm_i->nat_block_bitmap)) { in f2fs_nat_bitmap_enabled()
2274 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_nat_bitmap_enabled()
2282 struct f2fs_nm_info *nm_i = NM_I(sbi); in update_free_nid_bitmap() local
2286 if (!test_bit_le(nat_ofs, nm_i->nat_block_bitmap)) in update_free_nid_bitmap()
2290 if (test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) in update_free_nid_bitmap()
2292 __set_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); in update_free_nid_bitmap()
2293 nm_i->free_nid_count[nat_ofs]++; in update_free_nid_bitmap()
2295 if (!test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) in update_free_nid_bitmap()
2297 __clear_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); in update_free_nid_bitmap()
2299 nm_i->free_nid_count[nat_ofs]--; in update_free_nid_bitmap()
2307 struct f2fs_nm_info *nm_i = NM_I(sbi); in add_free_nid() local
2326 spin_lock(&nm_i->nid_list_lock); in add_free_nid()
2350 ne = __lookup_nat_cache(nm_i, nid); in add_free_nid()
2355 e = __lookup_free_nid_list(nm_i, nid); in add_free_nid()
2368 nm_i->available_nids++; in add_free_nid()
2370 spin_unlock(&nm_i->nid_list_lock); in add_free_nid()
2380 struct f2fs_nm_info *nm_i = NM_I(sbi); in remove_free_nid() local
2384 spin_lock(&nm_i->nid_list_lock); in remove_free_nid()
2385 i = __lookup_free_nid_list(nm_i, nid); in remove_free_nid()
2390 spin_unlock(&nm_i->nid_list_lock); in remove_free_nid()
2399 struct f2fs_nm_info *nm_i = NM_I(sbi); in scan_nat_page() local
2405 __set_bit_le(nat_ofs, nm_i->nat_block_bitmap); in scan_nat_page()
2410 if (unlikely(start_nid >= nm_i->max_nid)) in scan_nat_page()
2453 struct f2fs_nm_info *nm_i = NM_I(sbi); in scan_free_nid_bits() local
2457 f2fs_down_read(&nm_i->nat_tree_lock); in scan_free_nid_bits()
2459 for (i = 0; i < nm_i->nat_blocks; i++) { in scan_free_nid_bits()
2460 if (!test_bit_le(i, nm_i->nat_block_bitmap)) in scan_free_nid_bits()
2462 if (!nm_i->free_nid_count[i]) in scan_free_nid_bits()
2465 idx = find_next_bit_le(nm_i->free_nid_bitmap[i], in scan_free_nid_bits()
2473 if (nm_i->nid_cnt[FREE_NID] >= MAX_FREE_NIDS) in scan_free_nid_bits()
2480 f2fs_up_read(&nm_i->nat_tree_lock); in scan_free_nid_bits()
2486 struct f2fs_nm_info *nm_i = NM_I(sbi); in __f2fs_build_free_nids() local
2488 nid_t nid = nm_i->next_scan_nid; in __f2fs_build_free_nids()
2490 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2497 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) in __f2fs_build_free_nids()
2507 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) in __f2fs_build_free_nids()
2515 f2fs_down_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2519 nm_i->nat_block_bitmap)) { in __f2fs_build_free_nids()
2530 f2fs_up_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2544 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2552 nm_i->next_scan_nid = nid; in __f2fs_build_free_nids()
2557 f2fs_up_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2559 f2fs_ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nm_i->next_scan_nid), in __f2fs_build_free_nids()
2560 nm_i->ra_nid_pages, META_NAT, false); in __f2fs_build_free_nids()
2583 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid() local
2589 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2591 if (unlikely(nm_i->available_nids == 0)) { in f2fs_alloc_nid()
2592 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2597 if (nm_i->nid_cnt[FREE_NID] && !on_f2fs_build_free_nids(nm_i)) { in f2fs_alloc_nid()
2598 f2fs_bug_on(sbi, list_empty(&nm_i->free_nid_list)); in f2fs_alloc_nid()
2599 i = list_first_entry(&nm_i->free_nid_list, in f2fs_alloc_nid()
2604 nm_i->available_nids--; in f2fs_alloc_nid()
2608 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2611 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2624 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid_done() local
2627 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid_done()
2628 i = __lookup_free_nid_list(nm_i, nid); in f2fs_alloc_nid_done()
2631 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid_done()
2641 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid_failed() local
2648 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid_failed()
2649 i = __lookup_free_nid_list(nm_i, nid); in f2fs_alloc_nid_failed()
2659 nm_i->available_nids++; in f2fs_alloc_nid_failed()
2663 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid_failed()
2671 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_try_to_free_nids() local
2674 if (nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) in f2fs_try_to_free_nids()
2677 if (!mutex_trylock(&nm_i->build_lock)) in f2fs_try_to_free_nids()
2680 while (nr_shrink && nm_i->nid_cnt[FREE_NID] > MAX_FREE_NIDS) { in f2fs_try_to_free_nids()
2684 spin_lock(&nm_i->nid_list_lock); in f2fs_try_to_free_nids()
2685 list_for_each_entry_safe(i, next, &nm_i->free_nid_list, list) { in f2fs_try_to_free_nids()
2687 nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) in f2fs_try_to_free_nids()
2694 spin_unlock(&nm_i->nid_list_lock); in f2fs_try_to_free_nids()
2697 mutex_unlock(&nm_i->build_lock); in f2fs_try_to_free_nids()
2899 struct f2fs_nm_info *nm_i = NM_I(sbi); in remove_nats_in_journal() local
2915 ne = __lookup_nat_cache(nm_i, nid); in remove_nats_in_journal()
2918 __init_nat_entry(nm_i, ne, &raw_ne, true); in remove_nats_in_journal()
2928 spin_lock(&nm_i->nid_list_lock); in remove_nats_in_journal()
2929 nm_i->available_nids--; in remove_nats_in_journal()
2930 spin_unlock(&nm_i->nid_list_lock); in remove_nats_in_journal()
2933 __set_nat_cache_dirty(nm_i, ne); in remove_nats_in_journal()
2957 static void __update_nat_bits(struct f2fs_nm_info *nm_i, unsigned int nat_ofs, in __update_nat_bits() argument
2961 __set_bit_le(nat_ofs, nm_i->empty_nat_bits); in __update_nat_bits()
2962 __clear_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2966 __clear_bit_le(nat_ofs, nm_i->empty_nat_bits); in __update_nat_bits()
2968 __set_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2970 __clear_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2976 struct f2fs_nm_info *nm_i = NM_I(sbi); in update_nat_bits() local
2994 __update_nat_bits(nm_i, nat_index, valid); in update_nat_bits()
2999 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_enable_nat_bits() local
3002 f2fs_down_read(&nm_i->nat_tree_lock); in f2fs_enable_nat_bits()
3004 for (nat_ofs = 0; nat_ofs < nm_i->nat_blocks; nat_ofs++) { in f2fs_enable_nat_bits()
3015 nm_i->free_nid_bitmap[nat_ofs])) in f2fs_enable_nat_bits()
3019 __update_nat_bits(nm_i, nat_ofs, valid); in f2fs_enable_nat_bits()
3022 f2fs_up_read(&nm_i->nat_tree_lock); in f2fs_enable_nat_bits()
3105 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_flush_nat_entries() local
3120 f2fs_down_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3122 f2fs_up_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3125 if (!nm_i->nat_cnt[DIRTY_NAT]) in f2fs_flush_nat_entries()
3128 f2fs_down_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3137 nm_i->nat_cnt[DIRTY_NAT], NAT_JOURNAL)) in f2fs_flush_nat_entries()
3140 while ((found = __gang_lookup_nat_set(nm_i, in f2fs_flush_nat_entries()
3157 f2fs_up_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3166 struct f2fs_nm_info *nm_i = NM_I(sbi); in __get_nat_bitmaps() local
3167 unsigned int nat_bits_bytes = nm_i->nat_blocks / BITS_PER_BYTE; in __get_nat_bitmaps()
3172 nm_i->nat_bits_blocks = F2FS_BLK_ALIGN((nat_bits_bytes << 1) + 8); in __get_nat_bitmaps()
3173 nm_i->nat_bits = f2fs_kvzalloc(sbi, in __get_nat_bitmaps()
3174 nm_i->nat_bits_blocks << F2FS_BLKSIZE_BITS, GFP_KERNEL); in __get_nat_bitmaps()
3175 if (!nm_i->nat_bits) in __get_nat_bitmaps()
3178 nm_i->full_nat_bits = nm_i->nat_bits + 8; in __get_nat_bitmaps()
3179 nm_i->empty_nat_bits = nm_i->full_nat_bits + nat_bits_bytes; in __get_nat_bitmaps()
3185 nm_i->nat_bits_blocks; in __get_nat_bitmaps()
3186 for (i = 0; i < nm_i->nat_bits_blocks; i++) { in __get_nat_bitmaps()
3193 memcpy(nm_i->nat_bits + (i << F2FS_BLKSIZE_BITS), in __get_nat_bitmaps()
3199 if (cpu_to_le64(cp_ver) != *(__le64 *)nm_i->nat_bits) { in __get_nat_bitmaps()
3202 cp_ver, le64_to_cpu(*(__le64 *)nm_i->nat_bits)); in __get_nat_bitmaps()
3212 struct f2fs_nm_info *nm_i = NM_I(sbi); in load_free_nid_bitmap() local
3219 for (i = 0; i < nm_i->nat_blocks; i++) { in load_free_nid_bitmap()
3220 i = find_next_bit_le(nm_i->empty_nat_bits, nm_i->nat_blocks, i); in load_free_nid_bitmap()
3221 if (i >= nm_i->nat_blocks) in load_free_nid_bitmap()
3224 __set_bit_le(i, nm_i->nat_block_bitmap); in load_free_nid_bitmap()
3235 for (i = 0; i < nm_i->nat_blocks; i++) { in load_free_nid_bitmap()
3236 i = find_next_bit_le(nm_i->full_nat_bits, nm_i->nat_blocks, i); in load_free_nid_bitmap()
3237 if (i >= nm_i->nat_blocks) in load_free_nid_bitmap()
3240 __set_bit_le(i, nm_i->nat_block_bitmap); in load_free_nid_bitmap()
3247 struct f2fs_nm_info *nm_i = NM_I(sbi); in init_node_manager() local
3252 nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); in init_node_manager()
3256 nm_i->nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); in init_node_manager()
3257 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; in init_node_manager()
3260 nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count - in init_node_manager()
3262 nm_i->nid_cnt[FREE_NID] = 0; in init_node_manager()
3263 nm_i->nid_cnt[PREALLOC_NID] = 0; in init_node_manager()
3264 nm_i->ram_thresh = DEF_RAM_THRESHOLD; in init_node_manager()
3265 nm_i->ra_nid_pages = DEF_RA_NID_PAGES; in init_node_manager()
3266 nm_i->dirty_nats_ratio = DEF_DIRTY_NAT_RATIO_THRESHOLD; in init_node_manager()
3267 nm_i->max_rf_node_blocks = DEF_RF_NODE_BLOCKS; in init_node_manager()
3269 INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC); in init_node_manager()
3270 INIT_LIST_HEAD(&nm_i->free_nid_list); in init_node_manager()
3271 INIT_RADIX_TREE(&nm_i->nat_root, GFP_NOIO); in init_node_manager()
3272 INIT_RADIX_TREE(&nm_i->nat_set_root, GFP_NOIO); in init_node_manager()
3273 INIT_LIST_HEAD(&nm_i->nat_entries); in init_node_manager()
3274 spin_lock_init(&nm_i->nat_list_lock); in init_node_manager()
3276 mutex_init(&nm_i->build_lock); in init_node_manager()
3277 spin_lock_init(&nm_i->nid_list_lock); in init_node_manager()
3278 init_f2fs_rwsem(&nm_i->nat_tree_lock); in init_node_manager()
3280 nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); in init_node_manager()
3281 nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); in init_node_manager()
3283 nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size, in init_node_manager()
3285 if (!nm_i->nat_bitmap) in init_node_manager()
3293 nm_i->nat_bitmap_mir = kmemdup(version_bitmap, nm_i->bitmap_size, in init_node_manager()
3295 if (!nm_i->nat_bitmap_mir) in init_node_manager()
3304 struct f2fs_nm_info *nm_i = NM_I(sbi); in init_free_nid_cache() local
3307 nm_i->free_nid_bitmap = in init_free_nid_cache()
3309 nm_i->nat_blocks), in init_free_nid_cache()
3311 if (!nm_i->free_nid_bitmap) in init_free_nid_cache()
3314 for (i = 0; i < nm_i->nat_blocks; i++) { in init_free_nid_cache()
3315 nm_i->free_nid_bitmap[i] = f2fs_kvzalloc(sbi, in init_free_nid_cache()
3317 if (!nm_i->free_nid_bitmap[i]) in init_free_nid_cache()
3321 nm_i->nat_block_bitmap = f2fs_kvzalloc(sbi, nm_i->nat_blocks / 8, in init_free_nid_cache()
3323 if (!nm_i->nat_block_bitmap) in init_free_nid_cache()
3326 nm_i->free_nid_count = in init_free_nid_cache()
3328 nm_i->nat_blocks), in init_free_nid_cache()
3330 if (!nm_i->free_nid_count) in init_free_nid_cache()
3360 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_destroy_node_manager() local
3368 if (!nm_i) in f2fs_destroy_node_manager()
3372 spin_lock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3373 list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { in f2fs_destroy_node_manager()
3375 spin_unlock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3377 spin_lock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3379 f2fs_bug_on(sbi, nm_i->nid_cnt[FREE_NID]); in f2fs_destroy_node_manager()
3380 f2fs_bug_on(sbi, nm_i->nid_cnt[PREALLOC_NID]); in f2fs_destroy_node_manager()
3381 f2fs_bug_on(sbi, !list_empty(&nm_i->free_nid_list)); in f2fs_destroy_node_manager()
3382 spin_unlock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3385 f2fs_down_write(&nm_i->nat_tree_lock); in f2fs_destroy_node_manager()
3386 while ((found = __gang_lookup_nat_cache(nm_i, in f2fs_destroy_node_manager()
3392 spin_lock(&nm_i->nat_list_lock); in f2fs_destroy_node_manager()
3394 spin_unlock(&nm_i->nat_list_lock); in f2fs_destroy_node_manager()
3396 __del_from_nat_cache(nm_i, natvec[idx]); in f2fs_destroy_node_manager()
3399 f2fs_bug_on(sbi, nm_i->nat_cnt[TOTAL_NAT]); in f2fs_destroy_node_manager()
3404 while ((found = __gang_lookup_nat_set(nm_i, in f2fs_destroy_node_manager()
3412 radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set); in f2fs_destroy_node_manager()
3416 f2fs_up_write(&nm_i->nat_tree_lock); in f2fs_destroy_node_manager()
3418 kvfree(nm_i->nat_block_bitmap); in f2fs_destroy_node_manager()
3419 if (nm_i->free_nid_bitmap) { in f2fs_destroy_node_manager()
3422 for (i = 0; i < nm_i->nat_blocks; i++) in f2fs_destroy_node_manager()
3423 kvfree(nm_i->free_nid_bitmap[i]); in f2fs_destroy_node_manager()
3424 kvfree(nm_i->free_nid_bitmap); in f2fs_destroy_node_manager()
3426 kvfree(nm_i->free_nid_count); in f2fs_destroy_node_manager()
3428 kvfree(nm_i->nat_bitmap); in f2fs_destroy_node_manager()
3429 kvfree(nm_i->nat_bits); in f2fs_destroy_node_manager()
3431 kvfree(nm_i->nat_bitmap_mir); in f2fs_destroy_node_manager()
3434 kfree(nm_i); in f2fs_destroy_node_manager()