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