10a8165d7SJaegeuk Kim /* 2e05df3b1SJaegeuk Kim * fs/f2fs/node.c 3e05df3b1SJaegeuk Kim * 4e05df3b1SJaegeuk Kim * Copyright (c) 2012 Samsung Electronics Co., Ltd. 5e05df3b1SJaegeuk Kim * http://www.samsung.com/ 6e05df3b1SJaegeuk Kim * 7e05df3b1SJaegeuk Kim * This program is free software; you can redistribute it and/or modify 8e05df3b1SJaegeuk Kim * it under the terms of the GNU General Public License version 2 as 9e05df3b1SJaegeuk Kim * published by the Free Software Foundation. 10e05df3b1SJaegeuk Kim */ 11e05df3b1SJaegeuk Kim #include <linux/fs.h> 12e05df3b1SJaegeuk Kim #include <linux/f2fs_fs.h> 13e05df3b1SJaegeuk Kim #include <linux/mpage.h> 14e05df3b1SJaegeuk Kim #include <linux/backing-dev.h> 15e05df3b1SJaegeuk Kim #include <linux/blkdev.h> 16e05df3b1SJaegeuk Kim #include <linux/pagevec.h> 17e05df3b1SJaegeuk Kim #include <linux/swap.h> 18e05df3b1SJaegeuk Kim 19e05df3b1SJaegeuk Kim #include "f2fs.h" 20e05df3b1SJaegeuk Kim #include "node.h" 21e05df3b1SJaegeuk Kim #include "segment.h" 22e05df3b1SJaegeuk Kim 23e05df3b1SJaegeuk Kim static struct kmem_cache *nat_entry_slab; 24e05df3b1SJaegeuk Kim static struct kmem_cache *free_nid_slab; 25e05df3b1SJaegeuk Kim 26e05df3b1SJaegeuk Kim static void clear_node_page_dirty(struct page *page) 27e05df3b1SJaegeuk Kim { 28e05df3b1SJaegeuk Kim struct address_space *mapping = page->mapping; 29e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 30e05df3b1SJaegeuk Kim unsigned int long flags; 31e05df3b1SJaegeuk Kim 32e05df3b1SJaegeuk Kim if (PageDirty(page)) { 33e05df3b1SJaegeuk Kim spin_lock_irqsave(&mapping->tree_lock, flags); 34e05df3b1SJaegeuk Kim radix_tree_tag_clear(&mapping->page_tree, 35e05df3b1SJaegeuk Kim page_index(page), 36e05df3b1SJaegeuk Kim PAGECACHE_TAG_DIRTY); 37e05df3b1SJaegeuk Kim spin_unlock_irqrestore(&mapping->tree_lock, flags); 38e05df3b1SJaegeuk Kim 39e05df3b1SJaegeuk Kim clear_page_dirty_for_io(page); 40e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 41e05df3b1SJaegeuk Kim } 42e05df3b1SJaegeuk Kim ClearPageUptodate(page); 43e05df3b1SJaegeuk Kim } 44e05df3b1SJaegeuk Kim 45e05df3b1SJaegeuk Kim static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid) 46e05df3b1SJaegeuk Kim { 47e05df3b1SJaegeuk Kim pgoff_t index = current_nat_addr(sbi, nid); 48e05df3b1SJaegeuk Kim return get_meta_page(sbi, index); 49e05df3b1SJaegeuk Kim } 50e05df3b1SJaegeuk Kim 51e05df3b1SJaegeuk Kim static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid) 52e05df3b1SJaegeuk Kim { 53e05df3b1SJaegeuk Kim struct page *src_page; 54e05df3b1SJaegeuk Kim struct page *dst_page; 55e05df3b1SJaegeuk Kim pgoff_t src_off; 56e05df3b1SJaegeuk Kim pgoff_t dst_off; 57e05df3b1SJaegeuk Kim void *src_addr; 58e05df3b1SJaegeuk Kim void *dst_addr; 59e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 60e05df3b1SJaegeuk Kim 61e05df3b1SJaegeuk Kim src_off = current_nat_addr(sbi, nid); 62e05df3b1SJaegeuk Kim dst_off = next_nat_addr(sbi, src_off); 63e05df3b1SJaegeuk Kim 64e05df3b1SJaegeuk Kim /* get current nat block page with lock */ 65e05df3b1SJaegeuk Kim src_page = get_meta_page(sbi, src_off); 66e05df3b1SJaegeuk Kim 67e05df3b1SJaegeuk Kim /* Dirty src_page means that it is already the new target NAT page. */ 68e05df3b1SJaegeuk Kim if (PageDirty(src_page)) 69e05df3b1SJaegeuk Kim return src_page; 70e05df3b1SJaegeuk Kim 71e05df3b1SJaegeuk Kim dst_page = grab_meta_page(sbi, dst_off); 72e05df3b1SJaegeuk Kim 73e05df3b1SJaegeuk Kim src_addr = page_address(src_page); 74e05df3b1SJaegeuk Kim dst_addr = page_address(dst_page); 75e05df3b1SJaegeuk Kim memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE); 76e05df3b1SJaegeuk Kim set_page_dirty(dst_page); 77e05df3b1SJaegeuk Kim f2fs_put_page(src_page, 1); 78e05df3b1SJaegeuk Kim 79e05df3b1SJaegeuk Kim set_to_next_nat(nm_i, nid); 80e05df3b1SJaegeuk Kim 81e05df3b1SJaegeuk Kim return dst_page; 82e05df3b1SJaegeuk Kim } 83e05df3b1SJaegeuk Kim 840a8165d7SJaegeuk Kim /* 85e05df3b1SJaegeuk Kim * Readahead NAT pages 86e05df3b1SJaegeuk Kim */ 87e05df3b1SJaegeuk Kim static void ra_nat_pages(struct f2fs_sb_info *sbi, int nid) 88e05df3b1SJaegeuk Kim { 89e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->meta_inode->i_mapping; 90e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 91e05df3b1SJaegeuk Kim struct page *page; 92e05df3b1SJaegeuk Kim pgoff_t index; 93e05df3b1SJaegeuk Kim int i; 94e05df3b1SJaegeuk Kim 95e05df3b1SJaegeuk Kim for (i = 0; i < FREE_NID_PAGES; i++, nid += NAT_ENTRY_PER_BLOCK) { 96e05df3b1SJaegeuk Kim if (nid >= nm_i->max_nid) 97e05df3b1SJaegeuk Kim nid = 0; 98e05df3b1SJaegeuk Kim index = current_nat_addr(sbi, nid); 99e05df3b1SJaegeuk Kim 100e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, index); 101e05df3b1SJaegeuk Kim if (!page) 102e05df3b1SJaegeuk Kim continue; 103e05df3b1SJaegeuk Kim if (f2fs_readpage(sbi, page, index, READ)) { 104e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 105e05df3b1SJaegeuk Kim continue; 106e05df3b1SJaegeuk Kim } 107369a708cSJaegeuk Kim f2fs_put_page(page, 0); 108e05df3b1SJaegeuk Kim } 109e05df3b1SJaegeuk Kim } 110e05df3b1SJaegeuk Kim 111e05df3b1SJaegeuk Kim static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) 112e05df3b1SJaegeuk Kim { 113e05df3b1SJaegeuk Kim return radix_tree_lookup(&nm_i->nat_root, n); 114e05df3b1SJaegeuk Kim } 115e05df3b1SJaegeuk Kim 116e05df3b1SJaegeuk Kim static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, 117e05df3b1SJaegeuk Kim nid_t start, unsigned int nr, struct nat_entry **ep) 118e05df3b1SJaegeuk Kim { 119e05df3b1SJaegeuk Kim return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); 120e05df3b1SJaegeuk Kim } 121e05df3b1SJaegeuk Kim 122e05df3b1SJaegeuk Kim static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) 123e05df3b1SJaegeuk Kim { 124e05df3b1SJaegeuk Kim list_del(&e->list); 125e05df3b1SJaegeuk Kim radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); 126e05df3b1SJaegeuk Kim nm_i->nat_cnt--; 127e05df3b1SJaegeuk Kim kmem_cache_free(nat_entry_slab, e); 128e05df3b1SJaegeuk Kim } 129e05df3b1SJaegeuk Kim 130e05df3b1SJaegeuk Kim int is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid) 131e05df3b1SJaegeuk Kim { 132e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 133e05df3b1SJaegeuk Kim struct nat_entry *e; 134e05df3b1SJaegeuk Kim int is_cp = 1; 135e05df3b1SJaegeuk Kim 136e05df3b1SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 137e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 138e05df3b1SJaegeuk Kim if (e && !e->checkpointed) 139e05df3b1SJaegeuk Kim is_cp = 0; 140e05df3b1SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 141e05df3b1SJaegeuk Kim return is_cp; 142e05df3b1SJaegeuk Kim } 143e05df3b1SJaegeuk Kim 144e05df3b1SJaegeuk Kim static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid) 145e05df3b1SJaegeuk Kim { 146e05df3b1SJaegeuk Kim struct nat_entry *new; 147e05df3b1SJaegeuk Kim 148e05df3b1SJaegeuk Kim new = kmem_cache_alloc(nat_entry_slab, GFP_ATOMIC); 149e05df3b1SJaegeuk Kim if (!new) 150e05df3b1SJaegeuk Kim return NULL; 151e05df3b1SJaegeuk Kim if (radix_tree_insert(&nm_i->nat_root, nid, new)) { 152e05df3b1SJaegeuk Kim kmem_cache_free(nat_entry_slab, new); 153e05df3b1SJaegeuk Kim return NULL; 154e05df3b1SJaegeuk Kim } 155e05df3b1SJaegeuk Kim memset(new, 0, sizeof(struct nat_entry)); 156e05df3b1SJaegeuk Kim nat_set_nid(new, nid); 157e05df3b1SJaegeuk Kim list_add_tail(&new->list, &nm_i->nat_entries); 158e05df3b1SJaegeuk Kim nm_i->nat_cnt++; 159e05df3b1SJaegeuk Kim return new; 160e05df3b1SJaegeuk Kim } 161e05df3b1SJaegeuk Kim 162e05df3b1SJaegeuk Kim static void cache_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid, 163e05df3b1SJaegeuk Kim struct f2fs_nat_entry *ne) 164e05df3b1SJaegeuk Kim { 165e05df3b1SJaegeuk Kim struct nat_entry *e; 166e05df3b1SJaegeuk Kim retry: 167e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 168e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 169e05df3b1SJaegeuk Kim if (!e) { 170e05df3b1SJaegeuk Kim e = grab_nat_entry(nm_i, nid); 171e05df3b1SJaegeuk Kim if (!e) { 172e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 173e05df3b1SJaegeuk Kim goto retry; 174e05df3b1SJaegeuk Kim } 175e05df3b1SJaegeuk Kim nat_set_blkaddr(e, le32_to_cpu(ne->block_addr)); 176e05df3b1SJaegeuk Kim nat_set_ino(e, le32_to_cpu(ne->ino)); 177e05df3b1SJaegeuk Kim nat_set_version(e, ne->version); 178e05df3b1SJaegeuk Kim e->checkpointed = true; 179e05df3b1SJaegeuk Kim } 180e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 181e05df3b1SJaegeuk Kim } 182e05df3b1SJaegeuk Kim 183e05df3b1SJaegeuk Kim static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni, 184e05df3b1SJaegeuk Kim block_t new_blkaddr) 185e05df3b1SJaegeuk Kim { 186e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 187e05df3b1SJaegeuk Kim struct nat_entry *e; 188e05df3b1SJaegeuk Kim retry: 189e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 190e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, ni->nid); 191e05df3b1SJaegeuk Kim if (!e) { 192e05df3b1SJaegeuk Kim e = grab_nat_entry(nm_i, ni->nid); 193e05df3b1SJaegeuk Kim if (!e) { 194e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 195e05df3b1SJaegeuk Kim goto retry; 196e05df3b1SJaegeuk Kim } 197e05df3b1SJaegeuk Kim e->ni = *ni; 198e05df3b1SJaegeuk Kim e->checkpointed = true; 199e05df3b1SJaegeuk Kim BUG_ON(ni->blk_addr == NEW_ADDR); 200e05df3b1SJaegeuk Kim } else if (new_blkaddr == NEW_ADDR) { 201e05df3b1SJaegeuk Kim /* 202e05df3b1SJaegeuk Kim * when nid is reallocated, 203e05df3b1SJaegeuk Kim * previous nat entry can be remained in nat cache. 204e05df3b1SJaegeuk Kim * So, reinitialize it with new information. 205e05df3b1SJaegeuk Kim */ 206e05df3b1SJaegeuk Kim e->ni = *ni; 207e05df3b1SJaegeuk Kim BUG_ON(ni->blk_addr != NULL_ADDR); 208e05df3b1SJaegeuk Kim } 209e05df3b1SJaegeuk Kim 210e05df3b1SJaegeuk Kim if (new_blkaddr == NEW_ADDR) 211e05df3b1SJaegeuk Kim e->checkpointed = false; 212e05df3b1SJaegeuk Kim 213e05df3b1SJaegeuk Kim /* sanity check */ 214e05df3b1SJaegeuk Kim BUG_ON(nat_get_blkaddr(e) != ni->blk_addr); 215e05df3b1SJaegeuk Kim BUG_ON(nat_get_blkaddr(e) == NULL_ADDR && 216e05df3b1SJaegeuk Kim new_blkaddr == NULL_ADDR); 217e05df3b1SJaegeuk Kim BUG_ON(nat_get_blkaddr(e) == NEW_ADDR && 218e05df3b1SJaegeuk Kim new_blkaddr == NEW_ADDR); 219e05df3b1SJaegeuk Kim BUG_ON(nat_get_blkaddr(e) != NEW_ADDR && 220e05df3b1SJaegeuk Kim nat_get_blkaddr(e) != NULL_ADDR && 221e05df3b1SJaegeuk Kim new_blkaddr == NEW_ADDR); 222e05df3b1SJaegeuk Kim 223e05df3b1SJaegeuk Kim /* increament version no as node is removed */ 224e05df3b1SJaegeuk Kim if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) { 225e05df3b1SJaegeuk Kim unsigned char version = nat_get_version(e); 226e05df3b1SJaegeuk Kim nat_set_version(e, inc_node_version(version)); 227e05df3b1SJaegeuk Kim } 228e05df3b1SJaegeuk Kim 229e05df3b1SJaegeuk Kim /* change address */ 230e05df3b1SJaegeuk Kim nat_set_blkaddr(e, new_blkaddr); 231e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, e); 232e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 233e05df3b1SJaegeuk Kim } 234e05df3b1SJaegeuk Kim 235e05df3b1SJaegeuk Kim static int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink) 236e05df3b1SJaegeuk Kim { 237e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 238e05df3b1SJaegeuk Kim 239e05df3b1SJaegeuk Kim if (nm_i->nat_cnt < 2 * NM_WOUT_THRESHOLD) 240e05df3b1SJaegeuk Kim return 0; 241e05df3b1SJaegeuk Kim 242e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 243e05df3b1SJaegeuk Kim while (nr_shrink && !list_empty(&nm_i->nat_entries)) { 244e05df3b1SJaegeuk Kim struct nat_entry *ne; 245e05df3b1SJaegeuk Kim ne = list_first_entry(&nm_i->nat_entries, 246e05df3b1SJaegeuk Kim struct nat_entry, list); 247e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, ne); 248e05df3b1SJaegeuk Kim nr_shrink--; 249e05df3b1SJaegeuk Kim } 250e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 251e05df3b1SJaegeuk Kim return nr_shrink; 252e05df3b1SJaegeuk Kim } 253e05df3b1SJaegeuk Kim 2540a8165d7SJaegeuk Kim /* 255e05df3b1SJaegeuk Kim * This function returns always success 256e05df3b1SJaegeuk Kim */ 257e05df3b1SJaegeuk Kim void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni) 258e05df3b1SJaegeuk Kim { 259e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 260e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 261e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 262e05df3b1SJaegeuk Kim nid_t start_nid = START_NID(nid); 263e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk; 264e05df3b1SJaegeuk Kim struct page *page = NULL; 265e05df3b1SJaegeuk Kim struct f2fs_nat_entry ne; 266e05df3b1SJaegeuk Kim struct nat_entry *e; 267e05df3b1SJaegeuk Kim int i; 268e05df3b1SJaegeuk Kim 269be4124f8SNamjae Jeon memset(&ne, 0, sizeof(struct f2fs_nat_entry)); 270e05df3b1SJaegeuk Kim ni->nid = nid; 271e05df3b1SJaegeuk Kim 272e05df3b1SJaegeuk Kim /* Check nat cache */ 273e05df3b1SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 274e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 275e05df3b1SJaegeuk Kim if (e) { 276e05df3b1SJaegeuk Kim ni->ino = nat_get_ino(e); 277e05df3b1SJaegeuk Kim ni->blk_addr = nat_get_blkaddr(e); 278e05df3b1SJaegeuk Kim ni->version = nat_get_version(e); 279e05df3b1SJaegeuk Kim } 280e05df3b1SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 281e05df3b1SJaegeuk Kim if (e) 282e05df3b1SJaegeuk Kim return; 283e05df3b1SJaegeuk Kim 284e05df3b1SJaegeuk Kim /* Check current segment summary */ 285e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 286e05df3b1SJaegeuk Kim i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0); 287e05df3b1SJaegeuk Kim if (i >= 0) { 288e05df3b1SJaegeuk Kim ne = nat_in_journal(sum, i); 289e05df3b1SJaegeuk Kim node_info_from_raw_nat(ni, &ne); 290e05df3b1SJaegeuk Kim } 291e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 292e05df3b1SJaegeuk Kim if (i >= 0) 293e05df3b1SJaegeuk Kim goto cache; 294e05df3b1SJaegeuk Kim 295e05df3b1SJaegeuk Kim /* Fill node_info from nat page */ 296e05df3b1SJaegeuk Kim page = get_current_nat_page(sbi, start_nid); 297e05df3b1SJaegeuk Kim nat_blk = (struct f2fs_nat_block *)page_address(page); 298e05df3b1SJaegeuk Kim ne = nat_blk->entries[nid - start_nid]; 299e05df3b1SJaegeuk Kim node_info_from_raw_nat(ni, &ne); 300e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 301e05df3b1SJaegeuk Kim cache: 302e05df3b1SJaegeuk Kim /* cache nat entry */ 303e05df3b1SJaegeuk Kim cache_nat_entry(NM_I(sbi), nid, &ne); 304e05df3b1SJaegeuk Kim } 305e05df3b1SJaegeuk Kim 3060a8165d7SJaegeuk Kim /* 307e05df3b1SJaegeuk Kim * The maximum depth is four. 308e05df3b1SJaegeuk Kim * Offset[0] will have raw inode offset. 309e05df3b1SJaegeuk Kim */ 310e05df3b1SJaegeuk Kim static int get_node_path(long block, int offset[4], unsigned int noffset[4]) 311e05df3b1SJaegeuk Kim { 312e05df3b1SJaegeuk Kim const long direct_index = ADDRS_PER_INODE; 313e05df3b1SJaegeuk Kim const long direct_blks = ADDRS_PER_BLOCK; 314e05df3b1SJaegeuk Kim const long dptrs_per_blk = NIDS_PER_BLOCK; 315e05df3b1SJaegeuk Kim const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK; 316e05df3b1SJaegeuk Kim const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; 317e05df3b1SJaegeuk Kim int n = 0; 318e05df3b1SJaegeuk Kim int level = 0; 319e05df3b1SJaegeuk Kim 320e05df3b1SJaegeuk Kim noffset[0] = 0; 321e05df3b1SJaegeuk Kim 322e05df3b1SJaegeuk Kim if (block < direct_index) { 323e05df3b1SJaegeuk Kim offset[n++] = block; 324e05df3b1SJaegeuk Kim level = 0; 325e05df3b1SJaegeuk Kim goto got; 326e05df3b1SJaegeuk Kim } 327e05df3b1SJaegeuk Kim block -= direct_index; 328e05df3b1SJaegeuk Kim if (block < direct_blks) { 329e05df3b1SJaegeuk Kim offset[n++] = NODE_DIR1_BLOCK; 330e05df3b1SJaegeuk Kim noffset[n] = 1; 331e05df3b1SJaegeuk Kim offset[n++] = block; 332e05df3b1SJaegeuk Kim level = 1; 333e05df3b1SJaegeuk Kim goto got; 334e05df3b1SJaegeuk Kim } 335e05df3b1SJaegeuk Kim block -= direct_blks; 336e05df3b1SJaegeuk Kim if (block < direct_blks) { 337e05df3b1SJaegeuk Kim offset[n++] = NODE_DIR2_BLOCK; 338e05df3b1SJaegeuk Kim noffset[n] = 2; 339e05df3b1SJaegeuk Kim offset[n++] = block; 340e05df3b1SJaegeuk Kim level = 1; 341e05df3b1SJaegeuk Kim goto got; 342e05df3b1SJaegeuk Kim } 343e05df3b1SJaegeuk Kim block -= direct_blks; 344e05df3b1SJaegeuk Kim if (block < indirect_blks) { 345e05df3b1SJaegeuk Kim offset[n++] = NODE_IND1_BLOCK; 346e05df3b1SJaegeuk Kim noffset[n] = 3; 347e05df3b1SJaegeuk Kim offset[n++] = block / direct_blks; 348e05df3b1SJaegeuk Kim noffset[n] = 4 + offset[n - 1]; 349e05df3b1SJaegeuk Kim offset[n++] = block % direct_blks; 350e05df3b1SJaegeuk Kim level = 2; 351e05df3b1SJaegeuk Kim goto got; 352e05df3b1SJaegeuk Kim } 353e05df3b1SJaegeuk Kim block -= indirect_blks; 354e05df3b1SJaegeuk Kim if (block < indirect_blks) { 355e05df3b1SJaegeuk Kim offset[n++] = NODE_IND2_BLOCK; 356e05df3b1SJaegeuk Kim noffset[n] = 4 + dptrs_per_blk; 357e05df3b1SJaegeuk Kim offset[n++] = block / direct_blks; 358e05df3b1SJaegeuk Kim noffset[n] = 5 + dptrs_per_blk + offset[n - 1]; 359e05df3b1SJaegeuk Kim offset[n++] = block % direct_blks; 360e05df3b1SJaegeuk Kim level = 2; 361e05df3b1SJaegeuk Kim goto got; 362e05df3b1SJaegeuk Kim } 363e05df3b1SJaegeuk Kim block -= indirect_blks; 364e05df3b1SJaegeuk Kim if (block < dindirect_blks) { 365e05df3b1SJaegeuk Kim offset[n++] = NODE_DIND_BLOCK; 366e05df3b1SJaegeuk Kim noffset[n] = 5 + (dptrs_per_blk * 2); 367e05df3b1SJaegeuk Kim offset[n++] = block / indirect_blks; 368e05df3b1SJaegeuk Kim noffset[n] = 6 + (dptrs_per_blk * 2) + 369e05df3b1SJaegeuk Kim offset[n - 1] * (dptrs_per_blk + 1); 370e05df3b1SJaegeuk Kim offset[n++] = (block / direct_blks) % dptrs_per_blk; 371e05df3b1SJaegeuk Kim noffset[n] = 7 + (dptrs_per_blk * 2) + 372e05df3b1SJaegeuk Kim offset[n - 2] * (dptrs_per_blk + 1) + 373e05df3b1SJaegeuk Kim offset[n - 1]; 374e05df3b1SJaegeuk Kim offset[n++] = block % direct_blks; 375e05df3b1SJaegeuk Kim level = 3; 376e05df3b1SJaegeuk Kim goto got; 377e05df3b1SJaegeuk Kim } else { 378e05df3b1SJaegeuk Kim BUG(); 379e05df3b1SJaegeuk Kim } 380e05df3b1SJaegeuk Kim got: 381e05df3b1SJaegeuk Kim return level; 382e05df3b1SJaegeuk Kim } 383e05df3b1SJaegeuk Kim 384e05df3b1SJaegeuk Kim /* 385e05df3b1SJaegeuk Kim * Caller should call f2fs_put_dnode(dn). 386e05df3b1SJaegeuk Kim */ 387e05df3b1SJaegeuk Kim int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int ro) 388e05df3b1SJaegeuk Kim { 389e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 390e05df3b1SJaegeuk Kim struct page *npage[4]; 391e05df3b1SJaegeuk Kim struct page *parent; 392e05df3b1SJaegeuk Kim int offset[4]; 393e05df3b1SJaegeuk Kim unsigned int noffset[4]; 394e05df3b1SJaegeuk Kim nid_t nids[4]; 395e05df3b1SJaegeuk Kim int level, i; 396e05df3b1SJaegeuk Kim int err = 0; 397e05df3b1SJaegeuk Kim 398e05df3b1SJaegeuk Kim level = get_node_path(index, offset, noffset); 399e05df3b1SJaegeuk Kim 400e05df3b1SJaegeuk Kim nids[0] = dn->inode->i_ino; 401e05df3b1SJaegeuk Kim npage[0] = get_node_page(sbi, nids[0]); 402e05df3b1SJaegeuk Kim if (IS_ERR(npage[0])) 403e05df3b1SJaegeuk Kim return PTR_ERR(npage[0]); 404e05df3b1SJaegeuk Kim 405e05df3b1SJaegeuk Kim parent = npage[0]; 406e05df3b1SJaegeuk Kim nids[1] = get_nid(parent, offset[0], true); 407e05df3b1SJaegeuk Kim dn->inode_page = npage[0]; 408e05df3b1SJaegeuk Kim dn->inode_page_locked = true; 409e05df3b1SJaegeuk Kim 410e05df3b1SJaegeuk Kim /* get indirect or direct nodes */ 411e05df3b1SJaegeuk Kim for (i = 1; i <= level; i++) { 412e05df3b1SJaegeuk Kim bool done = false; 413e05df3b1SJaegeuk Kim 414e05df3b1SJaegeuk Kim if (!nids[i] && !ro) { 415e05df3b1SJaegeuk Kim mutex_lock_op(sbi, NODE_NEW); 416e05df3b1SJaegeuk Kim 417e05df3b1SJaegeuk Kim /* alloc new node */ 418e05df3b1SJaegeuk Kim if (!alloc_nid(sbi, &(nids[i]))) { 419e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_NEW); 420e05df3b1SJaegeuk Kim err = -ENOSPC; 421e05df3b1SJaegeuk Kim goto release_pages; 422e05df3b1SJaegeuk Kim } 423e05df3b1SJaegeuk Kim 424e05df3b1SJaegeuk Kim dn->nid = nids[i]; 425e05df3b1SJaegeuk Kim npage[i] = new_node_page(dn, noffset[i]); 426e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 427e05df3b1SJaegeuk Kim alloc_nid_failed(sbi, nids[i]); 428e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_NEW); 429e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 430e05df3b1SJaegeuk Kim goto release_pages; 431e05df3b1SJaegeuk Kim } 432e05df3b1SJaegeuk Kim 433e05df3b1SJaegeuk Kim set_nid(parent, offset[i - 1], nids[i], i == 1); 434e05df3b1SJaegeuk Kim alloc_nid_done(sbi, nids[i]); 435e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_NEW); 436e05df3b1SJaegeuk Kim done = true; 437e05df3b1SJaegeuk Kim } else if (ro && i == level && level > 1) { 438e05df3b1SJaegeuk Kim npage[i] = get_node_page_ra(parent, offset[i - 1]); 439e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 440e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 441e05df3b1SJaegeuk Kim goto release_pages; 442e05df3b1SJaegeuk Kim } 443e05df3b1SJaegeuk Kim done = true; 444e05df3b1SJaegeuk Kim } 445e05df3b1SJaegeuk Kim if (i == 1) { 446e05df3b1SJaegeuk Kim dn->inode_page_locked = false; 447e05df3b1SJaegeuk Kim unlock_page(parent); 448e05df3b1SJaegeuk Kim } else { 449e05df3b1SJaegeuk Kim f2fs_put_page(parent, 1); 450e05df3b1SJaegeuk Kim } 451e05df3b1SJaegeuk Kim 452e05df3b1SJaegeuk Kim if (!done) { 453e05df3b1SJaegeuk Kim npage[i] = get_node_page(sbi, nids[i]); 454e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 455e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 456e05df3b1SJaegeuk Kim f2fs_put_page(npage[0], 0); 457e05df3b1SJaegeuk Kim goto release_out; 458e05df3b1SJaegeuk Kim } 459e05df3b1SJaegeuk Kim } 460e05df3b1SJaegeuk Kim if (i < level) { 461e05df3b1SJaegeuk Kim parent = npage[i]; 462e05df3b1SJaegeuk Kim nids[i + 1] = get_nid(parent, offset[i], false); 463e05df3b1SJaegeuk Kim } 464e05df3b1SJaegeuk Kim } 465e05df3b1SJaegeuk Kim dn->nid = nids[level]; 466e05df3b1SJaegeuk Kim dn->ofs_in_node = offset[level]; 467e05df3b1SJaegeuk Kim dn->node_page = npage[level]; 468e05df3b1SJaegeuk Kim dn->data_blkaddr = datablock_addr(dn->node_page, dn->ofs_in_node); 469e05df3b1SJaegeuk Kim return 0; 470e05df3b1SJaegeuk Kim 471e05df3b1SJaegeuk Kim release_pages: 472e05df3b1SJaegeuk Kim f2fs_put_page(parent, 1); 473e05df3b1SJaegeuk Kim if (i > 1) 474e05df3b1SJaegeuk Kim f2fs_put_page(npage[0], 0); 475e05df3b1SJaegeuk Kim release_out: 476e05df3b1SJaegeuk Kim dn->inode_page = NULL; 477e05df3b1SJaegeuk Kim dn->node_page = NULL; 478e05df3b1SJaegeuk Kim return err; 479e05df3b1SJaegeuk Kim } 480e05df3b1SJaegeuk Kim 481e05df3b1SJaegeuk Kim static void truncate_node(struct dnode_of_data *dn) 482e05df3b1SJaegeuk Kim { 483e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 484e05df3b1SJaegeuk Kim struct node_info ni; 485e05df3b1SJaegeuk Kim 486e05df3b1SJaegeuk Kim get_node_info(sbi, dn->nid, &ni); 48771e9fec5SJaegeuk Kim if (dn->inode->i_blocks == 0) { 48871e9fec5SJaegeuk Kim BUG_ON(ni.blk_addr != NULL_ADDR); 48971e9fec5SJaegeuk Kim goto invalidate; 49071e9fec5SJaegeuk Kim } 491e05df3b1SJaegeuk Kim BUG_ON(ni.blk_addr == NULL_ADDR); 492e05df3b1SJaegeuk Kim 493e05df3b1SJaegeuk Kim /* Deallocate node address */ 49471e9fec5SJaegeuk Kim invalidate_blocks(sbi, ni.blk_addr); 495e05df3b1SJaegeuk Kim dec_valid_node_count(sbi, dn->inode, 1); 496e05df3b1SJaegeuk Kim set_node_addr(sbi, &ni, NULL_ADDR); 497e05df3b1SJaegeuk Kim 498e05df3b1SJaegeuk Kim if (dn->nid == dn->inode->i_ino) { 499e05df3b1SJaegeuk Kim remove_orphan_inode(sbi, dn->nid); 500e05df3b1SJaegeuk Kim dec_valid_inode_count(sbi); 501e05df3b1SJaegeuk Kim } else { 502e05df3b1SJaegeuk Kim sync_inode_page(dn); 503e05df3b1SJaegeuk Kim } 50471e9fec5SJaegeuk Kim invalidate: 505e05df3b1SJaegeuk Kim clear_node_page_dirty(dn->node_page); 506e05df3b1SJaegeuk Kim F2FS_SET_SB_DIRT(sbi); 507e05df3b1SJaegeuk Kim 508e05df3b1SJaegeuk Kim f2fs_put_page(dn->node_page, 1); 509e05df3b1SJaegeuk Kim dn->node_page = NULL; 510e05df3b1SJaegeuk Kim } 511e05df3b1SJaegeuk Kim 512e05df3b1SJaegeuk Kim static int truncate_dnode(struct dnode_of_data *dn) 513e05df3b1SJaegeuk Kim { 514e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 515e05df3b1SJaegeuk Kim struct page *page; 516e05df3b1SJaegeuk Kim 517e05df3b1SJaegeuk Kim if (dn->nid == 0) 518e05df3b1SJaegeuk Kim return 1; 519e05df3b1SJaegeuk Kim 520e05df3b1SJaegeuk Kim /* get direct node */ 521e05df3b1SJaegeuk Kim page = get_node_page(sbi, dn->nid); 522e05df3b1SJaegeuk Kim if (IS_ERR(page) && PTR_ERR(page) == -ENOENT) 523e05df3b1SJaegeuk Kim return 1; 524e05df3b1SJaegeuk Kim else if (IS_ERR(page)) 525e05df3b1SJaegeuk Kim return PTR_ERR(page); 526e05df3b1SJaegeuk Kim 527e05df3b1SJaegeuk Kim /* Make dnode_of_data for parameter */ 528e05df3b1SJaegeuk Kim dn->node_page = page; 529e05df3b1SJaegeuk Kim dn->ofs_in_node = 0; 530e05df3b1SJaegeuk Kim truncate_data_blocks(dn); 531e05df3b1SJaegeuk Kim truncate_node(dn); 532e05df3b1SJaegeuk Kim return 1; 533e05df3b1SJaegeuk Kim } 534e05df3b1SJaegeuk Kim 535e05df3b1SJaegeuk Kim static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs, 536e05df3b1SJaegeuk Kim int ofs, int depth) 537e05df3b1SJaegeuk Kim { 538e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 539e05df3b1SJaegeuk Kim struct dnode_of_data rdn = *dn; 540e05df3b1SJaegeuk Kim struct page *page; 541e05df3b1SJaegeuk Kim struct f2fs_node *rn; 542e05df3b1SJaegeuk Kim nid_t child_nid; 543e05df3b1SJaegeuk Kim unsigned int child_nofs; 544e05df3b1SJaegeuk Kim int freed = 0; 545e05df3b1SJaegeuk Kim int i, ret; 546e05df3b1SJaegeuk Kim 547e05df3b1SJaegeuk Kim if (dn->nid == 0) 548e05df3b1SJaegeuk Kim return NIDS_PER_BLOCK + 1; 549e05df3b1SJaegeuk Kim 550e05df3b1SJaegeuk Kim page = get_node_page(sbi, dn->nid); 551e05df3b1SJaegeuk Kim if (IS_ERR(page)) 552e05df3b1SJaegeuk Kim return PTR_ERR(page); 553e05df3b1SJaegeuk Kim 554e05df3b1SJaegeuk Kim rn = (struct f2fs_node *)page_address(page); 555e05df3b1SJaegeuk Kim if (depth < 3) { 556e05df3b1SJaegeuk Kim for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { 557e05df3b1SJaegeuk Kim child_nid = le32_to_cpu(rn->in.nid[i]); 558e05df3b1SJaegeuk Kim if (child_nid == 0) 559e05df3b1SJaegeuk Kim continue; 560e05df3b1SJaegeuk Kim rdn.nid = child_nid; 561e05df3b1SJaegeuk Kim ret = truncate_dnode(&rdn); 562e05df3b1SJaegeuk Kim if (ret < 0) 563e05df3b1SJaegeuk Kim goto out_err; 564e05df3b1SJaegeuk Kim set_nid(page, i, 0, false); 565e05df3b1SJaegeuk Kim } 566e05df3b1SJaegeuk Kim } else { 567e05df3b1SJaegeuk Kim child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; 568e05df3b1SJaegeuk Kim for (i = ofs; i < NIDS_PER_BLOCK; i++) { 569e05df3b1SJaegeuk Kim child_nid = le32_to_cpu(rn->in.nid[i]); 570e05df3b1SJaegeuk Kim if (child_nid == 0) { 571e05df3b1SJaegeuk Kim child_nofs += NIDS_PER_BLOCK + 1; 572e05df3b1SJaegeuk Kim continue; 573e05df3b1SJaegeuk Kim } 574e05df3b1SJaegeuk Kim rdn.nid = child_nid; 575e05df3b1SJaegeuk Kim ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1); 576e05df3b1SJaegeuk Kim if (ret == (NIDS_PER_BLOCK + 1)) { 577e05df3b1SJaegeuk Kim set_nid(page, i, 0, false); 578e05df3b1SJaegeuk Kim child_nofs += ret; 579e05df3b1SJaegeuk Kim } else if (ret < 0 && ret != -ENOENT) { 580e05df3b1SJaegeuk Kim goto out_err; 581e05df3b1SJaegeuk Kim } 582e05df3b1SJaegeuk Kim } 583e05df3b1SJaegeuk Kim freed = child_nofs; 584e05df3b1SJaegeuk Kim } 585e05df3b1SJaegeuk Kim 586e05df3b1SJaegeuk Kim if (!ofs) { 587e05df3b1SJaegeuk Kim /* remove current indirect node */ 588e05df3b1SJaegeuk Kim dn->node_page = page; 589e05df3b1SJaegeuk Kim truncate_node(dn); 590e05df3b1SJaegeuk Kim freed++; 591e05df3b1SJaegeuk Kim } else { 592e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 593e05df3b1SJaegeuk Kim } 594e05df3b1SJaegeuk Kim return freed; 595e05df3b1SJaegeuk Kim 596e05df3b1SJaegeuk Kim out_err: 597e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 598e05df3b1SJaegeuk Kim return ret; 599e05df3b1SJaegeuk Kim } 600e05df3b1SJaegeuk Kim 601e05df3b1SJaegeuk Kim static int truncate_partial_nodes(struct dnode_of_data *dn, 602e05df3b1SJaegeuk Kim struct f2fs_inode *ri, int *offset, int depth) 603e05df3b1SJaegeuk Kim { 604e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 605e05df3b1SJaegeuk Kim struct page *pages[2]; 606e05df3b1SJaegeuk Kim nid_t nid[3]; 607e05df3b1SJaegeuk Kim nid_t child_nid; 608e05df3b1SJaegeuk Kim int err = 0; 609e05df3b1SJaegeuk Kim int i; 610e05df3b1SJaegeuk Kim int idx = depth - 2; 611e05df3b1SJaegeuk Kim 612e05df3b1SJaegeuk Kim nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); 613e05df3b1SJaegeuk Kim if (!nid[0]) 614e05df3b1SJaegeuk Kim return 0; 615e05df3b1SJaegeuk Kim 616e05df3b1SJaegeuk Kim /* get indirect nodes in the path */ 617e05df3b1SJaegeuk Kim for (i = 0; i < depth - 1; i++) { 618e05df3b1SJaegeuk Kim /* refernece count'll be increased */ 619e05df3b1SJaegeuk Kim pages[i] = get_node_page(sbi, nid[i]); 620e05df3b1SJaegeuk Kim if (IS_ERR(pages[i])) { 621e05df3b1SJaegeuk Kim depth = i + 1; 622e05df3b1SJaegeuk Kim err = PTR_ERR(pages[i]); 623e05df3b1SJaegeuk Kim goto fail; 624e05df3b1SJaegeuk Kim } 625e05df3b1SJaegeuk Kim nid[i + 1] = get_nid(pages[i], offset[i + 1], false); 626e05df3b1SJaegeuk Kim } 627e05df3b1SJaegeuk Kim 628e05df3b1SJaegeuk Kim /* free direct nodes linked to a partial indirect node */ 629e05df3b1SJaegeuk Kim for (i = offset[depth - 1]; i < NIDS_PER_BLOCK; i++) { 630e05df3b1SJaegeuk Kim child_nid = get_nid(pages[idx], i, false); 631e05df3b1SJaegeuk Kim if (!child_nid) 632e05df3b1SJaegeuk Kim continue; 633e05df3b1SJaegeuk Kim dn->nid = child_nid; 634e05df3b1SJaegeuk Kim err = truncate_dnode(dn); 635e05df3b1SJaegeuk Kim if (err < 0) 636e05df3b1SJaegeuk Kim goto fail; 637e05df3b1SJaegeuk Kim set_nid(pages[idx], i, 0, false); 638e05df3b1SJaegeuk Kim } 639e05df3b1SJaegeuk Kim 640e05df3b1SJaegeuk Kim if (offset[depth - 1] == 0) { 641e05df3b1SJaegeuk Kim dn->node_page = pages[idx]; 642e05df3b1SJaegeuk Kim dn->nid = nid[idx]; 643e05df3b1SJaegeuk Kim truncate_node(dn); 644e05df3b1SJaegeuk Kim } else { 645e05df3b1SJaegeuk Kim f2fs_put_page(pages[idx], 1); 646e05df3b1SJaegeuk Kim } 647e05df3b1SJaegeuk Kim offset[idx]++; 648e05df3b1SJaegeuk Kim offset[depth - 1] = 0; 649e05df3b1SJaegeuk Kim fail: 650e05df3b1SJaegeuk Kim for (i = depth - 3; i >= 0; i--) 651e05df3b1SJaegeuk Kim f2fs_put_page(pages[i], 1); 652e05df3b1SJaegeuk Kim return err; 653e05df3b1SJaegeuk Kim } 654e05df3b1SJaegeuk Kim 6550a8165d7SJaegeuk Kim /* 656e05df3b1SJaegeuk Kim * All the block addresses of data and nodes should be nullified. 657e05df3b1SJaegeuk Kim */ 658e05df3b1SJaegeuk Kim int truncate_inode_blocks(struct inode *inode, pgoff_t from) 659e05df3b1SJaegeuk Kim { 660e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 661e05df3b1SJaegeuk Kim int err = 0, cont = 1; 662e05df3b1SJaegeuk Kim int level, offset[4], noffset[4]; 6637dd690c8SJaegeuk Kim unsigned int nofs = 0; 664e05df3b1SJaegeuk Kim struct f2fs_node *rn; 665e05df3b1SJaegeuk Kim struct dnode_of_data dn; 666e05df3b1SJaegeuk Kim struct page *page; 667e05df3b1SJaegeuk Kim 668e05df3b1SJaegeuk Kim level = get_node_path(from, offset, noffset); 669e05df3b1SJaegeuk Kim 670e05df3b1SJaegeuk Kim page = get_node_page(sbi, inode->i_ino); 671e05df3b1SJaegeuk Kim if (IS_ERR(page)) 672e05df3b1SJaegeuk Kim return PTR_ERR(page); 673e05df3b1SJaegeuk Kim 674e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, page, NULL, 0); 675e05df3b1SJaegeuk Kim unlock_page(page); 676e05df3b1SJaegeuk Kim 677e05df3b1SJaegeuk Kim rn = page_address(page); 678e05df3b1SJaegeuk Kim switch (level) { 679e05df3b1SJaegeuk Kim case 0: 680e05df3b1SJaegeuk Kim case 1: 681e05df3b1SJaegeuk Kim nofs = noffset[1]; 682e05df3b1SJaegeuk Kim break; 683e05df3b1SJaegeuk Kim case 2: 684e05df3b1SJaegeuk Kim nofs = noffset[1]; 685e05df3b1SJaegeuk Kim if (!offset[level - 1]) 686e05df3b1SJaegeuk Kim goto skip_partial; 687e05df3b1SJaegeuk Kim err = truncate_partial_nodes(&dn, &rn->i, offset, level); 688e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 689e05df3b1SJaegeuk Kim goto fail; 690e05df3b1SJaegeuk Kim nofs += 1 + NIDS_PER_BLOCK; 691e05df3b1SJaegeuk Kim break; 692e05df3b1SJaegeuk Kim case 3: 693e05df3b1SJaegeuk Kim nofs = 5 + 2 * NIDS_PER_BLOCK; 694e05df3b1SJaegeuk Kim if (!offset[level - 1]) 695e05df3b1SJaegeuk Kim goto skip_partial; 696e05df3b1SJaegeuk Kim err = truncate_partial_nodes(&dn, &rn->i, offset, level); 697e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 698e05df3b1SJaegeuk Kim goto fail; 699e05df3b1SJaegeuk Kim break; 700e05df3b1SJaegeuk Kim default: 701e05df3b1SJaegeuk Kim BUG(); 702e05df3b1SJaegeuk Kim } 703e05df3b1SJaegeuk Kim 704e05df3b1SJaegeuk Kim skip_partial: 705e05df3b1SJaegeuk Kim while (cont) { 706e05df3b1SJaegeuk Kim dn.nid = le32_to_cpu(rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]); 707e05df3b1SJaegeuk Kim switch (offset[0]) { 708e05df3b1SJaegeuk Kim case NODE_DIR1_BLOCK: 709e05df3b1SJaegeuk Kim case NODE_DIR2_BLOCK: 710e05df3b1SJaegeuk Kim err = truncate_dnode(&dn); 711e05df3b1SJaegeuk Kim break; 712e05df3b1SJaegeuk Kim 713e05df3b1SJaegeuk Kim case NODE_IND1_BLOCK: 714e05df3b1SJaegeuk Kim case NODE_IND2_BLOCK: 715e05df3b1SJaegeuk Kim err = truncate_nodes(&dn, nofs, offset[1], 2); 716e05df3b1SJaegeuk Kim break; 717e05df3b1SJaegeuk Kim 718e05df3b1SJaegeuk Kim case NODE_DIND_BLOCK: 719e05df3b1SJaegeuk Kim err = truncate_nodes(&dn, nofs, offset[1], 3); 720e05df3b1SJaegeuk Kim cont = 0; 721e05df3b1SJaegeuk Kim break; 722e05df3b1SJaegeuk Kim 723e05df3b1SJaegeuk Kim default: 724e05df3b1SJaegeuk Kim BUG(); 725e05df3b1SJaegeuk Kim } 726e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 727e05df3b1SJaegeuk Kim goto fail; 728e05df3b1SJaegeuk Kim if (offset[1] == 0 && 729e05df3b1SJaegeuk Kim rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]) { 730e05df3b1SJaegeuk Kim lock_page(page); 731e05df3b1SJaegeuk Kim wait_on_page_writeback(page); 732e05df3b1SJaegeuk Kim rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK] = 0; 733e05df3b1SJaegeuk Kim set_page_dirty(page); 734e05df3b1SJaegeuk Kim unlock_page(page); 735e05df3b1SJaegeuk Kim } 736e05df3b1SJaegeuk Kim offset[1] = 0; 737e05df3b1SJaegeuk Kim offset[0]++; 738e05df3b1SJaegeuk Kim nofs += err; 739e05df3b1SJaegeuk Kim } 740e05df3b1SJaegeuk Kim fail: 741e05df3b1SJaegeuk Kim f2fs_put_page(page, 0); 742e05df3b1SJaegeuk Kim return err > 0 ? 0 : err; 743e05df3b1SJaegeuk Kim } 744e05df3b1SJaegeuk Kim 745e05df3b1SJaegeuk Kim int remove_inode_page(struct inode *inode) 746e05df3b1SJaegeuk Kim { 747e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 748e05df3b1SJaegeuk Kim struct page *page; 749e05df3b1SJaegeuk Kim nid_t ino = inode->i_ino; 750e05df3b1SJaegeuk Kim struct dnode_of_data dn; 751e05df3b1SJaegeuk Kim 752e05df3b1SJaegeuk Kim mutex_lock_op(sbi, NODE_TRUNC); 753e05df3b1SJaegeuk Kim page = get_node_page(sbi, ino); 754e05df3b1SJaegeuk Kim if (IS_ERR(page)) { 755e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_TRUNC); 756e05df3b1SJaegeuk Kim return PTR_ERR(page); 757e05df3b1SJaegeuk Kim } 758e05df3b1SJaegeuk Kim 759e05df3b1SJaegeuk Kim if (F2FS_I(inode)->i_xattr_nid) { 760e05df3b1SJaegeuk Kim nid_t nid = F2FS_I(inode)->i_xattr_nid; 761e05df3b1SJaegeuk Kim struct page *npage = get_node_page(sbi, nid); 762e05df3b1SJaegeuk Kim 763e05df3b1SJaegeuk Kim if (IS_ERR(npage)) { 764e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_TRUNC); 765e05df3b1SJaegeuk Kim return PTR_ERR(npage); 766e05df3b1SJaegeuk Kim } 767e05df3b1SJaegeuk Kim 768e05df3b1SJaegeuk Kim F2FS_I(inode)->i_xattr_nid = 0; 769e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, page, npage, nid); 770e05df3b1SJaegeuk Kim dn.inode_page_locked = 1; 771e05df3b1SJaegeuk Kim truncate_node(&dn); 772e05df3b1SJaegeuk Kim } 77371e9fec5SJaegeuk Kim 77471e9fec5SJaegeuk Kim /* 0 is possible, after f2fs_new_inode() is failed */ 77571e9fec5SJaegeuk Kim BUG_ON(inode->i_blocks != 0 && inode->i_blocks != 1); 776e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, page, page, ino); 777e05df3b1SJaegeuk Kim truncate_node(&dn); 778e05df3b1SJaegeuk Kim 779e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_TRUNC); 780e05df3b1SJaegeuk Kim return 0; 781e05df3b1SJaegeuk Kim } 782e05df3b1SJaegeuk Kim 783c004363dSAl Viro int new_inode_page(struct inode *inode, const struct qstr *name) 784e05df3b1SJaegeuk Kim { 785e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 786e05df3b1SJaegeuk Kim struct page *page; 787e05df3b1SJaegeuk Kim struct dnode_of_data dn; 788e05df3b1SJaegeuk Kim 789e05df3b1SJaegeuk Kim /* allocate inode page for new inode */ 790e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino); 791e05df3b1SJaegeuk Kim mutex_lock_op(sbi, NODE_NEW); 792e05df3b1SJaegeuk Kim page = new_node_page(&dn, 0); 793c004363dSAl Viro init_dent_inode(name, page); 794e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_NEW); 795e05df3b1SJaegeuk Kim if (IS_ERR(page)) 796e05df3b1SJaegeuk Kim return PTR_ERR(page); 797e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 798e05df3b1SJaegeuk Kim return 0; 799e05df3b1SJaegeuk Kim } 800e05df3b1SJaegeuk Kim 801e05df3b1SJaegeuk Kim struct page *new_node_page(struct dnode_of_data *dn, unsigned int ofs) 802e05df3b1SJaegeuk Kim { 803e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 804e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 805e05df3b1SJaegeuk Kim struct node_info old_ni, new_ni; 806e05df3b1SJaegeuk Kim struct page *page; 807e05df3b1SJaegeuk Kim int err; 808e05df3b1SJaegeuk Kim 809e05df3b1SJaegeuk Kim if (is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC)) 810e05df3b1SJaegeuk Kim return ERR_PTR(-EPERM); 811e05df3b1SJaegeuk Kim 812e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, dn->nid); 813e05df3b1SJaegeuk Kim if (!page) 814e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 815e05df3b1SJaegeuk Kim 816e05df3b1SJaegeuk Kim get_node_info(sbi, dn->nid, &old_ni); 817e05df3b1SJaegeuk Kim 818e05df3b1SJaegeuk Kim SetPageUptodate(page); 819e05df3b1SJaegeuk Kim fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true); 820e05df3b1SJaegeuk Kim 821e05df3b1SJaegeuk Kim /* Reinitialize old_ni with new node page */ 822e05df3b1SJaegeuk Kim BUG_ON(old_ni.blk_addr != NULL_ADDR); 823e05df3b1SJaegeuk Kim new_ni = old_ni; 824e05df3b1SJaegeuk Kim new_ni.ino = dn->inode->i_ino; 825e05df3b1SJaegeuk Kim 826e05df3b1SJaegeuk Kim if (!inc_valid_node_count(sbi, dn->inode, 1)) { 827e05df3b1SJaegeuk Kim err = -ENOSPC; 828e05df3b1SJaegeuk Kim goto fail; 829e05df3b1SJaegeuk Kim } 830e05df3b1SJaegeuk Kim set_node_addr(sbi, &new_ni, NEW_ADDR); 831398b1ac5SJaegeuk Kim set_cold_node(dn->inode, page); 832e05df3b1SJaegeuk Kim 833e05df3b1SJaegeuk Kim dn->node_page = page; 834e05df3b1SJaegeuk Kim sync_inode_page(dn); 835e05df3b1SJaegeuk Kim set_page_dirty(page); 836e05df3b1SJaegeuk Kim if (ofs == 0) 837e05df3b1SJaegeuk Kim inc_valid_inode_count(sbi); 838e05df3b1SJaegeuk Kim 839e05df3b1SJaegeuk Kim return page; 840e05df3b1SJaegeuk Kim 841e05df3b1SJaegeuk Kim fail: 84271e9fec5SJaegeuk Kim clear_node_page_dirty(page); 843e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 844e05df3b1SJaegeuk Kim return ERR_PTR(err); 845e05df3b1SJaegeuk Kim } 846e05df3b1SJaegeuk Kim 847e05df3b1SJaegeuk Kim static int read_node_page(struct page *page, int type) 848e05df3b1SJaegeuk Kim { 849e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); 850e05df3b1SJaegeuk Kim struct node_info ni; 851e05df3b1SJaegeuk Kim 852e05df3b1SJaegeuk Kim get_node_info(sbi, page->index, &ni); 853e05df3b1SJaegeuk Kim 854e05df3b1SJaegeuk Kim if (ni.blk_addr == NULL_ADDR) 855e05df3b1SJaegeuk Kim return -ENOENT; 856e05df3b1SJaegeuk Kim return f2fs_readpage(sbi, page, ni.blk_addr, type); 857e05df3b1SJaegeuk Kim } 858e05df3b1SJaegeuk Kim 8590a8165d7SJaegeuk Kim /* 860e05df3b1SJaegeuk Kim * Readahead a node page 861e05df3b1SJaegeuk Kim */ 862e05df3b1SJaegeuk Kim void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid) 863e05df3b1SJaegeuk Kim { 864e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 865e05df3b1SJaegeuk Kim struct page *apage; 866e05df3b1SJaegeuk Kim 867e05df3b1SJaegeuk Kim apage = find_get_page(mapping, nid); 868e05df3b1SJaegeuk Kim if (apage && PageUptodate(apage)) 869e05df3b1SJaegeuk Kim goto release_out; 870e05df3b1SJaegeuk Kim f2fs_put_page(apage, 0); 871e05df3b1SJaegeuk Kim 872e05df3b1SJaegeuk Kim apage = grab_cache_page(mapping, nid); 873e05df3b1SJaegeuk Kim if (!apage) 874e05df3b1SJaegeuk Kim return; 875e05df3b1SJaegeuk Kim 876e05df3b1SJaegeuk Kim if (read_node_page(apage, READA)) 877e05df3b1SJaegeuk Kim unlock_page(apage); 878a2b52a59SNamjae Jeon 879e05df3b1SJaegeuk Kim release_out: 880369a708cSJaegeuk Kim f2fs_put_page(apage, 0); 881a2b52a59SNamjae Jeon return; 882e05df3b1SJaegeuk Kim } 883e05df3b1SJaegeuk Kim 884e05df3b1SJaegeuk Kim struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid) 885e05df3b1SJaegeuk Kim { 886e05df3b1SJaegeuk Kim int err; 887e05df3b1SJaegeuk Kim struct page *page; 888e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 889e05df3b1SJaegeuk Kim 890e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, nid); 891e05df3b1SJaegeuk Kim if (!page) 892e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 893e05df3b1SJaegeuk Kim 894e05df3b1SJaegeuk Kim err = read_node_page(page, READ_SYNC); 895e05df3b1SJaegeuk Kim if (err) { 896e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 897e05df3b1SJaegeuk Kim return ERR_PTR(err); 898e05df3b1SJaegeuk Kim } 899e05df3b1SJaegeuk Kim 900e05df3b1SJaegeuk Kim BUG_ON(nid != nid_of_node(page)); 901e05df3b1SJaegeuk Kim mark_page_accessed(page); 902e05df3b1SJaegeuk Kim return page; 903e05df3b1SJaegeuk Kim } 904e05df3b1SJaegeuk Kim 9050a8165d7SJaegeuk Kim /* 906e05df3b1SJaegeuk Kim * Return a locked page for the desired node page. 907e05df3b1SJaegeuk Kim * And, readahead MAX_RA_NODE number of node pages. 908e05df3b1SJaegeuk Kim */ 909e05df3b1SJaegeuk Kim struct page *get_node_page_ra(struct page *parent, int start) 910e05df3b1SJaegeuk Kim { 911e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(parent->mapping->host->i_sb); 912e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 913e05df3b1SJaegeuk Kim int i, end; 914e05df3b1SJaegeuk Kim int err = 0; 915e05df3b1SJaegeuk Kim nid_t nid; 916e05df3b1SJaegeuk Kim struct page *page; 917e05df3b1SJaegeuk Kim 918e05df3b1SJaegeuk Kim /* First, try getting the desired direct node. */ 919e05df3b1SJaegeuk Kim nid = get_nid(parent, start, false); 920e05df3b1SJaegeuk Kim if (!nid) 921e05df3b1SJaegeuk Kim return ERR_PTR(-ENOENT); 922e05df3b1SJaegeuk Kim 923e05df3b1SJaegeuk Kim page = find_get_page(mapping, nid); 924e05df3b1SJaegeuk Kim if (page && PageUptodate(page)) 925e05df3b1SJaegeuk Kim goto page_hit; 926e05df3b1SJaegeuk Kim f2fs_put_page(page, 0); 927e05df3b1SJaegeuk Kim 928e05df3b1SJaegeuk Kim repeat: 929e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, nid); 930e05df3b1SJaegeuk Kim if (!page) 931e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 932e05df3b1SJaegeuk Kim 933e05df3b1SJaegeuk Kim err = read_node_page(page, READA); 934e05df3b1SJaegeuk Kim if (err) { 935e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 936e05df3b1SJaegeuk Kim return ERR_PTR(err); 937e05df3b1SJaegeuk Kim } 938e05df3b1SJaegeuk Kim 939e05df3b1SJaegeuk Kim /* Then, try readahead for siblings of the desired node */ 940e05df3b1SJaegeuk Kim end = start + MAX_RA_NODE; 941e05df3b1SJaegeuk Kim end = min(end, NIDS_PER_BLOCK); 942e05df3b1SJaegeuk Kim for (i = start + 1; i < end; i++) { 943e05df3b1SJaegeuk Kim nid = get_nid(parent, i, false); 944e05df3b1SJaegeuk Kim if (!nid) 945e05df3b1SJaegeuk Kim continue; 946e05df3b1SJaegeuk Kim ra_node_page(sbi, nid); 947e05df3b1SJaegeuk Kim } 948e05df3b1SJaegeuk Kim 949e05df3b1SJaegeuk Kim page_hit: 950e05df3b1SJaegeuk Kim lock_page(page); 951e05df3b1SJaegeuk Kim if (PageError(page)) { 952e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 953e05df3b1SJaegeuk Kim return ERR_PTR(-EIO); 954e05df3b1SJaegeuk Kim } 955e05df3b1SJaegeuk Kim 956e05df3b1SJaegeuk Kim /* Has the page been truncated? */ 957e05df3b1SJaegeuk Kim if (page->mapping != mapping) { 958e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 959e05df3b1SJaegeuk Kim goto repeat; 960e05df3b1SJaegeuk Kim } 961e05df3b1SJaegeuk Kim return page; 962e05df3b1SJaegeuk Kim } 963e05df3b1SJaegeuk Kim 964e05df3b1SJaegeuk Kim void sync_inode_page(struct dnode_of_data *dn) 965e05df3b1SJaegeuk Kim { 966e05df3b1SJaegeuk Kim if (IS_INODE(dn->node_page) || dn->inode_page == dn->node_page) { 967e05df3b1SJaegeuk Kim update_inode(dn->inode, dn->node_page); 968e05df3b1SJaegeuk Kim } else if (dn->inode_page) { 969e05df3b1SJaegeuk Kim if (!dn->inode_page_locked) 970e05df3b1SJaegeuk Kim lock_page(dn->inode_page); 971e05df3b1SJaegeuk Kim update_inode(dn->inode, dn->inode_page); 972e05df3b1SJaegeuk Kim if (!dn->inode_page_locked) 973e05df3b1SJaegeuk Kim unlock_page(dn->inode_page); 974e05df3b1SJaegeuk Kim } else { 975e05df3b1SJaegeuk Kim f2fs_write_inode(dn->inode, NULL); 976e05df3b1SJaegeuk Kim } 977e05df3b1SJaegeuk Kim } 978e05df3b1SJaegeuk Kim 979e05df3b1SJaegeuk Kim int sync_node_pages(struct f2fs_sb_info *sbi, nid_t ino, 980e05df3b1SJaegeuk Kim struct writeback_control *wbc) 981e05df3b1SJaegeuk Kim { 982e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 983e05df3b1SJaegeuk Kim pgoff_t index, end; 984e05df3b1SJaegeuk Kim struct pagevec pvec; 985e05df3b1SJaegeuk Kim int step = ino ? 2 : 0; 986e05df3b1SJaegeuk Kim int nwritten = 0, wrote = 0; 987e05df3b1SJaegeuk Kim 988e05df3b1SJaegeuk Kim pagevec_init(&pvec, 0); 989e05df3b1SJaegeuk Kim 990e05df3b1SJaegeuk Kim next_step: 991e05df3b1SJaegeuk Kim index = 0; 992e05df3b1SJaegeuk Kim end = LONG_MAX; 993e05df3b1SJaegeuk Kim 994e05df3b1SJaegeuk Kim while (index <= end) { 995e05df3b1SJaegeuk Kim int i, nr_pages; 996e05df3b1SJaegeuk Kim nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, 997e05df3b1SJaegeuk Kim PAGECACHE_TAG_DIRTY, 998e05df3b1SJaegeuk Kim min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1); 999e05df3b1SJaegeuk Kim if (nr_pages == 0) 1000e05df3b1SJaegeuk Kim break; 1001e05df3b1SJaegeuk Kim 1002e05df3b1SJaegeuk Kim for (i = 0; i < nr_pages; i++) { 1003e05df3b1SJaegeuk Kim struct page *page = pvec.pages[i]; 1004e05df3b1SJaegeuk Kim 1005e05df3b1SJaegeuk Kim /* 1006e05df3b1SJaegeuk Kim * flushing sequence with step: 1007e05df3b1SJaegeuk Kim * 0. indirect nodes 1008e05df3b1SJaegeuk Kim * 1. dentry dnodes 1009e05df3b1SJaegeuk Kim * 2. file dnodes 1010e05df3b1SJaegeuk Kim */ 1011e05df3b1SJaegeuk Kim if (step == 0 && IS_DNODE(page)) 1012e05df3b1SJaegeuk Kim continue; 1013e05df3b1SJaegeuk Kim if (step == 1 && (!IS_DNODE(page) || 1014e05df3b1SJaegeuk Kim is_cold_node(page))) 1015e05df3b1SJaegeuk Kim continue; 1016e05df3b1SJaegeuk Kim if (step == 2 && (!IS_DNODE(page) || 1017e05df3b1SJaegeuk Kim !is_cold_node(page))) 1018e05df3b1SJaegeuk Kim continue; 1019e05df3b1SJaegeuk Kim 1020e05df3b1SJaegeuk Kim /* 1021e05df3b1SJaegeuk Kim * If an fsync mode, 1022e05df3b1SJaegeuk Kim * we should not skip writing node pages. 1023e05df3b1SJaegeuk Kim */ 1024e05df3b1SJaegeuk Kim if (ino && ino_of_node(page) == ino) 1025e05df3b1SJaegeuk Kim lock_page(page); 1026e05df3b1SJaegeuk Kim else if (!trylock_page(page)) 1027e05df3b1SJaegeuk Kim continue; 1028e05df3b1SJaegeuk Kim 1029e05df3b1SJaegeuk Kim if (unlikely(page->mapping != mapping)) { 1030e05df3b1SJaegeuk Kim continue_unlock: 1031e05df3b1SJaegeuk Kim unlock_page(page); 1032e05df3b1SJaegeuk Kim continue; 1033e05df3b1SJaegeuk Kim } 1034e05df3b1SJaegeuk Kim if (ino && ino_of_node(page) != ino) 1035e05df3b1SJaegeuk Kim goto continue_unlock; 1036e05df3b1SJaegeuk Kim 1037e05df3b1SJaegeuk Kim if (!PageDirty(page)) { 1038e05df3b1SJaegeuk Kim /* someone wrote it for us */ 1039e05df3b1SJaegeuk Kim goto continue_unlock; 1040e05df3b1SJaegeuk Kim } 1041e05df3b1SJaegeuk Kim 1042e05df3b1SJaegeuk Kim if (!clear_page_dirty_for_io(page)) 1043e05df3b1SJaegeuk Kim goto continue_unlock; 1044e05df3b1SJaegeuk Kim 1045e05df3b1SJaegeuk Kim /* called by fsync() */ 1046e05df3b1SJaegeuk Kim if (ino && IS_DNODE(page)) { 1047e05df3b1SJaegeuk Kim int mark = !is_checkpointed_node(sbi, ino); 1048e05df3b1SJaegeuk Kim set_fsync_mark(page, 1); 1049e05df3b1SJaegeuk Kim if (IS_INODE(page)) 1050e05df3b1SJaegeuk Kim set_dentry_mark(page, mark); 1051e05df3b1SJaegeuk Kim nwritten++; 1052e05df3b1SJaegeuk Kim } else { 1053e05df3b1SJaegeuk Kim set_fsync_mark(page, 0); 1054e05df3b1SJaegeuk Kim set_dentry_mark(page, 0); 1055e05df3b1SJaegeuk Kim } 1056e05df3b1SJaegeuk Kim mapping->a_ops->writepage(page, wbc); 1057e05df3b1SJaegeuk Kim wrote++; 1058e05df3b1SJaegeuk Kim 1059e05df3b1SJaegeuk Kim if (--wbc->nr_to_write == 0) 1060e05df3b1SJaegeuk Kim break; 1061e05df3b1SJaegeuk Kim } 1062e05df3b1SJaegeuk Kim pagevec_release(&pvec); 1063e05df3b1SJaegeuk Kim cond_resched(); 1064e05df3b1SJaegeuk Kim 1065e05df3b1SJaegeuk Kim if (wbc->nr_to_write == 0) { 1066e05df3b1SJaegeuk Kim step = 2; 1067e05df3b1SJaegeuk Kim break; 1068e05df3b1SJaegeuk Kim } 1069e05df3b1SJaegeuk Kim } 1070e05df3b1SJaegeuk Kim 1071e05df3b1SJaegeuk Kim if (step < 2) { 1072e05df3b1SJaegeuk Kim step++; 1073e05df3b1SJaegeuk Kim goto next_step; 1074e05df3b1SJaegeuk Kim } 1075e05df3b1SJaegeuk Kim 1076e05df3b1SJaegeuk Kim if (wrote) 1077e05df3b1SJaegeuk Kim f2fs_submit_bio(sbi, NODE, wbc->sync_mode == WB_SYNC_ALL); 1078e05df3b1SJaegeuk Kim 1079e05df3b1SJaegeuk Kim return nwritten; 1080e05df3b1SJaegeuk Kim } 1081e05df3b1SJaegeuk Kim 1082e05df3b1SJaegeuk Kim static int f2fs_write_node_page(struct page *page, 1083e05df3b1SJaegeuk Kim struct writeback_control *wbc) 1084e05df3b1SJaegeuk Kim { 1085e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); 1086e05df3b1SJaegeuk Kim nid_t nid; 1087e05df3b1SJaegeuk Kim block_t new_addr; 1088e05df3b1SJaegeuk Kim struct node_info ni; 1089e05df3b1SJaegeuk Kim 1090e05df3b1SJaegeuk Kim if (wbc->for_reclaim) { 1091e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 1092e05df3b1SJaegeuk Kim wbc->pages_skipped++; 1093e05df3b1SJaegeuk Kim set_page_dirty(page); 1094e05df3b1SJaegeuk Kim return AOP_WRITEPAGE_ACTIVATE; 1095e05df3b1SJaegeuk Kim } 1096e05df3b1SJaegeuk Kim 1097e05df3b1SJaegeuk Kim wait_on_page_writeback(page); 1098e05df3b1SJaegeuk Kim 1099e05df3b1SJaegeuk Kim mutex_lock_op(sbi, NODE_WRITE); 1100e05df3b1SJaegeuk Kim 1101e05df3b1SJaegeuk Kim /* get old block addr of this node page */ 1102e05df3b1SJaegeuk Kim nid = nid_of_node(page); 1103e05df3b1SJaegeuk Kim BUG_ON(page->index != nid); 1104e05df3b1SJaegeuk Kim 1105e05df3b1SJaegeuk Kim get_node_info(sbi, nid, &ni); 1106e05df3b1SJaegeuk Kim 1107e05df3b1SJaegeuk Kim /* This page is already truncated */ 1108e05df3b1SJaegeuk Kim if (ni.blk_addr == NULL_ADDR) 1109e05df3b1SJaegeuk Kim return 0; 1110e05df3b1SJaegeuk Kim 1111e05df3b1SJaegeuk Kim set_page_writeback(page); 1112e05df3b1SJaegeuk Kim 1113e05df3b1SJaegeuk Kim /* insert node offset */ 1114e05df3b1SJaegeuk Kim write_node_page(sbi, page, nid, ni.blk_addr, &new_addr); 1115e05df3b1SJaegeuk Kim set_node_addr(sbi, &ni, new_addr); 1116e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 1117e05df3b1SJaegeuk Kim 1118e05df3b1SJaegeuk Kim mutex_unlock_op(sbi, NODE_WRITE); 1119e05df3b1SJaegeuk Kim unlock_page(page); 1120e05df3b1SJaegeuk Kim return 0; 1121e05df3b1SJaegeuk Kim } 1122e05df3b1SJaegeuk Kim 1123a7fdffbdSJaegeuk Kim /* 1124a7fdffbdSJaegeuk Kim * It is very important to gather dirty pages and write at once, so that we can 1125a7fdffbdSJaegeuk Kim * submit a big bio without interfering other data writes. 1126a7fdffbdSJaegeuk Kim * Be default, 512 pages (2MB), a segment size, is quite reasonable. 1127a7fdffbdSJaegeuk Kim */ 1128a7fdffbdSJaegeuk Kim #define COLLECT_DIRTY_NODES 512 1129e05df3b1SJaegeuk Kim static int f2fs_write_node_pages(struct address_space *mapping, 1130e05df3b1SJaegeuk Kim struct writeback_control *wbc) 1131e05df3b1SJaegeuk Kim { 1132e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 1133e05df3b1SJaegeuk Kim struct block_device *bdev = sbi->sb->s_bdev; 1134e05df3b1SJaegeuk Kim long nr_to_write = wbc->nr_to_write; 1135e05df3b1SJaegeuk Kim 1136a7fdffbdSJaegeuk Kim /* First check balancing cached NAT entries */ 1137e05df3b1SJaegeuk Kim if (try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK)) { 113843727527SJaegeuk Kim write_checkpoint(sbi, false); 1139e05df3b1SJaegeuk Kim return 0; 1140e05df3b1SJaegeuk Kim } 1141e05df3b1SJaegeuk Kim 1142a7fdffbdSJaegeuk Kim /* collect a number of dirty node pages and write together */ 1143a7fdffbdSJaegeuk Kim if (get_pages(sbi, F2FS_DIRTY_NODES) < COLLECT_DIRTY_NODES) 1144a7fdffbdSJaegeuk Kim return 0; 1145a7fdffbdSJaegeuk Kim 1146e05df3b1SJaegeuk Kim /* if mounting is failed, skip writing node pages */ 1147e05df3b1SJaegeuk Kim wbc->nr_to_write = bio_get_nr_vecs(bdev); 1148e05df3b1SJaegeuk Kim sync_node_pages(sbi, 0, wbc); 1149e05df3b1SJaegeuk Kim wbc->nr_to_write = nr_to_write - 1150e05df3b1SJaegeuk Kim (bio_get_nr_vecs(bdev) - wbc->nr_to_write); 1151e05df3b1SJaegeuk Kim return 0; 1152e05df3b1SJaegeuk Kim } 1153e05df3b1SJaegeuk Kim 1154e05df3b1SJaegeuk Kim static int f2fs_set_node_page_dirty(struct page *page) 1155e05df3b1SJaegeuk Kim { 1156e05df3b1SJaegeuk Kim struct address_space *mapping = page->mapping; 1157e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 1158e05df3b1SJaegeuk Kim 1159e05df3b1SJaegeuk Kim SetPageUptodate(page); 1160e05df3b1SJaegeuk Kim if (!PageDirty(page)) { 1161e05df3b1SJaegeuk Kim __set_page_dirty_nobuffers(page); 1162e05df3b1SJaegeuk Kim inc_page_count(sbi, F2FS_DIRTY_NODES); 1163e05df3b1SJaegeuk Kim SetPagePrivate(page); 1164e05df3b1SJaegeuk Kim return 1; 1165e05df3b1SJaegeuk Kim } 1166e05df3b1SJaegeuk Kim return 0; 1167e05df3b1SJaegeuk Kim } 1168e05df3b1SJaegeuk Kim 1169e05df3b1SJaegeuk Kim static void f2fs_invalidate_node_page(struct page *page, unsigned long offset) 1170e05df3b1SJaegeuk Kim { 1171e05df3b1SJaegeuk Kim struct inode *inode = page->mapping->host; 1172e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 1173e05df3b1SJaegeuk Kim if (PageDirty(page)) 1174e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 1175e05df3b1SJaegeuk Kim ClearPagePrivate(page); 1176e05df3b1SJaegeuk Kim } 1177e05df3b1SJaegeuk Kim 1178e05df3b1SJaegeuk Kim static int f2fs_release_node_page(struct page *page, gfp_t wait) 1179e05df3b1SJaegeuk Kim { 1180e05df3b1SJaegeuk Kim ClearPagePrivate(page); 1181e05df3b1SJaegeuk Kim return 0; 1182e05df3b1SJaegeuk Kim } 1183e05df3b1SJaegeuk Kim 11840a8165d7SJaegeuk Kim /* 1185e05df3b1SJaegeuk Kim * Structure of the f2fs node operations 1186e05df3b1SJaegeuk Kim */ 1187e05df3b1SJaegeuk Kim const struct address_space_operations f2fs_node_aops = { 1188e05df3b1SJaegeuk Kim .writepage = f2fs_write_node_page, 1189e05df3b1SJaegeuk Kim .writepages = f2fs_write_node_pages, 1190e05df3b1SJaegeuk Kim .set_page_dirty = f2fs_set_node_page_dirty, 1191e05df3b1SJaegeuk Kim .invalidatepage = f2fs_invalidate_node_page, 1192e05df3b1SJaegeuk Kim .releasepage = f2fs_release_node_page, 1193e05df3b1SJaegeuk Kim }; 1194e05df3b1SJaegeuk Kim 1195e05df3b1SJaegeuk Kim static struct free_nid *__lookup_free_nid_list(nid_t n, struct list_head *head) 1196e05df3b1SJaegeuk Kim { 1197e05df3b1SJaegeuk Kim struct list_head *this; 1198e05df3b1SJaegeuk Kim struct free_nid *i = NULL; 1199e05df3b1SJaegeuk Kim list_for_each(this, head) { 1200e05df3b1SJaegeuk Kim i = list_entry(this, struct free_nid, list); 1201e05df3b1SJaegeuk Kim if (i->nid == n) 1202e05df3b1SJaegeuk Kim break; 1203e05df3b1SJaegeuk Kim i = NULL; 1204e05df3b1SJaegeuk Kim } 1205e05df3b1SJaegeuk Kim return i; 1206e05df3b1SJaegeuk Kim } 1207e05df3b1SJaegeuk Kim 1208e05df3b1SJaegeuk Kim static void __del_from_free_nid_list(struct free_nid *i) 1209e05df3b1SJaegeuk Kim { 1210e05df3b1SJaegeuk Kim list_del(&i->list); 1211e05df3b1SJaegeuk Kim kmem_cache_free(free_nid_slab, i); 1212e05df3b1SJaegeuk Kim } 1213e05df3b1SJaegeuk Kim 1214e05df3b1SJaegeuk Kim static int add_free_nid(struct f2fs_nm_info *nm_i, nid_t nid) 1215e05df3b1SJaegeuk Kim { 1216e05df3b1SJaegeuk Kim struct free_nid *i; 1217e05df3b1SJaegeuk Kim 1218e05df3b1SJaegeuk Kim if (nm_i->fcnt > 2 * MAX_FREE_NIDS) 1219e05df3b1SJaegeuk Kim return 0; 1220e05df3b1SJaegeuk Kim retry: 1221e05df3b1SJaegeuk Kim i = kmem_cache_alloc(free_nid_slab, GFP_NOFS); 1222e05df3b1SJaegeuk Kim if (!i) { 1223e05df3b1SJaegeuk Kim cond_resched(); 1224e05df3b1SJaegeuk Kim goto retry; 1225e05df3b1SJaegeuk Kim } 1226e05df3b1SJaegeuk Kim i->nid = nid; 1227e05df3b1SJaegeuk Kim i->state = NID_NEW; 1228e05df3b1SJaegeuk Kim 1229e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1230e05df3b1SJaegeuk Kim if (__lookup_free_nid_list(nid, &nm_i->free_nid_list)) { 1231e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1232e05df3b1SJaegeuk Kim kmem_cache_free(free_nid_slab, i); 1233e05df3b1SJaegeuk Kim return 0; 1234e05df3b1SJaegeuk Kim } 1235e05df3b1SJaegeuk Kim list_add_tail(&i->list, &nm_i->free_nid_list); 1236e05df3b1SJaegeuk Kim nm_i->fcnt++; 1237e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1238e05df3b1SJaegeuk Kim return 1; 1239e05df3b1SJaegeuk Kim } 1240e05df3b1SJaegeuk Kim 1241e05df3b1SJaegeuk Kim static void remove_free_nid(struct f2fs_nm_info *nm_i, nid_t nid) 1242e05df3b1SJaegeuk Kim { 1243e05df3b1SJaegeuk Kim struct free_nid *i; 1244e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1245e05df3b1SJaegeuk Kim i = __lookup_free_nid_list(nid, &nm_i->free_nid_list); 1246e05df3b1SJaegeuk Kim if (i && i->state == NID_NEW) { 1247e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1248e05df3b1SJaegeuk Kim nm_i->fcnt--; 1249e05df3b1SJaegeuk Kim } 1250e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1251e05df3b1SJaegeuk Kim } 1252e05df3b1SJaegeuk Kim 1253e05df3b1SJaegeuk Kim static int scan_nat_page(struct f2fs_nm_info *nm_i, 1254e05df3b1SJaegeuk Kim struct page *nat_page, nid_t start_nid) 1255e05df3b1SJaegeuk Kim { 1256e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk = page_address(nat_page); 1257e05df3b1SJaegeuk Kim block_t blk_addr; 1258e05df3b1SJaegeuk Kim int fcnt = 0; 1259e05df3b1SJaegeuk Kim int i; 1260e05df3b1SJaegeuk Kim 1261e05df3b1SJaegeuk Kim /* 0 nid should not be used */ 1262e05df3b1SJaegeuk Kim if (start_nid == 0) 1263e05df3b1SJaegeuk Kim ++start_nid; 1264e05df3b1SJaegeuk Kim 1265e05df3b1SJaegeuk Kim i = start_nid % NAT_ENTRY_PER_BLOCK; 1266e05df3b1SJaegeuk Kim 1267e05df3b1SJaegeuk Kim for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) { 1268e05df3b1SJaegeuk Kim blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr); 1269e05df3b1SJaegeuk Kim BUG_ON(blk_addr == NEW_ADDR); 1270e05df3b1SJaegeuk Kim if (blk_addr == NULL_ADDR) 1271e05df3b1SJaegeuk Kim fcnt += add_free_nid(nm_i, start_nid); 1272e05df3b1SJaegeuk Kim } 1273e05df3b1SJaegeuk Kim return fcnt; 1274e05df3b1SJaegeuk Kim } 1275e05df3b1SJaegeuk Kim 1276e05df3b1SJaegeuk Kim static void build_free_nids(struct f2fs_sb_info *sbi) 1277e05df3b1SJaegeuk Kim { 1278e05df3b1SJaegeuk Kim struct free_nid *fnid, *next_fnid; 1279e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1280e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1281e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 1282e05df3b1SJaegeuk Kim nid_t nid = 0; 1283e05df3b1SJaegeuk Kim bool is_cycled = false; 1284e05df3b1SJaegeuk Kim int fcnt = 0; 1285e05df3b1SJaegeuk Kim int i; 1286e05df3b1SJaegeuk Kim 1287e05df3b1SJaegeuk Kim nid = nm_i->next_scan_nid; 1288e05df3b1SJaegeuk Kim nm_i->init_scan_nid = nid; 1289e05df3b1SJaegeuk Kim 1290e05df3b1SJaegeuk Kim ra_nat_pages(sbi, nid); 1291e05df3b1SJaegeuk Kim 1292e05df3b1SJaegeuk Kim while (1) { 1293e05df3b1SJaegeuk Kim struct page *page = get_current_nat_page(sbi, nid); 1294e05df3b1SJaegeuk Kim 1295e05df3b1SJaegeuk Kim fcnt += scan_nat_page(nm_i, page, nid); 1296e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1297e05df3b1SJaegeuk Kim 1298e05df3b1SJaegeuk Kim nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK)); 1299e05df3b1SJaegeuk Kim 1300e05df3b1SJaegeuk Kim if (nid >= nm_i->max_nid) { 1301e05df3b1SJaegeuk Kim nid = 0; 1302e05df3b1SJaegeuk Kim is_cycled = true; 1303e05df3b1SJaegeuk Kim } 1304e05df3b1SJaegeuk Kim if (fcnt > MAX_FREE_NIDS) 1305e05df3b1SJaegeuk Kim break; 1306e05df3b1SJaegeuk Kim if (is_cycled && nm_i->init_scan_nid <= nid) 1307e05df3b1SJaegeuk Kim break; 1308e05df3b1SJaegeuk Kim } 1309e05df3b1SJaegeuk Kim 1310e05df3b1SJaegeuk Kim nm_i->next_scan_nid = nid; 1311e05df3b1SJaegeuk Kim 1312e05df3b1SJaegeuk Kim /* find free nids from current sum_pages */ 1313e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1314e05df3b1SJaegeuk Kim for (i = 0; i < nats_in_cursum(sum); i++) { 1315e05df3b1SJaegeuk Kim block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr); 1316e05df3b1SJaegeuk Kim nid = le32_to_cpu(nid_in_journal(sum, i)); 1317e05df3b1SJaegeuk Kim if (addr == NULL_ADDR) 1318e05df3b1SJaegeuk Kim add_free_nid(nm_i, nid); 1319e05df3b1SJaegeuk Kim else 1320e05df3b1SJaegeuk Kim remove_free_nid(nm_i, nid); 1321e05df3b1SJaegeuk Kim } 1322e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1323e05df3b1SJaegeuk Kim 1324e05df3b1SJaegeuk Kim /* remove the free nids from current allocated nids */ 1325e05df3b1SJaegeuk Kim list_for_each_entry_safe(fnid, next_fnid, &nm_i->free_nid_list, list) { 1326e05df3b1SJaegeuk Kim struct nat_entry *ne; 1327e05df3b1SJaegeuk Kim 1328e05df3b1SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 1329e05df3b1SJaegeuk Kim ne = __lookup_nat_cache(nm_i, fnid->nid); 1330e05df3b1SJaegeuk Kim if (ne && nat_get_blkaddr(ne) != NULL_ADDR) 1331e05df3b1SJaegeuk Kim remove_free_nid(nm_i, fnid->nid); 1332e05df3b1SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 1333e05df3b1SJaegeuk Kim } 1334e05df3b1SJaegeuk Kim } 1335e05df3b1SJaegeuk Kim 1336e05df3b1SJaegeuk Kim /* 1337e05df3b1SJaegeuk Kim * If this function returns success, caller can obtain a new nid 1338e05df3b1SJaegeuk Kim * from second parameter of this function. 1339e05df3b1SJaegeuk Kim * The returned nid could be used ino as well as nid when inode is created. 1340e05df3b1SJaegeuk Kim */ 1341e05df3b1SJaegeuk Kim bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid) 1342e05df3b1SJaegeuk Kim { 1343e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1344e05df3b1SJaegeuk Kim struct free_nid *i = NULL; 1345e05df3b1SJaegeuk Kim struct list_head *this; 1346e05df3b1SJaegeuk Kim retry: 1347e05df3b1SJaegeuk Kim mutex_lock(&nm_i->build_lock); 1348e05df3b1SJaegeuk Kim if (!nm_i->fcnt) { 1349e05df3b1SJaegeuk Kim /* scan NAT in order to build free nid list */ 1350e05df3b1SJaegeuk Kim build_free_nids(sbi); 1351e05df3b1SJaegeuk Kim if (!nm_i->fcnt) { 1352e05df3b1SJaegeuk Kim mutex_unlock(&nm_i->build_lock); 1353e05df3b1SJaegeuk Kim return false; 1354e05df3b1SJaegeuk Kim } 1355e05df3b1SJaegeuk Kim } 1356e05df3b1SJaegeuk Kim mutex_unlock(&nm_i->build_lock); 1357e05df3b1SJaegeuk Kim 1358e05df3b1SJaegeuk Kim /* 1359e05df3b1SJaegeuk Kim * We check fcnt again since previous check is racy as 1360e05df3b1SJaegeuk Kim * we didn't hold free_nid_list_lock. So other thread 1361e05df3b1SJaegeuk Kim * could consume all of free nids. 1362e05df3b1SJaegeuk Kim */ 1363e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1364e05df3b1SJaegeuk Kim if (!nm_i->fcnt) { 1365e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1366e05df3b1SJaegeuk Kim goto retry; 1367e05df3b1SJaegeuk Kim } 1368e05df3b1SJaegeuk Kim 1369e05df3b1SJaegeuk Kim BUG_ON(list_empty(&nm_i->free_nid_list)); 1370e05df3b1SJaegeuk Kim list_for_each(this, &nm_i->free_nid_list) { 1371e05df3b1SJaegeuk Kim i = list_entry(this, struct free_nid, list); 1372e05df3b1SJaegeuk Kim if (i->state == NID_NEW) 1373e05df3b1SJaegeuk Kim break; 1374e05df3b1SJaegeuk Kim } 1375e05df3b1SJaegeuk Kim 1376e05df3b1SJaegeuk Kim BUG_ON(i->state != NID_NEW); 1377e05df3b1SJaegeuk Kim *nid = i->nid; 1378e05df3b1SJaegeuk Kim i->state = NID_ALLOC; 1379e05df3b1SJaegeuk Kim nm_i->fcnt--; 1380e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1381e05df3b1SJaegeuk Kim return true; 1382e05df3b1SJaegeuk Kim } 1383e05df3b1SJaegeuk Kim 13840a8165d7SJaegeuk Kim /* 1385e05df3b1SJaegeuk Kim * alloc_nid() should be called prior to this function. 1386e05df3b1SJaegeuk Kim */ 1387e05df3b1SJaegeuk Kim void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid) 1388e05df3b1SJaegeuk Kim { 1389e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1390e05df3b1SJaegeuk Kim struct free_nid *i; 1391e05df3b1SJaegeuk Kim 1392e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1393e05df3b1SJaegeuk Kim i = __lookup_free_nid_list(nid, &nm_i->free_nid_list); 1394e05df3b1SJaegeuk Kim if (i) { 1395e05df3b1SJaegeuk Kim BUG_ON(i->state != NID_ALLOC); 1396e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1397e05df3b1SJaegeuk Kim } 1398e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1399e05df3b1SJaegeuk Kim } 1400e05df3b1SJaegeuk Kim 14010a8165d7SJaegeuk Kim /* 1402e05df3b1SJaegeuk Kim * alloc_nid() should be called prior to this function. 1403e05df3b1SJaegeuk Kim */ 1404e05df3b1SJaegeuk Kim void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid) 1405e05df3b1SJaegeuk Kim { 1406e05df3b1SJaegeuk Kim alloc_nid_done(sbi, nid); 1407e05df3b1SJaegeuk Kim add_free_nid(NM_I(sbi), nid); 1408e05df3b1SJaegeuk Kim } 1409e05df3b1SJaegeuk Kim 1410e05df3b1SJaegeuk Kim void recover_node_page(struct f2fs_sb_info *sbi, struct page *page, 1411e05df3b1SJaegeuk Kim struct f2fs_summary *sum, struct node_info *ni, 1412e05df3b1SJaegeuk Kim block_t new_blkaddr) 1413e05df3b1SJaegeuk Kim { 1414e05df3b1SJaegeuk Kim rewrite_node_page(sbi, page, sum, ni->blk_addr, new_blkaddr); 1415e05df3b1SJaegeuk Kim set_node_addr(sbi, ni, new_blkaddr); 1416e05df3b1SJaegeuk Kim clear_node_page_dirty(page); 1417e05df3b1SJaegeuk Kim } 1418e05df3b1SJaegeuk Kim 1419e05df3b1SJaegeuk Kim int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page) 1420e05df3b1SJaegeuk Kim { 1421e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 1422e05df3b1SJaegeuk Kim struct f2fs_node *src, *dst; 1423e05df3b1SJaegeuk Kim nid_t ino = ino_of_node(page); 1424e05df3b1SJaegeuk Kim struct node_info old_ni, new_ni; 1425e05df3b1SJaegeuk Kim struct page *ipage; 1426e05df3b1SJaegeuk Kim 1427e05df3b1SJaegeuk Kim ipage = grab_cache_page(mapping, ino); 1428e05df3b1SJaegeuk Kim if (!ipage) 1429e05df3b1SJaegeuk Kim return -ENOMEM; 1430e05df3b1SJaegeuk Kim 1431e05df3b1SJaegeuk Kim /* Should not use this inode from free nid list */ 1432e05df3b1SJaegeuk Kim remove_free_nid(NM_I(sbi), ino); 1433e05df3b1SJaegeuk Kim 1434e05df3b1SJaegeuk Kim get_node_info(sbi, ino, &old_ni); 1435e05df3b1SJaegeuk Kim SetPageUptodate(ipage); 1436e05df3b1SJaegeuk Kim fill_node_footer(ipage, ino, ino, 0, true); 1437e05df3b1SJaegeuk Kim 1438e05df3b1SJaegeuk Kim src = (struct f2fs_node *)page_address(page); 1439e05df3b1SJaegeuk Kim dst = (struct f2fs_node *)page_address(ipage); 1440e05df3b1SJaegeuk Kim 1441e05df3b1SJaegeuk Kim memcpy(dst, src, (unsigned long)&src->i.i_ext - (unsigned long)&src->i); 1442e05df3b1SJaegeuk Kim dst->i.i_size = 0; 144325ca923bSJaegeuk Kim dst->i.i_blocks = cpu_to_le64(1); 144425ca923bSJaegeuk Kim dst->i.i_links = cpu_to_le32(1); 1445e05df3b1SJaegeuk Kim dst->i.i_xattr_nid = 0; 1446e05df3b1SJaegeuk Kim 1447e05df3b1SJaegeuk Kim new_ni = old_ni; 1448e05df3b1SJaegeuk Kim new_ni.ino = ino; 1449e05df3b1SJaegeuk Kim 1450e05df3b1SJaegeuk Kim set_node_addr(sbi, &new_ni, NEW_ADDR); 1451e05df3b1SJaegeuk Kim inc_valid_inode_count(sbi); 1452e05df3b1SJaegeuk Kim 1453e05df3b1SJaegeuk Kim f2fs_put_page(ipage, 1); 1454e05df3b1SJaegeuk Kim return 0; 1455e05df3b1SJaegeuk Kim } 1456e05df3b1SJaegeuk Kim 1457e05df3b1SJaegeuk Kim int restore_node_summary(struct f2fs_sb_info *sbi, 1458e05df3b1SJaegeuk Kim unsigned int segno, struct f2fs_summary_block *sum) 1459e05df3b1SJaegeuk Kim { 1460e05df3b1SJaegeuk Kim struct f2fs_node *rn; 1461e05df3b1SJaegeuk Kim struct f2fs_summary *sum_entry; 1462e05df3b1SJaegeuk Kim struct page *page; 1463e05df3b1SJaegeuk Kim block_t addr; 1464e05df3b1SJaegeuk Kim int i, last_offset; 1465e05df3b1SJaegeuk Kim 1466e05df3b1SJaegeuk Kim /* alloc temporal page for read node */ 1467e05df3b1SJaegeuk Kim page = alloc_page(GFP_NOFS | __GFP_ZERO); 1468e05df3b1SJaegeuk Kim if (IS_ERR(page)) 1469e05df3b1SJaegeuk Kim return PTR_ERR(page); 1470e05df3b1SJaegeuk Kim lock_page(page); 1471e05df3b1SJaegeuk Kim 1472e05df3b1SJaegeuk Kim /* scan the node segment */ 1473e05df3b1SJaegeuk Kim last_offset = sbi->blocks_per_seg; 1474e05df3b1SJaegeuk Kim addr = START_BLOCK(sbi, segno); 1475e05df3b1SJaegeuk Kim sum_entry = &sum->entries[0]; 1476e05df3b1SJaegeuk Kim 1477e05df3b1SJaegeuk Kim for (i = 0; i < last_offset; i++, sum_entry++) { 1478e05df3b1SJaegeuk Kim if (f2fs_readpage(sbi, page, addr, READ_SYNC)) 1479e05df3b1SJaegeuk Kim goto out; 1480e05df3b1SJaegeuk Kim 1481e05df3b1SJaegeuk Kim rn = (struct f2fs_node *)page_address(page); 1482e05df3b1SJaegeuk Kim sum_entry->nid = rn->footer.nid; 1483e05df3b1SJaegeuk Kim sum_entry->version = 0; 1484e05df3b1SJaegeuk Kim sum_entry->ofs_in_node = 0; 1485e05df3b1SJaegeuk Kim addr++; 1486e05df3b1SJaegeuk Kim 1487e05df3b1SJaegeuk Kim /* 1488e05df3b1SJaegeuk Kim * In order to read next node page, 1489e05df3b1SJaegeuk Kim * we must clear PageUptodate flag. 1490e05df3b1SJaegeuk Kim */ 1491e05df3b1SJaegeuk Kim ClearPageUptodate(page); 1492e05df3b1SJaegeuk Kim } 1493e05df3b1SJaegeuk Kim out: 1494e05df3b1SJaegeuk Kim unlock_page(page); 1495e05df3b1SJaegeuk Kim __free_pages(page, 0); 1496e05df3b1SJaegeuk Kim return 0; 1497e05df3b1SJaegeuk Kim } 1498e05df3b1SJaegeuk Kim 1499e05df3b1SJaegeuk Kim static bool flush_nats_in_journal(struct f2fs_sb_info *sbi) 1500e05df3b1SJaegeuk Kim { 1501e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1502e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1503e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 1504e05df3b1SJaegeuk Kim int i; 1505e05df3b1SJaegeuk Kim 1506e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1507e05df3b1SJaegeuk Kim 1508e05df3b1SJaegeuk Kim if (nats_in_cursum(sum) < NAT_JOURNAL_ENTRIES) { 1509e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1510e05df3b1SJaegeuk Kim return false; 1511e05df3b1SJaegeuk Kim } 1512e05df3b1SJaegeuk Kim 1513e05df3b1SJaegeuk Kim for (i = 0; i < nats_in_cursum(sum); i++) { 1514e05df3b1SJaegeuk Kim struct nat_entry *ne; 1515e05df3b1SJaegeuk Kim struct f2fs_nat_entry raw_ne; 1516e05df3b1SJaegeuk Kim nid_t nid = le32_to_cpu(nid_in_journal(sum, i)); 1517e05df3b1SJaegeuk Kim 1518e05df3b1SJaegeuk Kim raw_ne = nat_in_journal(sum, i); 1519e05df3b1SJaegeuk Kim retry: 1520e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1521e05df3b1SJaegeuk Kim ne = __lookup_nat_cache(nm_i, nid); 1522e05df3b1SJaegeuk Kim if (ne) { 1523e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, ne); 1524e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1525e05df3b1SJaegeuk Kim continue; 1526e05df3b1SJaegeuk Kim } 1527e05df3b1SJaegeuk Kim ne = grab_nat_entry(nm_i, nid); 1528e05df3b1SJaegeuk Kim if (!ne) { 1529e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1530e05df3b1SJaegeuk Kim goto retry; 1531e05df3b1SJaegeuk Kim } 1532e05df3b1SJaegeuk Kim nat_set_blkaddr(ne, le32_to_cpu(raw_ne.block_addr)); 1533e05df3b1SJaegeuk Kim nat_set_ino(ne, le32_to_cpu(raw_ne.ino)); 1534e05df3b1SJaegeuk Kim nat_set_version(ne, raw_ne.version); 1535e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, ne); 1536e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1537e05df3b1SJaegeuk Kim } 1538e05df3b1SJaegeuk Kim update_nats_in_cursum(sum, -i); 1539e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1540e05df3b1SJaegeuk Kim return true; 1541e05df3b1SJaegeuk Kim } 1542e05df3b1SJaegeuk Kim 15430a8165d7SJaegeuk Kim /* 1544e05df3b1SJaegeuk Kim * This function is called during the checkpointing process. 1545e05df3b1SJaegeuk Kim */ 1546e05df3b1SJaegeuk Kim void flush_nat_entries(struct f2fs_sb_info *sbi) 1547e05df3b1SJaegeuk Kim { 1548e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1549e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1550e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 1551e05df3b1SJaegeuk Kim struct list_head *cur, *n; 1552e05df3b1SJaegeuk Kim struct page *page = NULL; 1553e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk = NULL; 1554e05df3b1SJaegeuk Kim nid_t start_nid = 0, end_nid = 0; 1555e05df3b1SJaegeuk Kim bool flushed; 1556e05df3b1SJaegeuk Kim 1557e05df3b1SJaegeuk Kim flushed = flush_nats_in_journal(sbi); 1558e05df3b1SJaegeuk Kim 1559e05df3b1SJaegeuk Kim if (!flushed) 1560e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1561e05df3b1SJaegeuk Kim 1562e05df3b1SJaegeuk Kim /* 1) flush dirty nat caches */ 1563e05df3b1SJaegeuk Kim list_for_each_safe(cur, n, &nm_i->dirty_nat_entries) { 1564e05df3b1SJaegeuk Kim struct nat_entry *ne; 1565e05df3b1SJaegeuk Kim nid_t nid; 1566e05df3b1SJaegeuk Kim struct f2fs_nat_entry raw_ne; 1567e05df3b1SJaegeuk Kim int offset = -1; 15682b50638dSJaegeuk Kim block_t new_blkaddr; 1569e05df3b1SJaegeuk Kim 1570e05df3b1SJaegeuk Kim ne = list_entry(cur, struct nat_entry, list); 1571e05df3b1SJaegeuk Kim nid = nat_get_nid(ne); 1572e05df3b1SJaegeuk Kim 1573e05df3b1SJaegeuk Kim if (nat_get_blkaddr(ne) == NEW_ADDR) 1574e05df3b1SJaegeuk Kim continue; 1575e05df3b1SJaegeuk Kim if (flushed) 1576e05df3b1SJaegeuk Kim goto to_nat_page; 1577e05df3b1SJaegeuk Kim 1578e05df3b1SJaegeuk Kim /* if there is room for nat enries in curseg->sumpage */ 1579e05df3b1SJaegeuk Kim offset = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 1); 1580e05df3b1SJaegeuk Kim if (offset >= 0) { 1581e05df3b1SJaegeuk Kim raw_ne = nat_in_journal(sum, offset); 1582e05df3b1SJaegeuk Kim goto flush_now; 1583e05df3b1SJaegeuk Kim } 1584e05df3b1SJaegeuk Kim to_nat_page: 1585e05df3b1SJaegeuk Kim if (!page || (start_nid > nid || nid > end_nid)) { 1586e05df3b1SJaegeuk Kim if (page) { 1587e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1588e05df3b1SJaegeuk Kim page = NULL; 1589e05df3b1SJaegeuk Kim } 1590e05df3b1SJaegeuk Kim start_nid = START_NID(nid); 1591e05df3b1SJaegeuk Kim end_nid = start_nid + NAT_ENTRY_PER_BLOCK - 1; 1592e05df3b1SJaegeuk Kim 1593e05df3b1SJaegeuk Kim /* 1594e05df3b1SJaegeuk Kim * get nat block with dirty flag, increased reference 1595e05df3b1SJaegeuk Kim * count, mapped and lock 1596e05df3b1SJaegeuk Kim */ 1597e05df3b1SJaegeuk Kim page = get_next_nat_page(sbi, start_nid); 1598e05df3b1SJaegeuk Kim nat_blk = page_address(page); 1599e05df3b1SJaegeuk Kim } 1600e05df3b1SJaegeuk Kim 1601e05df3b1SJaegeuk Kim BUG_ON(!nat_blk); 1602e05df3b1SJaegeuk Kim raw_ne = nat_blk->entries[nid - start_nid]; 1603e05df3b1SJaegeuk Kim flush_now: 1604e05df3b1SJaegeuk Kim new_blkaddr = nat_get_blkaddr(ne); 1605e05df3b1SJaegeuk Kim 1606e05df3b1SJaegeuk Kim raw_ne.ino = cpu_to_le32(nat_get_ino(ne)); 1607e05df3b1SJaegeuk Kim raw_ne.block_addr = cpu_to_le32(new_blkaddr); 1608e05df3b1SJaegeuk Kim raw_ne.version = nat_get_version(ne); 1609e05df3b1SJaegeuk Kim 1610e05df3b1SJaegeuk Kim if (offset < 0) { 1611e05df3b1SJaegeuk Kim nat_blk->entries[nid - start_nid] = raw_ne; 1612e05df3b1SJaegeuk Kim } else { 1613e05df3b1SJaegeuk Kim nat_in_journal(sum, offset) = raw_ne; 1614e05df3b1SJaegeuk Kim nid_in_journal(sum, offset) = cpu_to_le32(nid); 1615e05df3b1SJaegeuk Kim } 1616e05df3b1SJaegeuk Kim 1617e05df3b1SJaegeuk Kim if (nat_get_blkaddr(ne) == NULL_ADDR) { 1618e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1619e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, ne); 1620e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1621e05df3b1SJaegeuk Kim 1622e05df3b1SJaegeuk Kim /* We can reuse this freed nid at this point */ 1623e05df3b1SJaegeuk Kim add_free_nid(NM_I(sbi), nid); 1624e05df3b1SJaegeuk Kim } else { 1625e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1626e05df3b1SJaegeuk Kim __clear_nat_cache_dirty(nm_i, ne); 1627e05df3b1SJaegeuk Kim ne->checkpointed = true; 1628e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1629e05df3b1SJaegeuk Kim } 1630e05df3b1SJaegeuk Kim } 1631e05df3b1SJaegeuk Kim if (!flushed) 1632e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1633e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1634e05df3b1SJaegeuk Kim 1635e05df3b1SJaegeuk Kim /* 2) shrink nat caches if necessary */ 1636e05df3b1SJaegeuk Kim try_to_free_nats(sbi, nm_i->nat_cnt - NM_WOUT_THRESHOLD); 1637e05df3b1SJaegeuk Kim } 1638e05df3b1SJaegeuk Kim 1639e05df3b1SJaegeuk Kim static int init_node_manager(struct f2fs_sb_info *sbi) 1640e05df3b1SJaegeuk Kim { 1641e05df3b1SJaegeuk Kim struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi); 1642e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1643e05df3b1SJaegeuk Kim unsigned char *version_bitmap; 1644e05df3b1SJaegeuk Kim unsigned int nat_segs, nat_blocks; 1645e05df3b1SJaegeuk Kim 1646e05df3b1SJaegeuk Kim nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); 1647e05df3b1SJaegeuk Kim 1648e05df3b1SJaegeuk Kim /* segment_count_nat includes pair segment so divide to 2. */ 1649e05df3b1SJaegeuk Kim nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1; 1650e05df3b1SJaegeuk Kim nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); 1651e05df3b1SJaegeuk Kim nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks; 1652e05df3b1SJaegeuk Kim nm_i->fcnt = 0; 1653e05df3b1SJaegeuk Kim nm_i->nat_cnt = 0; 1654e05df3b1SJaegeuk Kim 1655e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->free_nid_list); 1656e05df3b1SJaegeuk Kim INIT_RADIX_TREE(&nm_i->nat_root, GFP_ATOMIC); 1657e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->nat_entries); 1658e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->dirty_nat_entries); 1659e05df3b1SJaegeuk Kim 1660e05df3b1SJaegeuk Kim mutex_init(&nm_i->build_lock); 1661e05df3b1SJaegeuk Kim spin_lock_init(&nm_i->free_nid_list_lock); 1662e05df3b1SJaegeuk Kim rwlock_init(&nm_i->nat_tree_lock); 1663e05df3b1SJaegeuk Kim 1664e05df3b1SJaegeuk Kim nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); 1665e05df3b1SJaegeuk Kim nm_i->init_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); 1666e05df3b1SJaegeuk Kim nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); 1667e05df3b1SJaegeuk Kim 1668e05df3b1SJaegeuk Kim nm_i->nat_bitmap = kzalloc(nm_i->bitmap_size, GFP_KERNEL); 1669e05df3b1SJaegeuk Kim if (!nm_i->nat_bitmap) 1670e05df3b1SJaegeuk Kim return -ENOMEM; 1671e05df3b1SJaegeuk Kim version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP); 1672e05df3b1SJaegeuk Kim if (!version_bitmap) 1673e05df3b1SJaegeuk Kim return -EFAULT; 1674e05df3b1SJaegeuk Kim 1675e05df3b1SJaegeuk Kim /* copy version bitmap */ 1676e05df3b1SJaegeuk Kim memcpy(nm_i->nat_bitmap, version_bitmap, nm_i->bitmap_size); 1677e05df3b1SJaegeuk Kim return 0; 1678e05df3b1SJaegeuk Kim } 1679e05df3b1SJaegeuk Kim 1680e05df3b1SJaegeuk Kim int build_node_manager(struct f2fs_sb_info *sbi) 1681e05df3b1SJaegeuk Kim { 1682e05df3b1SJaegeuk Kim int err; 1683e05df3b1SJaegeuk Kim 1684e05df3b1SJaegeuk Kim sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL); 1685e05df3b1SJaegeuk Kim if (!sbi->nm_info) 1686e05df3b1SJaegeuk Kim return -ENOMEM; 1687e05df3b1SJaegeuk Kim 1688e05df3b1SJaegeuk Kim err = init_node_manager(sbi); 1689e05df3b1SJaegeuk Kim if (err) 1690e05df3b1SJaegeuk Kim return err; 1691e05df3b1SJaegeuk Kim 1692e05df3b1SJaegeuk Kim build_free_nids(sbi); 1693e05df3b1SJaegeuk Kim return 0; 1694e05df3b1SJaegeuk Kim } 1695e05df3b1SJaegeuk Kim 1696e05df3b1SJaegeuk Kim void destroy_node_manager(struct f2fs_sb_info *sbi) 1697e05df3b1SJaegeuk Kim { 1698e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1699e05df3b1SJaegeuk Kim struct free_nid *i, *next_i; 1700e05df3b1SJaegeuk Kim struct nat_entry *natvec[NATVEC_SIZE]; 1701e05df3b1SJaegeuk Kim nid_t nid = 0; 1702e05df3b1SJaegeuk Kim unsigned int found; 1703e05df3b1SJaegeuk Kim 1704e05df3b1SJaegeuk Kim if (!nm_i) 1705e05df3b1SJaegeuk Kim return; 1706e05df3b1SJaegeuk Kim 1707e05df3b1SJaegeuk Kim /* destroy free nid list */ 1708e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1709e05df3b1SJaegeuk Kim list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { 1710e05df3b1SJaegeuk Kim BUG_ON(i->state == NID_ALLOC); 1711e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1712e05df3b1SJaegeuk Kim nm_i->fcnt--; 1713e05df3b1SJaegeuk Kim } 1714e05df3b1SJaegeuk Kim BUG_ON(nm_i->fcnt); 1715e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1716e05df3b1SJaegeuk Kim 1717e05df3b1SJaegeuk Kim /* destroy nat cache */ 1718e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1719e05df3b1SJaegeuk Kim while ((found = __gang_lookup_nat_cache(nm_i, 1720e05df3b1SJaegeuk Kim nid, NATVEC_SIZE, natvec))) { 1721e05df3b1SJaegeuk Kim unsigned idx; 1722e05df3b1SJaegeuk Kim for (idx = 0; idx < found; idx++) { 1723e05df3b1SJaegeuk Kim struct nat_entry *e = natvec[idx]; 1724e05df3b1SJaegeuk Kim nid = nat_get_nid(e) + 1; 1725e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, e); 1726e05df3b1SJaegeuk Kim } 1727e05df3b1SJaegeuk Kim } 1728e05df3b1SJaegeuk Kim BUG_ON(nm_i->nat_cnt); 1729e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1730e05df3b1SJaegeuk Kim 1731e05df3b1SJaegeuk Kim kfree(nm_i->nat_bitmap); 1732e05df3b1SJaegeuk Kim sbi->nm_info = NULL; 1733e05df3b1SJaegeuk Kim kfree(nm_i); 1734e05df3b1SJaegeuk Kim } 1735e05df3b1SJaegeuk Kim 17366e6093a8SNamjae Jeon int __init create_node_manager_caches(void) 1737e05df3b1SJaegeuk Kim { 1738e05df3b1SJaegeuk Kim nat_entry_slab = f2fs_kmem_cache_create("nat_entry", 1739e05df3b1SJaegeuk Kim sizeof(struct nat_entry), NULL); 1740e05df3b1SJaegeuk Kim if (!nat_entry_slab) 1741e05df3b1SJaegeuk Kim return -ENOMEM; 1742e05df3b1SJaegeuk Kim 1743e05df3b1SJaegeuk Kim free_nid_slab = f2fs_kmem_cache_create("free_nid", 1744e05df3b1SJaegeuk Kim sizeof(struct free_nid), NULL); 1745e05df3b1SJaegeuk Kim if (!free_nid_slab) { 1746e05df3b1SJaegeuk Kim kmem_cache_destroy(nat_entry_slab); 1747e05df3b1SJaegeuk Kim return -ENOMEM; 1748e05df3b1SJaegeuk Kim } 1749e05df3b1SJaegeuk Kim return 0; 1750e05df3b1SJaegeuk Kim } 1751e05df3b1SJaegeuk Kim 1752e05df3b1SJaegeuk Kim void destroy_node_manager_caches(void) 1753e05df3b1SJaegeuk Kim { 1754e05df3b1SJaegeuk Kim kmem_cache_destroy(free_nid_slab); 1755e05df3b1SJaegeuk Kim kmem_cache_destroy(nat_entry_slab); 1756e05df3b1SJaegeuk Kim } 1757