Lines Matching refs:nm_i
23 #define on_f2fs_build_free_nids(nmi) mutex_is_locked(&(nm_i)->build_lock)
46 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_available_free_memory() local
53 if (!nm_i) in f2fs_available_free_memory()
65 mem_size = (nm_i->nid_cnt[FREE_NID] * in f2fs_available_free_memory()
67 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); in f2fs_available_free_memory()
69 mem_size = (nm_i->nat_cnt[TOTAL_NAT] * in f2fs_available_free_memory()
71 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); in f2fs_available_free_memory()
78 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); in f2fs_available_free_memory()
86 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); in f2fs_available_free_memory()
92 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); in f2fs_available_free_memory()
100 res = mem_size < (avail_ram * nm_i->ram_thresh / 100); in f2fs_available_free_memory()
144 struct f2fs_nm_info *nm_i = NM_I(sbi); in get_next_nat_page() local
161 set_to_next_nat(nm_i, nid); in get_next_nat_page()
186 static struct nat_entry *__init_nat_entry(struct f2fs_nm_info *nm_i, in __init_nat_entry() argument
190 f2fs_radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne); in __init_nat_entry()
191 else if (radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne)) in __init_nat_entry()
197 spin_lock(&nm_i->nat_list_lock); in __init_nat_entry()
198 list_add_tail(&ne->list, &nm_i->nat_entries); in __init_nat_entry()
199 spin_unlock(&nm_i->nat_list_lock); in __init_nat_entry()
201 nm_i->nat_cnt[TOTAL_NAT]++; in __init_nat_entry()
202 nm_i->nat_cnt[RECLAIMABLE_NAT]++; in __init_nat_entry()
206 static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) in __lookup_nat_cache() argument
210 ne = radix_tree_lookup(&nm_i->nat_root, n); in __lookup_nat_cache()
214 spin_lock(&nm_i->nat_list_lock); in __lookup_nat_cache()
216 list_move_tail(&ne->list, &nm_i->nat_entries); in __lookup_nat_cache()
217 spin_unlock(&nm_i->nat_list_lock); in __lookup_nat_cache()
223 static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, in __gang_lookup_nat_cache() argument
226 return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); in __gang_lookup_nat_cache()
229 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) in __del_from_nat_cache() argument
231 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); in __del_from_nat_cache()
232 nm_i->nat_cnt[TOTAL_NAT]--; in __del_from_nat_cache()
233 nm_i->nat_cnt[RECLAIMABLE_NAT]--; in __del_from_nat_cache()
237 static struct nat_entry_set *__grab_nat_entry_set(struct f2fs_nm_info *nm_i, in __grab_nat_entry_set() argument
243 head = radix_tree_lookup(&nm_i->nat_set_root, set); in __grab_nat_entry_set()
252 f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head); in __grab_nat_entry_set()
257 static void __set_nat_cache_dirty(struct f2fs_nm_info *nm_i, in __set_nat_cache_dirty() argument
264 head = __grab_nat_entry_set(nm_i, ne); in __set_nat_cache_dirty()
280 nm_i->nat_cnt[DIRTY_NAT]++; in __set_nat_cache_dirty()
281 nm_i->nat_cnt[RECLAIMABLE_NAT]--; in __set_nat_cache_dirty()
284 spin_lock(&nm_i->nat_list_lock); in __set_nat_cache_dirty()
289 spin_unlock(&nm_i->nat_list_lock); in __set_nat_cache_dirty()
292 static void __clear_nat_cache_dirty(struct f2fs_nm_info *nm_i, in __clear_nat_cache_dirty() argument
295 spin_lock(&nm_i->nat_list_lock); in __clear_nat_cache_dirty()
296 list_move_tail(&ne->list, &nm_i->nat_entries); in __clear_nat_cache_dirty()
297 spin_unlock(&nm_i->nat_list_lock); in __clear_nat_cache_dirty()
301 nm_i->nat_cnt[DIRTY_NAT]--; in __clear_nat_cache_dirty()
302 nm_i->nat_cnt[RECLAIMABLE_NAT]++; in __clear_nat_cache_dirty()
305 static unsigned int __gang_lookup_nat_set(struct f2fs_nm_info *nm_i, in __gang_lookup_nat_set() argument
308 return radix_tree_gang_lookup(&nm_i->nat_set_root, (void **)ep, in __gang_lookup_nat_set()
381 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_need_dentry_mark() local
385 down_read(&nm_i->nat_tree_lock); in f2fs_need_dentry_mark()
386 e = __lookup_nat_cache(nm_i, nid); in f2fs_need_dentry_mark()
392 up_read(&nm_i->nat_tree_lock); in f2fs_need_dentry_mark()
398 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_is_checkpointed_node() local
402 down_read(&nm_i->nat_tree_lock); in f2fs_is_checkpointed_node()
403 e = __lookup_nat_cache(nm_i, nid); in f2fs_is_checkpointed_node()
406 up_read(&nm_i->nat_tree_lock); in f2fs_is_checkpointed_node()
412 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_need_inode_block_update() local
416 down_read(&nm_i->nat_tree_lock); in f2fs_need_inode_block_update()
417 e = __lookup_nat_cache(nm_i, ino); in f2fs_need_inode_block_update()
422 up_read(&nm_i->nat_tree_lock); in f2fs_need_inode_block_update()
430 struct f2fs_nm_info *nm_i = NM_I(sbi); in cache_nat_entry() local
437 down_write(&nm_i->nat_tree_lock); in cache_nat_entry()
438 e = __lookup_nat_cache(nm_i, nid); in cache_nat_entry()
440 e = __init_nat_entry(nm_i, new, ne, false); in cache_nat_entry()
446 up_write(&nm_i->nat_tree_lock); in cache_nat_entry()
454 struct f2fs_nm_info *nm_i = NM_I(sbi); in set_node_addr() local
458 down_write(&nm_i->nat_tree_lock); in set_node_addr()
459 e = __lookup_nat_cache(nm_i, ni->nid); in set_node_addr()
461 e = __init_nat_entry(nm_i, new, NULL, true); in set_node_addr()
497 __set_nat_cache_dirty(nm_i, e); in set_node_addr()
501 e = __lookup_nat_cache(nm_i, ni->ino); in set_node_addr()
507 up_write(&nm_i->nat_tree_lock); in set_node_addr()
512 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_try_to_free_nats() local
515 if (!down_write_trylock(&nm_i->nat_tree_lock)) in f2fs_try_to_free_nats()
518 spin_lock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
522 if (list_empty(&nm_i->nat_entries)) in f2fs_try_to_free_nats()
525 ne = list_first_entry(&nm_i->nat_entries, in f2fs_try_to_free_nats()
528 spin_unlock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
530 __del_from_nat_cache(nm_i, ne); in f2fs_try_to_free_nats()
533 spin_lock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
535 spin_unlock(&nm_i->nat_list_lock); in f2fs_try_to_free_nats()
537 up_write(&nm_i->nat_tree_lock); in f2fs_try_to_free_nats()
544 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_get_node_info() local
559 down_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
560 e = __lookup_nat_cache(nm_i, nid); in f2fs_get_node_info()
565 up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
578 up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
589 up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
595 up_read(&nm_i->nat_tree_lock); in f2fs_get_node_info()
2162 static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i, in __lookup_free_nid_list() argument
2165 return radix_tree_lookup(&nm_i->free_nid_root, n); in __lookup_free_nid_list()
2171 struct f2fs_nm_info *nm_i = NM_I(sbi); in __insert_free_nid() local
2172 int err = radix_tree_insert(&nm_i->free_nid_root, i->nid, i); in __insert_free_nid()
2177 nm_i->nid_cnt[FREE_NID]++; in __insert_free_nid()
2178 list_add_tail(&i->list, &nm_i->free_nid_list); in __insert_free_nid()
2185 struct f2fs_nm_info *nm_i = NM_I(sbi); in __remove_free_nid() local
2188 nm_i->nid_cnt[state]--; in __remove_free_nid()
2191 radix_tree_delete(&nm_i->free_nid_root, i->nid); in __remove_free_nid()
2197 struct f2fs_nm_info *nm_i = NM_I(sbi); in __move_free_nid() local
2201 nm_i->nid_cnt[org_state]--; in __move_free_nid()
2202 nm_i->nid_cnt[dst_state]++; in __move_free_nid()
2209 list_add_tail(&i->list, &nm_i->free_nid_list); in __move_free_nid()
2218 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_nat_bitmap_enabled() local
2222 down_read(&nm_i->nat_tree_lock); in f2fs_nat_bitmap_enabled()
2223 for (i = 0; i < nm_i->nat_blocks; i++) { in f2fs_nat_bitmap_enabled()
2224 if (!test_bit_le(i, nm_i->nat_block_bitmap)) { in f2fs_nat_bitmap_enabled()
2229 up_read(&nm_i->nat_tree_lock); in f2fs_nat_bitmap_enabled()
2237 struct f2fs_nm_info *nm_i = NM_I(sbi); in update_free_nid_bitmap() local
2241 if (!test_bit_le(nat_ofs, nm_i->nat_block_bitmap)) in update_free_nid_bitmap()
2245 if (test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) in update_free_nid_bitmap()
2247 __set_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); in update_free_nid_bitmap()
2248 nm_i->free_nid_count[nat_ofs]++; in update_free_nid_bitmap()
2250 if (!test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) in update_free_nid_bitmap()
2252 __clear_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); in update_free_nid_bitmap()
2254 nm_i->free_nid_count[nat_ofs]--; in update_free_nid_bitmap()
2262 struct f2fs_nm_info *nm_i = NM_I(sbi); in add_free_nid() local
2281 spin_lock(&nm_i->nid_list_lock); in add_free_nid()
2305 ne = __lookup_nat_cache(nm_i, nid); in add_free_nid()
2310 e = __lookup_free_nid_list(nm_i, nid); in add_free_nid()
2323 nm_i->available_nids++; in add_free_nid()
2325 spin_unlock(&nm_i->nid_list_lock); in add_free_nid()
2335 struct f2fs_nm_info *nm_i = NM_I(sbi); in remove_free_nid() local
2339 spin_lock(&nm_i->nid_list_lock); in remove_free_nid()
2340 i = __lookup_free_nid_list(nm_i, nid); in remove_free_nid()
2345 spin_unlock(&nm_i->nid_list_lock); in remove_free_nid()
2354 struct f2fs_nm_info *nm_i = NM_I(sbi); in scan_nat_page() local
2360 __set_bit_le(nat_ofs, nm_i->nat_block_bitmap); in scan_nat_page()
2365 if (unlikely(start_nid >= nm_i->max_nid)) in scan_nat_page()
2408 struct f2fs_nm_info *nm_i = NM_I(sbi); in scan_free_nid_bits() local
2412 down_read(&nm_i->nat_tree_lock); in scan_free_nid_bits()
2414 for (i = 0; i < nm_i->nat_blocks; i++) { in scan_free_nid_bits()
2415 if (!test_bit_le(i, nm_i->nat_block_bitmap)) in scan_free_nid_bits()
2417 if (!nm_i->free_nid_count[i]) in scan_free_nid_bits()
2420 idx = find_next_bit_le(nm_i->free_nid_bitmap[i], in scan_free_nid_bits()
2428 if (nm_i->nid_cnt[FREE_NID] >= MAX_FREE_NIDS) in scan_free_nid_bits()
2435 up_read(&nm_i->nat_tree_lock); in scan_free_nid_bits()
2441 struct f2fs_nm_info *nm_i = NM_I(sbi); in __f2fs_build_free_nids() local
2443 nid_t nid = nm_i->next_scan_nid; in __f2fs_build_free_nids()
2445 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2452 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) in __f2fs_build_free_nids()
2462 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) in __f2fs_build_free_nids()
2470 down_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2474 nm_i->nat_block_bitmap)) { in __f2fs_build_free_nids()
2485 up_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2492 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2500 nm_i->next_scan_nid = nid; in __f2fs_build_free_nids()
2505 up_read(&nm_i->nat_tree_lock); in __f2fs_build_free_nids()
2507 f2fs_ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nm_i->next_scan_nid), in __f2fs_build_free_nids()
2508 nm_i->ra_nid_pages, META_NAT, false); in __f2fs_build_free_nids()
2531 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid() local
2539 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2541 if (unlikely(nm_i->available_nids == 0)) { in f2fs_alloc_nid()
2542 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2547 if (nm_i->nid_cnt[FREE_NID] && !on_f2fs_build_free_nids(nm_i)) { in f2fs_alloc_nid()
2548 f2fs_bug_on(sbi, list_empty(&nm_i->free_nid_list)); in f2fs_alloc_nid()
2549 i = list_first_entry(&nm_i->free_nid_list, in f2fs_alloc_nid()
2554 nm_i->available_nids--; in f2fs_alloc_nid()
2558 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2561 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid()
2574 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid_done() local
2577 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid_done()
2578 i = __lookup_free_nid_list(nm_i, nid); in f2fs_alloc_nid_done()
2581 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid_done()
2591 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_alloc_nid_failed() local
2598 spin_lock(&nm_i->nid_list_lock); in f2fs_alloc_nid_failed()
2599 i = __lookup_free_nid_list(nm_i, nid); in f2fs_alloc_nid_failed()
2609 nm_i->available_nids++; in f2fs_alloc_nid_failed()
2613 spin_unlock(&nm_i->nid_list_lock); in f2fs_alloc_nid_failed()
2621 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_try_to_free_nids() local
2624 if (nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) in f2fs_try_to_free_nids()
2627 if (!mutex_trylock(&nm_i->build_lock)) in f2fs_try_to_free_nids()
2630 while (nr_shrink && nm_i->nid_cnt[FREE_NID] > MAX_FREE_NIDS) { in f2fs_try_to_free_nids()
2634 spin_lock(&nm_i->nid_list_lock); in f2fs_try_to_free_nids()
2635 list_for_each_entry_safe(i, next, &nm_i->free_nid_list, list) { in f2fs_try_to_free_nids()
2637 nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) in f2fs_try_to_free_nids()
2644 spin_unlock(&nm_i->nid_list_lock); in f2fs_try_to_free_nids()
2647 mutex_unlock(&nm_i->build_lock); in f2fs_try_to_free_nids()
2847 struct f2fs_nm_info *nm_i = NM_I(sbi); in remove_nats_in_journal() local
2863 ne = __lookup_nat_cache(nm_i, nid); in remove_nats_in_journal()
2866 __init_nat_entry(nm_i, ne, &raw_ne, true); in remove_nats_in_journal()
2876 spin_lock(&nm_i->nid_list_lock); in remove_nats_in_journal()
2877 nm_i->available_nids--; in remove_nats_in_journal()
2878 spin_unlock(&nm_i->nid_list_lock); in remove_nats_in_journal()
2881 __set_nat_cache_dirty(nm_i, ne); in remove_nats_in_journal()
2905 static void __update_nat_bits(struct f2fs_nm_info *nm_i, unsigned int nat_ofs, in __update_nat_bits() argument
2909 __set_bit_le(nat_ofs, nm_i->empty_nat_bits); in __update_nat_bits()
2910 __clear_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2914 __clear_bit_le(nat_ofs, nm_i->empty_nat_bits); in __update_nat_bits()
2916 __set_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2918 __clear_bit_le(nat_ofs, nm_i->full_nat_bits); in __update_nat_bits()
2924 struct f2fs_nm_info *nm_i = NM_I(sbi); in update_nat_bits() local
2942 __update_nat_bits(nm_i, nat_index, valid); in update_nat_bits()
2947 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_enable_nat_bits() local
2950 down_read(&nm_i->nat_tree_lock); in f2fs_enable_nat_bits()
2952 for (nat_ofs = 0; nat_ofs < nm_i->nat_blocks; nat_ofs++) { in f2fs_enable_nat_bits()
2963 nm_i->free_nid_bitmap[nat_ofs])) in f2fs_enable_nat_bits()
2967 __update_nat_bits(nm_i, nat_ofs, valid); in f2fs_enable_nat_bits()
2970 up_read(&nm_i->nat_tree_lock); in f2fs_enable_nat_bits()
3053 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_flush_nat_entries() local
3068 down_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3070 up_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3073 if (!nm_i->nat_cnt[DIRTY_NAT]) in f2fs_flush_nat_entries()
3076 down_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3085 nm_i->nat_cnt[DIRTY_NAT], NAT_JOURNAL)) in f2fs_flush_nat_entries()
3088 while ((found = __gang_lookup_nat_set(nm_i, in f2fs_flush_nat_entries()
3105 up_write(&nm_i->nat_tree_lock); in f2fs_flush_nat_entries()
3114 struct f2fs_nm_info *nm_i = NM_I(sbi); in __get_nat_bitmaps() local
3115 unsigned int nat_bits_bytes = nm_i->nat_blocks / BITS_PER_BYTE; in __get_nat_bitmaps()
3120 nm_i->nat_bits_blocks = F2FS_BLK_ALIGN((nat_bits_bytes << 1) + 8); in __get_nat_bitmaps()
3121 nm_i->nat_bits = f2fs_kvzalloc(sbi, in __get_nat_bitmaps()
3122 nm_i->nat_bits_blocks << F2FS_BLKSIZE_BITS, GFP_KERNEL); in __get_nat_bitmaps()
3123 if (!nm_i->nat_bits) in __get_nat_bitmaps()
3126 nm_i->full_nat_bits = nm_i->nat_bits + 8; in __get_nat_bitmaps()
3127 nm_i->empty_nat_bits = nm_i->full_nat_bits + nat_bits_bytes; in __get_nat_bitmaps()
3133 nm_i->nat_bits_blocks; in __get_nat_bitmaps()
3134 for (i = 0; i < nm_i->nat_bits_blocks; i++) { in __get_nat_bitmaps()
3141 memcpy(nm_i->nat_bits + (i << F2FS_BLKSIZE_BITS), in __get_nat_bitmaps()
3147 if (cpu_to_le64(cp_ver) != *(__le64 *)nm_i->nat_bits) { in __get_nat_bitmaps()
3150 cp_ver, le64_to_cpu(*(__le64 *)nm_i->nat_bits)); in __get_nat_bitmaps()
3160 struct f2fs_nm_info *nm_i = NM_I(sbi); in load_free_nid_bitmap() local
3167 for (i = 0; i < nm_i->nat_blocks; i++) { in load_free_nid_bitmap()
3168 i = find_next_bit_le(nm_i->empty_nat_bits, nm_i->nat_blocks, i); in load_free_nid_bitmap()
3169 if (i >= nm_i->nat_blocks) in load_free_nid_bitmap()
3172 __set_bit_le(i, nm_i->nat_block_bitmap); in load_free_nid_bitmap()
3183 for (i = 0; i < nm_i->nat_blocks; i++) { in load_free_nid_bitmap()
3184 i = find_next_bit_le(nm_i->full_nat_bits, nm_i->nat_blocks, i); in load_free_nid_bitmap()
3185 if (i >= nm_i->nat_blocks) in load_free_nid_bitmap()
3188 __set_bit_le(i, nm_i->nat_block_bitmap); in load_free_nid_bitmap()
3195 struct f2fs_nm_info *nm_i = NM_I(sbi); in init_node_manager() local
3200 nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); in init_node_manager()
3204 nm_i->nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); in init_node_manager()
3205 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; in init_node_manager()
3208 nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count - in init_node_manager()
3210 nm_i->nid_cnt[FREE_NID] = 0; in init_node_manager()
3211 nm_i->nid_cnt[PREALLOC_NID] = 0; in init_node_manager()
3212 nm_i->ram_thresh = DEF_RAM_THRESHOLD; in init_node_manager()
3213 nm_i->ra_nid_pages = DEF_RA_NID_PAGES; in init_node_manager()
3214 nm_i->dirty_nats_ratio = DEF_DIRTY_NAT_RATIO_THRESHOLD; in init_node_manager()
3216 INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC); in init_node_manager()
3217 INIT_LIST_HEAD(&nm_i->free_nid_list); in init_node_manager()
3218 INIT_RADIX_TREE(&nm_i->nat_root, GFP_NOIO); in init_node_manager()
3219 INIT_RADIX_TREE(&nm_i->nat_set_root, GFP_NOIO); in init_node_manager()
3220 INIT_LIST_HEAD(&nm_i->nat_entries); in init_node_manager()
3221 spin_lock_init(&nm_i->nat_list_lock); in init_node_manager()
3223 mutex_init(&nm_i->build_lock); in init_node_manager()
3224 spin_lock_init(&nm_i->nid_list_lock); in init_node_manager()
3225 init_rwsem(&nm_i->nat_tree_lock); in init_node_manager()
3227 nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); in init_node_manager()
3228 nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); in init_node_manager()
3230 nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size, in init_node_manager()
3232 if (!nm_i->nat_bitmap) in init_node_manager()
3240 nm_i->nat_bitmap_mir = kmemdup(version_bitmap, nm_i->bitmap_size, in init_node_manager()
3242 if (!nm_i->nat_bitmap_mir) in init_node_manager()
3251 struct f2fs_nm_info *nm_i = NM_I(sbi); in init_free_nid_cache() local
3254 nm_i->free_nid_bitmap = in init_free_nid_cache()
3256 nm_i->nat_blocks), in init_free_nid_cache()
3258 if (!nm_i->free_nid_bitmap) in init_free_nid_cache()
3261 for (i = 0; i < nm_i->nat_blocks; i++) { in init_free_nid_cache()
3262 nm_i->free_nid_bitmap[i] = f2fs_kvzalloc(sbi, in init_free_nid_cache()
3264 if (!nm_i->free_nid_bitmap[i]) in init_free_nid_cache()
3268 nm_i->nat_block_bitmap = f2fs_kvzalloc(sbi, nm_i->nat_blocks / 8, in init_free_nid_cache()
3270 if (!nm_i->nat_block_bitmap) in init_free_nid_cache()
3273 nm_i->free_nid_count = in init_free_nid_cache()
3275 nm_i->nat_blocks), in init_free_nid_cache()
3277 if (!nm_i->free_nid_count) in init_free_nid_cache()
3307 struct f2fs_nm_info *nm_i = NM_I(sbi); in f2fs_destroy_node_manager() local
3314 if (!nm_i) in f2fs_destroy_node_manager()
3318 spin_lock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3319 list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { in f2fs_destroy_node_manager()
3321 spin_unlock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3323 spin_lock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3325 f2fs_bug_on(sbi, nm_i->nid_cnt[FREE_NID]); in f2fs_destroy_node_manager()
3326 f2fs_bug_on(sbi, nm_i->nid_cnt[PREALLOC_NID]); in f2fs_destroy_node_manager()
3327 f2fs_bug_on(sbi, !list_empty(&nm_i->free_nid_list)); in f2fs_destroy_node_manager()
3328 spin_unlock(&nm_i->nid_list_lock); in f2fs_destroy_node_manager()
3331 down_write(&nm_i->nat_tree_lock); in f2fs_destroy_node_manager()
3332 while ((found = __gang_lookup_nat_cache(nm_i, in f2fs_destroy_node_manager()
3338 spin_lock(&nm_i->nat_list_lock); in f2fs_destroy_node_manager()
3340 spin_unlock(&nm_i->nat_list_lock); in f2fs_destroy_node_manager()
3342 __del_from_nat_cache(nm_i, natvec[idx]); in f2fs_destroy_node_manager()
3345 f2fs_bug_on(sbi, nm_i->nat_cnt[TOTAL_NAT]); in f2fs_destroy_node_manager()
3349 while ((found = __gang_lookup_nat_set(nm_i, in f2fs_destroy_node_manager()
3357 radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set); in f2fs_destroy_node_manager()
3361 up_write(&nm_i->nat_tree_lock); in f2fs_destroy_node_manager()
3363 kvfree(nm_i->nat_block_bitmap); in f2fs_destroy_node_manager()
3364 if (nm_i->free_nid_bitmap) { in f2fs_destroy_node_manager()
3367 for (i = 0; i < nm_i->nat_blocks; i++) in f2fs_destroy_node_manager()
3368 kvfree(nm_i->free_nid_bitmap[i]); in f2fs_destroy_node_manager()
3369 kvfree(nm_i->free_nid_bitmap); in f2fs_destroy_node_manager()
3371 kvfree(nm_i->free_nid_count); in f2fs_destroy_node_manager()
3373 kvfree(nm_i->nat_bitmap); in f2fs_destroy_node_manager()
3374 kvfree(nm_i->nat_bits); in f2fs_destroy_node_manager()
3376 kvfree(nm_i->nat_bitmap_mir); in f2fs_destroy_node_manager()
3379 kfree(nm_i); in f2fs_destroy_node_manager()