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" 2251dd6249SNamjae Jeon #include <trace/events/f2fs.h> 23e05df3b1SJaegeuk Kim 24e05df3b1SJaegeuk Kim static struct kmem_cache *nat_entry_slab; 25e05df3b1SJaegeuk Kim static struct kmem_cache *free_nid_slab; 26e05df3b1SJaegeuk Kim 27e05df3b1SJaegeuk Kim static void clear_node_page_dirty(struct page *page) 28e05df3b1SJaegeuk Kim { 29e05df3b1SJaegeuk Kim struct address_space *mapping = page->mapping; 30e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 31e05df3b1SJaegeuk Kim unsigned int long flags; 32e05df3b1SJaegeuk Kim 33e05df3b1SJaegeuk Kim if (PageDirty(page)) { 34e05df3b1SJaegeuk Kim spin_lock_irqsave(&mapping->tree_lock, flags); 35e05df3b1SJaegeuk Kim radix_tree_tag_clear(&mapping->page_tree, 36e05df3b1SJaegeuk Kim page_index(page), 37e05df3b1SJaegeuk Kim PAGECACHE_TAG_DIRTY); 38e05df3b1SJaegeuk Kim spin_unlock_irqrestore(&mapping->tree_lock, flags); 39e05df3b1SJaegeuk Kim 40e05df3b1SJaegeuk Kim clear_page_dirty_for_io(page); 41e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 42e05df3b1SJaegeuk Kim } 43e05df3b1SJaegeuk Kim ClearPageUptodate(page); 44e05df3b1SJaegeuk Kim } 45e05df3b1SJaegeuk Kim 46e05df3b1SJaegeuk Kim static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid) 47e05df3b1SJaegeuk Kim { 48e05df3b1SJaegeuk Kim pgoff_t index = current_nat_addr(sbi, nid); 49e05df3b1SJaegeuk Kim return get_meta_page(sbi, index); 50e05df3b1SJaegeuk Kim } 51e05df3b1SJaegeuk Kim 52e05df3b1SJaegeuk Kim static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid) 53e05df3b1SJaegeuk Kim { 54e05df3b1SJaegeuk Kim struct page *src_page; 55e05df3b1SJaegeuk Kim struct page *dst_page; 56e05df3b1SJaegeuk Kim pgoff_t src_off; 57e05df3b1SJaegeuk Kim pgoff_t dst_off; 58e05df3b1SJaegeuk Kim void *src_addr; 59e05df3b1SJaegeuk Kim void *dst_addr; 60e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 61e05df3b1SJaegeuk Kim 62e05df3b1SJaegeuk Kim src_off = current_nat_addr(sbi, nid); 63e05df3b1SJaegeuk Kim dst_off = next_nat_addr(sbi, src_off); 64e05df3b1SJaegeuk Kim 65e05df3b1SJaegeuk Kim /* get current nat block page with lock */ 66e05df3b1SJaegeuk Kim src_page = get_meta_page(sbi, src_off); 67e05df3b1SJaegeuk Kim 68e05df3b1SJaegeuk Kim /* Dirty src_page means that it is already the new target NAT page. */ 69e05df3b1SJaegeuk Kim if (PageDirty(src_page)) 70e05df3b1SJaegeuk Kim return src_page; 71e05df3b1SJaegeuk Kim 72e05df3b1SJaegeuk Kim dst_page = grab_meta_page(sbi, dst_off); 73e05df3b1SJaegeuk Kim 74e05df3b1SJaegeuk Kim src_addr = page_address(src_page); 75e05df3b1SJaegeuk Kim dst_addr = page_address(dst_page); 76e05df3b1SJaegeuk Kim memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE); 77e05df3b1SJaegeuk Kim set_page_dirty(dst_page); 78e05df3b1SJaegeuk Kim f2fs_put_page(src_page, 1); 79e05df3b1SJaegeuk Kim 80e05df3b1SJaegeuk Kim set_to_next_nat(nm_i, nid); 81e05df3b1SJaegeuk Kim 82e05df3b1SJaegeuk Kim return dst_page; 83e05df3b1SJaegeuk Kim } 84e05df3b1SJaegeuk Kim 850a8165d7SJaegeuk Kim /* 86e05df3b1SJaegeuk Kim * Readahead NAT pages 87e05df3b1SJaegeuk Kim */ 88e05df3b1SJaegeuk Kim static void ra_nat_pages(struct f2fs_sb_info *sbi, int nid) 89e05df3b1SJaegeuk Kim { 90e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->meta_inode->i_mapping; 91e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 92e05df3b1SJaegeuk Kim struct page *page; 93e05df3b1SJaegeuk Kim pgoff_t index; 94e05df3b1SJaegeuk Kim int i; 95458e6197SJaegeuk Kim struct f2fs_io_info fio = { 96458e6197SJaegeuk Kim .type = META, 977e8f2308SGu Zheng .rw = READ_SYNC | REQ_META | REQ_PRIO 98458e6197SJaegeuk Kim }; 99458e6197SJaegeuk Kim 100e05df3b1SJaegeuk Kim 101e05df3b1SJaegeuk Kim for (i = 0; i < FREE_NID_PAGES; i++, nid += NAT_ENTRY_PER_BLOCK) { 102cfb271d4SChao Yu if (unlikely(nid >= nm_i->max_nid)) 103e05df3b1SJaegeuk Kim nid = 0; 104e05df3b1SJaegeuk Kim index = current_nat_addr(sbi, nid); 105e05df3b1SJaegeuk Kim 106e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, index); 107e05df3b1SJaegeuk Kim if (!page) 108e05df3b1SJaegeuk Kim continue; 109393ff91fSJaegeuk Kim if (PageUptodate(page)) { 1107107e0a9SJaegeuk Kim mark_page_accessed(page); 111e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 112e05df3b1SJaegeuk Kim continue; 113e05df3b1SJaegeuk Kim } 114458e6197SJaegeuk Kim f2fs_submit_page_mbio(sbi, page, index, &fio); 1157107e0a9SJaegeuk Kim mark_page_accessed(page); 116369a708cSJaegeuk Kim f2fs_put_page(page, 0); 117e05df3b1SJaegeuk Kim } 118458e6197SJaegeuk Kim f2fs_submit_merged_bio(sbi, META, READ); 119e05df3b1SJaegeuk Kim } 120e05df3b1SJaegeuk Kim 121e05df3b1SJaegeuk Kim static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) 122e05df3b1SJaegeuk Kim { 123e05df3b1SJaegeuk Kim return radix_tree_lookup(&nm_i->nat_root, n); 124e05df3b1SJaegeuk Kim } 125e05df3b1SJaegeuk Kim 126e05df3b1SJaegeuk Kim static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, 127e05df3b1SJaegeuk Kim nid_t start, unsigned int nr, struct nat_entry **ep) 128e05df3b1SJaegeuk Kim { 129e05df3b1SJaegeuk Kim return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); 130e05df3b1SJaegeuk Kim } 131e05df3b1SJaegeuk Kim 132e05df3b1SJaegeuk Kim static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) 133e05df3b1SJaegeuk Kim { 134e05df3b1SJaegeuk Kim list_del(&e->list); 135e05df3b1SJaegeuk Kim radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); 136e05df3b1SJaegeuk Kim nm_i->nat_cnt--; 137e05df3b1SJaegeuk Kim kmem_cache_free(nat_entry_slab, e); 138e05df3b1SJaegeuk Kim } 139e05df3b1SJaegeuk Kim 140e05df3b1SJaegeuk Kim int is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid) 141e05df3b1SJaegeuk Kim { 142e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 143e05df3b1SJaegeuk Kim struct nat_entry *e; 144e05df3b1SJaegeuk Kim int is_cp = 1; 145e05df3b1SJaegeuk Kim 146e05df3b1SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 147e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 148e05df3b1SJaegeuk Kim if (e && !e->checkpointed) 149e05df3b1SJaegeuk Kim is_cp = 0; 150e05df3b1SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 151e05df3b1SJaegeuk Kim return is_cp; 152e05df3b1SJaegeuk Kim } 153e05df3b1SJaegeuk Kim 154e05df3b1SJaegeuk Kim static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid) 155e05df3b1SJaegeuk Kim { 156e05df3b1SJaegeuk Kim struct nat_entry *new; 157e05df3b1SJaegeuk Kim 158e05df3b1SJaegeuk Kim new = kmem_cache_alloc(nat_entry_slab, GFP_ATOMIC); 159e05df3b1SJaegeuk Kim if (!new) 160e05df3b1SJaegeuk Kim return NULL; 161e05df3b1SJaegeuk Kim if (radix_tree_insert(&nm_i->nat_root, nid, new)) { 162e05df3b1SJaegeuk Kim kmem_cache_free(nat_entry_slab, new); 163e05df3b1SJaegeuk Kim return NULL; 164e05df3b1SJaegeuk Kim } 165e05df3b1SJaegeuk Kim memset(new, 0, sizeof(struct nat_entry)); 166e05df3b1SJaegeuk Kim nat_set_nid(new, nid); 167e05df3b1SJaegeuk Kim list_add_tail(&new->list, &nm_i->nat_entries); 168e05df3b1SJaegeuk Kim nm_i->nat_cnt++; 169e05df3b1SJaegeuk Kim return new; 170e05df3b1SJaegeuk Kim } 171e05df3b1SJaegeuk Kim 172e05df3b1SJaegeuk Kim static void cache_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid, 173e05df3b1SJaegeuk Kim struct f2fs_nat_entry *ne) 174e05df3b1SJaegeuk Kim { 175e05df3b1SJaegeuk Kim struct nat_entry *e; 176e05df3b1SJaegeuk Kim retry: 177e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 178e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 179e05df3b1SJaegeuk Kim if (!e) { 180e05df3b1SJaegeuk Kim e = grab_nat_entry(nm_i, nid); 181e05df3b1SJaegeuk Kim if (!e) { 182e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 183e05df3b1SJaegeuk Kim goto retry; 184e05df3b1SJaegeuk Kim } 185e05df3b1SJaegeuk Kim nat_set_blkaddr(e, le32_to_cpu(ne->block_addr)); 186e05df3b1SJaegeuk Kim nat_set_ino(e, le32_to_cpu(ne->ino)); 187e05df3b1SJaegeuk Kim nat_set_version(e, ne->version); 188e05df3b1SJaegeuk Kim e->checkpointed = true; 189e05df3b1SJaegeuk Kim } 190e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 191e05df3b1SJaegeuk Kim } 192e05df3b1SJaegeuk Kim 193e05df3b1SJaegeuk Kim static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni, 194e05df3b1SJaegeuk Kim block_t new_blkaddr) 195e05df3b1SJaegeuk Kim { 196e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 197e05df3b1SJaegeuk Kim struct nat_entry *e; 198e05df3b1SJaegeuk Kim retry: 199e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 200e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, ni->nid); 201e05df3b1SJaegeuk Kim if (!e) { 202e05df3b1SJaegeuk Kim e = grab_nat_entry(nm_i, ni->nid); 203e05df3b1SJaegeuk Kim if (!e) { 204e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 205e05df3b1SJaegeuk Kim goto retry; 206e05df3b1SJaegeuk Kim } 207e05df3b1SJaegeuk Kim e->ni = *ni; 208e05df3b1SJaegeuk Kim e->checkpointed = true; 2095d56b671SJaegeuk Kim f2fs_bug_on(ni->blk_addr == NEW_ADDR); 210e05df3b1SJaegeuk Kim } else if (new_blkaddr == NEW_ADDR) { 211e05df3b1SJaegeuk Kim /* 212e05df3b1SJaegeuk Kim * when nid is reallocated, 213e05df3b1SJaegeuk Kim * previous nat entry can be remained in nat cache. 214e05df3b1SJaegeuk Kim * So, reinitialize it with new information. 215e05df3b1SJaegeuk Kim */ 216e05df3b1SJaegeuk Kim e->ni = *ni; 2175d56b671SJaegeuk Kim f2fs_bug_on(ni->blk_addr != NULL_ADDR); 218e05df3b1SJaegeuk Kim } 219e05df3b1SJaegeuk Kim 220e05df3b1SJaegeuk Kim if (new_blkaddr == NEW_ADDR) 221e05df3b1SJaegeuk Kim e->checkpointed = false; 222e05df3b1SJaegeuk Kim 223e05df3b1SJaegeuk Kim /* sanity check */ 2245d56b671SJaegeuk Kim f2fs_bug_on(nat_get_blkaddr(e) != ni->blk_addr); 2255d56b671SJaegeuk Kim f2fs_bug_on(nat_get_blkaddr(e) == NULL_ADDR && 226e05df3b1SJaegeuk Kim new_blkaddr == NULL_ADDR); 2275d56b671SJaegeuk Kim f2fs_bug_on(nat_get_blkaddr(e) == NEW_ADDR && 228e05df3b1SJaegeuk Kim new_blkaddr == NEW_ADDR); 2295d56b671SJaegeuk Kim f2fs_bug_on(nat_get_blkaddr(e) != NEW_ADDR && 230e05df3b1SJaegeuk Kim nat_get_blkaddr(e) != NULL_ADDR && 231e05df3b1SJaegeuk Kim new_blkaddr == NEW_ADDR); 232e05df3b1SJaegeuk Kim 233e05df3b1SJaegeuk Kim /* increament version no as node is removed */ 234e05df3b1SJaegeuk Kim if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) { 235e05df3b1SJaegeuk Kim unsigned char version = nat_get_version(e); 236e05df3b1SJaegeuk Kim nat_set_version(e, inc_node_version(version)); 237e05df3b1SJaegeuk Kim } 238e05df3b1SJaegeuk Kim 239e05df3b1SJaegeuk Kim /* change address */ 240e05df3b1SJaegeuk Kim nat_set_blkaddr(e, new_blkaddr); 241e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, e); 242e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 243e05df3b1SJaegeuk Kim } 244e05df3b1SJaegeuk Kim 2454660f9c0SJaegeuk Kim int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink) 246e05df3b1SJaegeuk Kim { 247e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 248e05df3b1SJaegeuk Kim 2496cac3759SHaicheng Li if (nm_i->nat_cnt <= NM_WOUT_THRESHOLD) 250e05df3b1SJaegeuk Kim return 0; 251e05df3b1SJaegeuk Kim 252e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 253e05df3b1SJaegeuk Kim while (nr_shrink && !list_empty(&nm_i->nat_entries)) { 254e05df3b1SJaegeuk Kim struct nat_entry *ne; 255e05df3b1SJaegeuk Kim ne = list_first_entry(&nm_i->nat_entries, 256e05df3b1SJaegeuk Kim struct nat_entry, list); 257e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, ne); 258e05df3b1SJaegeuk Kim nr_shrink--; 259e05df3b1SJaegeuk Kim } 260e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 261e05df3b1SJaegeuk Kim return nr_shrink; 262e05df3b1SJaegeuk Kim } 263e05df3b1SJaegeuk Kim 2640a8165d7SJaegeuk Kim /* 265e05df3b1SJaegeuk Kim * This function returns always success 266e05df3b1SJaegeuk Kim */ 267e05df3b1SJaegeuk Kim void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni) 268e05df3b1SJaegeuk Kim { 269e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 270e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 271e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 272e05df3b1SJaegeuk Kim nid_t start_nid = START_NID(nid); 273e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk; 274e05df3b1SJaegeuk Kim struct page *page = NULL; 275e05df3b1SJaegeuk Kim struct f2fs_nat_entry ne; 276e05df3b1SJaegeuk Kim struct nat_entry *e; 277e05df3b1SJaegeuk Kim int i; 278e05df3b1SJaegeuk Kim 279be4124f8SNamjae Jeon memset(&ne, 0, sizeof(struct f2fs_nat_entry)); 280e05df3b1SJaegeuk Kim ni->nid = nid; 281e05df3b1SJaegeuk Kim 282e05df3b1SJaegeuk Kim /* Check nat cache */ 283e05df3b1SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 284e05df3b1SJaegeuk Kim e = __lookup_nat_cache(nm_i, nid); 285e05df3b1SJaegeuk Kim if (e) { 286e05df3b1SJaegeuk Kim ni->ino = nat_get_ino(e); 287e05df3b1SJaegeuk Kim ni->blk_addr = nat_get_blkaddr(e); 288e05df3b1SJaegeuk Kim ni->version = nat_get_version(e); 289e05df3b1SJaegeuk Kim } 290e05df3b1SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 291e05df3b1SJaegeuk Kim if (e) 292e05df3b1SJaegeuk Kim return; 293e05df3b1SJaegeuk Kim 294e05df3b1SJaegeuk Kim /* Check current segment summary */ 295e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 296e05df3b1SJaegeuk Kim i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0); 297e05df3b1SJaegeuk Kim if (i >= 0) { 298e05df3b1SJaegeuk Kim ne = nat_in_journal(sum, i); 299e05df3b1SJaegeuk Kim node_info_from_raw_nat(ni, &ne); 300e05df3b1SJaegeuk Kim } 301e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 302e05df3b1SJaegeuk Kim if (i >= 0) 303e05df3b1SJaegeuk Kim goto cache; 304e05df3b1SJaegeuk Kim 305e05df3b1SJaegeuk Kim /* Fill node_info from nat page */ 306e05df3b1SJaegeuk Kim page = get_current_nat_page(sbi, start_nid); 307e05df3b1SJaegeuk Kim nat_blk = (struct f2fs_nat_block *)page_address(page); 308e05df3b1SJaegeuk Kim ne = nat_blk->entries[nid - start_nid]; 309e05df3b1SJaegeuk Kim node_info_from_raw_nat(ni, &ne); 310e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 311e05df3b1SJaegeuk Kim cache: 312e05df3b1SJaegeuk Kim /* cache nat entry */ 313e05df3b1SJaegeuk Kim cache_nat_entry(NM_I(sbi), nid, &ne); 314e05df3b1SJaegeuk Kim } 315e05df3b1SJaegeuk Kim 3160a8165d7SJaegeuk Kim /* 317e05df3b1SJaegeuk Kim * The maximum depth is four. 318e05df3b1SJaegeuk Kim * Offset[0] will have raw inode offset. 319e05df3b1SJaegeuk Kim */ 320de93653fSJaegeuk Kim static int get_node_path(struct f2fs_inode_info *fi, long block, 321de93653fSJaegeuk Kim int offset[4], unsigned int noffset[4]) 322e05df3b1SJaegeuk Kim { 323de93653fSJaegeuk Kim const long direct_index = ADDRS_PER_INODE(fi); 324e05df3b1SJaegeuk Kim const long direct_blks = ADDRS_PER_BLOCK; 325e05df3b1SJaegeuk Kim const long dptrs_per_blk = NIDS_PER_BLOCK; 326e05df3b1SJaegeuk Kim const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK; 327e05df3b1SJaegeuk Kim const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; 328e05df3b1SJaegeuk Kim int n = 0; 329e05df3b1SJaegeuk Kim int level = 0; 330e05df3b1SJaegeuk Kim 331e05df3b1SJaegeuk Kim noffset[0] = 0; 332e05df3b1SJaegeuk Kim 333e05df3b1SJaegeuk Kim if (block < direct_index) { 33425c0a6e5SNamjae Jeon offset[n] = block; 335e05df3b1SJaegeuk Kim goto got; 336e05df3b1SJaegeuk Kim } 337e05df3b1SJaegeuk Kim block -= direct_index; 338e05df3b1SJaegeuk Kim if (block < direct_blks) { 339e05df3b1SJaegeuk Kim offset[n++] = NODE_DIR1_BLOCK; 340e05df3b1SJaegeuk Kim noffset[n] = 1; 34125c0a6e5SNamjae Jeon offset[n] = block; 342e05df3b1SJaegeuk Kim level = 1; 343e05df3b1SJaegeuk Kim goto got; 344e05df3b1SJaegeuk Kim } 345e05df3b1SJaegeuk Kim block -= direct_blks; 346e05df3b1SJaegeuk Kim if (block < direct_blks) { 347e05df3b1SJaegeuk Kim offset[n++] = NODE_DIR2_BLOCK; 348e05df3b1SJaegeuk Kim noffset[n] = 2; 34925c0a6e5SNamjae Jeon offset[n] = block; 350e05df3b1SJaegeuk Kim level = 1; 351e05df3b1SJaegeuk Kim goto got; 352e05df3b1SJaegeuk Kim } 353e05df3b1SJaegeuk Kim block -= direct_blks; 354e05df3b1SJaegeuk Kim if (block < indirect_blks) { 355e05df3b1SJaegeuk Kim offset[n++] = NODE_IND1_BLOCK; 356e05df3b1SJaegeuk Kim noffset[n] = 3; 357e05df3b1SJaegeuk Kim offset[n++] = block / direct_blks; 358e05df3b1SJaegeuk Kim noffset[n] = 4 + offset[n - 1]; 35925c0a6e5SNamjae Jeon offset[n] = block % direct_blks; 360e05df3b1SJaegeuk Kim level = 2; 361e05df3b1SJaegeuk Kim goto got; 362e05df3b1SJaegeuk Kim } 363e05df3b1SJaegeuk Kim block -= indirect_blks; 364e05df3b1SJaegeuk Kim if (block < indirect_blks) { 365e05df3b1SJaegeuk Kim offset[n++] = NODE_IND2_BLOCK; 366e05df3b1SJaegeuk Kim noffset[n] = 4 + dptrs_per_blk; 367e05df3b1SJaegeuk Kim offset[n++] = block / direct_blks; 368e05df3b1SJaegeuk Kim noffset[n] = 5 + dptrs_per_blk + offset[n - 1]; 36925c0a6e5SNamjae Jeon offset[n] = block % direct_blks; 370e05df3b1SJaegeuk Kim level = 2; 371e05df3b1SJaegeuk Kim goto got; 372e05df3b1SJaegeuk Kim } 373e05df3b1SJaegeuk Kim block -= indirect_blks; 374e05df3b1SJaegeuk Kim if (block < dindirect_blks) { 375e05df3b1SJaegeuk Kim offset[n++] = NODE_DIND_BLOCK; 376e05df3b1SJaegeuk Kim noffset[n] = 5 + (dptrs_per_blk * 2); 377e05df3b1SJaegeuk Kim offset[n++] = block / indirect_blks; 378e05df3b1SJaegeuk Kim noffset[n] = 6 + (dptrs_per_blk * 2) + 379e05df3b1SJaegeuk Kim offset[n - 1] * (dptrs_per_blk + 1); 380e05df3b1SJaegeuk Kim offset[n++] = (block / direct_blks) % dptrs_per_blk; 381e05df3b1SJaegeuk Kim noffset[n] = 7 + (dptrs_per_blk * 2) + 382e05df3b1SJaegeuk Kim offset[n - 2] * (dptrs_per_blk + 1) + 383e05df3b1SJaegeuk Kim offset[n - 1]; 38425c0a6e5SNamjae Jeon offset[n] = block % direct_blks; 385e05df3b1SJaegeuk Kim level = 3; 386e05df3b1SJaegeuk Kim goto got; 387e05df3b1SJaegeuk Kim } else { 388e05df3b1SJaegeuk Kim BUG(); 389e05df3b1SJaegeuk Kim } 390e05df3b1SJaegeuk Kim got: 391e05df3b1SJaegeuk Kim return level; 392e05df3b1SJaegeuk Kim } 393e05df3b1SJaegeuk Kim 394e05df3b1SJaegeuk Kim /* 395e05df3b1SJaegeuk Kim * Caller should call f2fs_put_dnode(dn). 3964f4124d0SChao Yu * Also, it should grab and release a rwsem by calling f2fs_lock_op() and 3974f4124d0SChao Yu * f2fs_unlock_op() only if ro is not set RDONLY_NODE. 39839936837SJaegeuk Kim * In the case of RDONLY_NODE, we don't need to care about mutex. 399e05df3b1SJaegeuk Kim */ 400266e97a8SJaegeuk Kim int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode) 401e05df3b1SJaegeuk Kim { 402e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 403e05df3b1SJaegeuk Kim struct page *npage[4]; 404e05df3b1SJaegeuk Kim struct page *parent; 405e05df3b1SJaegeuk Kim int offset[4]; 406e05df3b1SJaegeuk Kim unsigned int noffset[4]; 407e05df3b1SJaegeuk Kim nid_t nids[4]; 408e05df3b1SJaegeuk Kim int level, i; 409e05df3b1SJaegeuk Kim int err = 0; 410e05df3b1SJaegeuk Kim 411de93653fSJaegeuk Kim level = get_node_path(F2FS_I(dn->inode), index, offset, noffset); 412e05df3b1SJaegeuk Kim 413e05df3b1SJaegeuk Kim nids[0] = dn->inode->i_ino; 4141646cfacSJaegeuk Kim npage[0] = dn->inode_page; 4151646cfacSJaegeuk Kim 4161646cfacSJaegeuk Kim if (!npage[0]) { 417e05df3b1SJaegeuk Kim npage[0] = get_node_page(sbi, nids[0]); 418e05df3b1SJaegeuk Kim if (IS_ERR(npage[0])) 419e05df3b1SJaegeuk Kim return PTR_ERR(npage[0]); 4201646cfacSJaegeuk Kim } 421e05df3b1SJaegeuk Kim parent = npage[0]; 42252c2db3fSChangman Lee if (level != 0) 423e05df3b1SJaegeuk Kim nids[1] = get_nid(parent, offset[0], true); 424e05df3b1SJaegeuk Kim dn->inode_page = npage[0]; 425e05df3b1SJaegeuk Kim dn->inode_page_locked = true; 426e05df3b1SJaegeuk Kim 427e05df3b1SJaegeuk Kim /* get indirect or direct nodes */ 428e05df3b1SJaegeuk Kim for (i = 1; i <= level; i++) { 429e05df3b1SJaegeuk Kim bool done = false; 430e05df3b1SJaegeuk Kim 431266e97a8SJaegeuk Kim if (!nids[i] && mode == ALLOC_NODE) { 432e05df3b1SJaegeuk Kim /* alloc new node */ 433e05df3b1SJaegeuk Kim if (!alloc_nid(sbi, &(nids[i]))) { 434e05df3b1SJaegeuk Kim err = -ENOSPC; 435e05df3b1SJaegeuk Kim goto release_pages; 436e05df3b1SJaegeuk Kim } 437e05df3b1SJaegeuk Kim 438e05df3b1SJaegeuk Kim dn->nid = nids[i]; 4398ae8f162SJaegeuk Kim npage[i] = new_node_page(dn, noffset[i], NULL); 440e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 441e05df3b1SJaegeuk Kim alloc_nid_failed(sbi, nids[i]); 442e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 443e05df3b1SJaegeuk Kim goto release_pages; 444e05df3b1SJaegeuk Kim } 445e05df3b1SJaegeuk Kim 446e05df3b1SJaegeuk Kim set_nid(parent, offset[i - 1], nids[i], i == 1); 447e05df3b1SJaegeuk Kim alloc_nid_done(sbi, nids[i]); 448e05df3b1SJaegeuk Kim done = true; 449266e97a8SJaegeuk Kim } else if (mode == LOOKUP_NODE_RA && i == level && level > 1) { 450e05df3b1SJaegeuk Kim npage[i] = get_node_page_ra(parent, offset[i - 1]); 451e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 452e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 453e05df3b1SJaegeuk Kim goto release_pages; 454e05df3b1SJaegeuk Kim } 455e05df3b1SJaegeuk Kim done = true; 456e05df3b1SJaegeuk Kim } 457e05df3b1SJaegeuk Kim if (i == 1) { 458e05df3b1SJaegeuk Kim dn->inode_page_locked = false; 459e05df3b1SJaegeuk Kim unlock_page(parent); 460e05df3b1SJaegeuk Kim } else { 461e05df3b1SJaegeuk Kim f2fs_put_page(parent, 1); 462e05df3b1SJaegeuk Kim } 463e05df3b1SJaegeuk Kim 464e05df3b1SJaegeuk Kim if (!done) { 465e05df3b1SJaegeuk Kim npage[i] = get_node_page(sbi, nids[i]); 466e05df3b1SJaegeuk Kim if (IS_ERR(npage[i])) { 467e05df3b1SJaegeuk Kim err = PTR_ERR(npage[i]); 468e05df3b1SJaegeuk Kim f2fs_put_page(npage[0], 0); 469e05df3b1SJaegeuk Kim goto release_out; 470e05df3b1SJaegeuk Kim } 471e05df3b1SJaegeuk Kim } 472e05df3b1SJaegeuk Kim if (i < level) { 473e05df3b1SJaegeuk Kim parent = npage[i]; 474e05df3b1SJaegeuk Kim nids[i + 1] = get_nid(parent, offset[i], false); 475e05df3b1SJaegeuk Kim } 476e05df3b1SJaegeuk Kim } 477e05df3b1SJaegeuk Kim dn->nid = nids[level]; 478e05df3b1SJaegeuk Kim dn->ofs_in_node = offset[level]; 479e05df3b1SJaegeuk Kim dn->node_page = npage[level]; 480e05df3b1SJaegeuk Kim dn->data_blkaddr = datablock_addr(dn->node_page, dn->ofs_in_node); 481e05df3b1SJaegeuk Kim return 0; 482e05df3b1SJaegeuk Kim 483e05df3b1SJaegeuk Kim release_pages: 484e05df3b1SJaegeuk Kim f2fs_put_page(parent, 1); 485e05df3b1SJaegeuk Kim if (i > 1) 486e05df3b1SJaegeuk Kim f2fs_put_page(npage[0], 0); 487e05df3b1SJaegeuk Kim release_out: 488e05df3b1SJaegeuk Kim dn->inode_page = NULL; 489e05df3b1SJaegeuk Kim dn->node_page = NULL; 490e05df3b1SJaegeuk Kim return err; 491e05df3b1SJaegeuk Kim } 492e05df3b1SJaegeuk Kim 493e05df3b1SJaegeuk Kim static void truncate_node(struct dnode_of_data *dn) 494e05df3b1SJaegeuk Kim { 495e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 496e05df3b1SJaegeuk Kim struct node_info ni; 497e05df3b1SJaegeuk Kim 498e05df3b1SJaegeuk Kim get_node_info(sbi, dn->nid, &ni); 49971e9fec5SJaegeuk Kim if (dn->inode->i_blocks == 0) { 5005d56b671SJaegeuk Kim f2fs_bug_on(ni.blk_addr != NULL_ADDR); 50171e9fec5SJaegeuk Kim goto invalidate; 50271e9fec5SJaegeuk Kim } 5035d56b671SJaegeuk Kim f2fs_bug_on(ni.blk_addr == NULL_ADDR); 504e05df3b1SJaegeuk Kim 505e05df3b1SJaegeuk Kim /* Deallocate node address */ 50671e9fec5SJaegeuk Kim invalidate_blocks(sbi, ni.blk_addr); 507ef86d709SGu Zheng dec_valid_node_count(sbi, dn->inode); 508e05df3b1SJaegeuk Kim set_node_addr(sbi, &ni, NULL_ADDR); 509e05df3b1SJaegeuk Kim 510e05df3b1SJaegeuk Kim if (dn->nid == dn->inode->i_ino) { 511e05df3b1SJaegeuk Kim remove_orphan_inode(sbi, dn->nid); 512e05df3b1SJaegeuk Kim dec_valid_inode_count(sbi); 513e05df3b1SJaegeuk Kim } else { 514e05df3b1SJaegeuk Kim sync_inode_page(dn); 515e05df3b1SJaegeuk Kim } 51671e9fec5SJaegeuk Kim invalidate: 517e05df3b1SJaegeuk Kim clear_node_page_dirty(dn->node_page); 518e05df3b1SJaegeuk Kim F2FS_SET_SB_DIRT(sbi); 519e05df3b1SJaegeuk Kim 520e05df3b1SJaegeuk Kim f2fs_put_page(dn->node_page, 1); 521e05df3b1SJaegeuk Kim dn->node_page = NULL; 52251dd6249SNamjae Jeon trace_f2fs_truncate_node(dn->inode, dn->nid, ni.blk_addr); 523e05df3b1SJaegeuk Kim } 524e05df3b1SJaegeuk Kim 525e05df3b1SJaegeuk Kim static int truncate_dnode(struct dnode_of_data *dn) 526e05df3b1SJaegeuk Kim { 527e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 528e05df3b1SJaegeuk Kim struct page *page; 529e05df3b1SJaegeuk Kim 530e05df3b1SJaegeuk Kim if (dn->nid == 0) 531e05df3b1SJaegeuk Kim return 1; 532e05df3b1SJaegeuk Kim 533e05df3b1SJaegeuk Kim /* get direct node */ 534e05df3b1SJaegeuk Kim page = get_node_page(sbi, dn->nid); 535e05df3b1SJaegeuk Kim if (IS_ERR(page) && PTR_ERR(page) == -ENOENT) 536e05df3b1SJaegeuk Kim return 1; 537e05df3b1SJaegeuk Kim else if (IS_ERR(page)) 538e05df3b1SJaegeuk Kim return PTR_ERR(page); 539e05df3b1SJaegeuk Kim 540e05df3b1SJaegeuk Kim /* Make dnode_of_data for parameter */ 541e05df3b1SJaegeuk Kim dn->node_page = page; 542e05df3b1SJaegeuk Kim dn->ofs_in_node = 0; 543e05df3b1SJaegeuk Kim truncate_data_blocks(dn); 544e05df3b1SJaegeuk Kim truncate_node(dn); 545e05df3b1SJaegeuk Kim return 1; 546e05df3b1SJaegeuk Kim } 547e05df3b1SJaegeuk Kim 548e05df3b1SJaegeuk Kim static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs, 549e05df3b1SJaegeuk Kim int ofs, int depth) 550e05df3b1SJaegeuk Kim { 551e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 552e05df3b1SJaegeuk Kim struct dnode_of_data rdn = *dn; 553e05df3b1SJaegeuk Kim struct page *page; 554e05df3b1SJaegeuk Kim struct f2fs_node *rn; 555e05df3b1SJaegeuk Kim nid_t child_nid; 556e05df3b1SJaegeuk Kim unsigned int child_nofs; 557e05df3b1SJaegeuk Kim int freed = 0; 558e05df3b1SJaegeuk Kim int i, ret; 559e05df3b1SJaegeuk Kim 560e05df3b1SJaegeuk Kim if (dn->nid == 0) 561e05df3b1SJaegeuk Kim return NIDS_PER_BLOCK + 1; 562e05df3b1SJaegeuk Kim 56351dd6249SNamjae Jeon trace_f2fs_truncate_nodes_enter(dn->inode, dn->nid, dn->data_blkaddr); 56451dd6249SNamjae Jeon 565e05df3b1SJaegeuk Kim page = get_node_page(sbi, dn->nid); 56651dd6249SNamjae Jeon if (IS_ERR(page)) { 56751dd6249SNamjae Jeon trace_f2fs_truncate_nodes_exit(dn->inode, PTR_ERR(page)); 568e05df3b1SJaegeuk Kim return PTR_ERR(page); 56951dd6249SNamjae Jeon } 570e05df3b1SJaegeuk Kim 57145590710SGu Zheng rn = F2FS_NODE(page); 572e05df3b1SJaegeuk Kim if (depth < 3) { 573e05df3b1SJaegeuk Kim for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { 574e05df3b1SJaegeuk Kim child_nid = le32_to_cpu(rn->in.nid[i]); 575e05df3b1SJaegeuk Kim if (child_nid == 0) 576e05df3b1SJaegeuk Kim continue; 577e05df3b1SJaegeuk Kim rdn.nid = child_nid; 578e05df3b1SJaegeuk Kim ret = truncate_dnode(&rdn); 579e05df3b1SJaegeuk Kim if (ret < 0) 580e05df3b1SJaegeuk Kim goto out_err; 581e05df3b1SJaegeuk Kim set_nid(page, i, 0, false); 582e05df3b1SJaegeuk Kim } 583e05df3b1SJaegeuk Kim } else { 584e05df3b1SJaegeuk Kim child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; 585e05df3b1SJaegeuk Kim for (i = ofs; i < NIDS_PER_BLOCK; i++) { 586e05df3b1SJaegeuk Kim child_nid = le32_to_cpu(rn->in.nid[i]); 587e05df3b1SJaegeuk Kim if (child_nid == 0) { 588e05df3b1SJaegeuk Kim child_nofs += NIDS_PER_BLOCK + 1; 589e05df3b1SJaegeuk Kim continue; 590e05df3b1SJaegeuk Kim } 591e05df3b1SJaegeuk Kim rdn.nid = child_nid; 592e05df3b1SJaegeuk Kim ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1); 593e05df3b1SJaegeuk Kim if (ret == (NIDS_PER_BLOCK + 1)) { 594e05df3b1SJaegeuk Kim set_nid(page, i, 0, false); 595e05df3b1SJaegeuk Kim child_nofs += ret; 596e05df3b1SJaegeuk Kim } else if (ret < 0 && ret != -ENOENT) { 597e05df3b1SJaegeuk Kim goto out_err; 598e05df3b1SJaegeuk Kim } 599e05df3b1SJaegeuk Kim } 600e05df3b1SJaegeuk Kim freed = child_nofs; 601e05df3b1SJaegeuk Kim } 602e05df3b1SJaegeuk Kim 603e05df3b1SJaegeuk Kim if (!ofs) { 604e05df3b1SJaegeuk Kim /* remove current indirect node */ 605e05df3b1SJaegeuk Kim dn->node_page = page; 606e05df3b1SJaegeuk Kim truncate_node(dn); 607e05df3b1SJaegeuk Kim freed++; 608e05df3b1SJaegeuk Kim } else { 609e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 610e05df3b1SJaegeuk Kim } 61151dd6249SNamjae Jeon trace_f2fs_truncate_nodes_exit(dn->inode, freed); 612e05df3b1SJaegeuk Kim return freed; 613e05df3b1SJaegeuk Kim 614e05df3b1SJaegeuk Kim out_err: 615e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 61651dd6249SNamjae Jeon trace_f2fs_truncate_nodes_exit(dn->inode, ret); 617e05df3b1SJaegeuk Kim return ret; 618e05df3b1SJaegeuk Kim } 619e05df3b1SJaegeuk Kim 620e05df3b1SJaegeuk Kim static int truncate_partial_nodes(struct dnode_of_data *dn, 621e05df3b1SJaegeuk Kim struct f2fs_inode *ri, int *offset, int depth) 622e05df3b1SJaegeuk Kim { 623e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 624e05df3b1SJaegeuk Kim struct page *pages[2]; 625e05df3b1SJaegeuk Kim nid_t nid[3]; 626e05df3b1SJaegeuk Kim nid_t child_nid; 627e05df3b1SJaegeuk Kim int err = 0; 628e05df3b1SJaegeuk Kim int i; 629e05df3b1SJaegeuk Kim int idx = depth - 2; 630e05df3b1SJaegeuk Kim 631e05df3b1SJaegeuk Kim nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); 632e05df3b1SJaegeuk Kim if (!nid[0]) 633e05df3b1SJaegeuk Kim return 0; 634e05df3b1SJaegeuk Kim 635e05df3b1SJaegeuk Kim /* get indirect nodes in the path */ 636e05df3b1SJaegeuk Kim for (i = 0; i < depth - 1; i++) { 637e05df3b1SJaegeuk Kim /* refernece count'll be increased */ 638e05df3b1SJaegeuk Kim pages[i] = get_node_page(sbi, nid[i]); 639e05df3b1SJaegeuk Kim if (IS_ERR(pages[i])) { 640e05df3b1SJaegeuk Kim depth = i + 1; 641e05df3b1SJaegeuk Kim err = PTR_ERR(pages[i]); 642e05df3b1SJaegeuk Kim goto fail; 643e05df3b1SJaegeuk Kim } 644e05df3b1SJaegeuk Kim nid[i + 1] = get_nid(pages[i], offset[i + 1], false); 645e05df3b1SJaegeuk Kim } 646e05df3b1SJaegeuk Kim 647e05df3b1SJaegeuk Kim /* free direct nodes linked to a partial indirect node */ 648e05df3b1SJaegeuk Kim for (i = offset[depth - 1]; i < NIDS_PER_BLOCK; i++) { 649e05df3b1SJaegeuk Kim child_nid = get_nid(pages[idx], i, false); 650e05df3b1SJaegeuk Kim if (!child_nid) 651e05df3b1SJaegeuk Kim continue; 652e05df3b1SJaegeuk Kim dn->nid = child_nid; 653e05df3b1SJaegeuk Kim err = truncate_dnode(dn); 654e05df3b1SJaegeuk Kim if (err < 0) 655e05df3b1SJaegeuk Kim goto fail; 656e05df3b1SJaegeuk Kim set_nid(pages[idx], i, 0, false); 657e05df3b1SJaegeuk Kim } 658e05df3b1SJaegeuk Kim 659e05df3b1SJaegeuk Kim if (offset[depth - 1] == 0) { 660e05df3b1SJaegeuk Kim dn->node_page = pages[idx]; 661e05df3b1SJaegeuk Kim dn->nid = nid[idx]; 662e05df3b1SJaegeuk Kim truncate_node(dn); 663e05df3b1SJaegeuk Kim } else { 664e05df3b1SJaegeuk Kim f2fs_put_page(pages[idx], 1); 665e05df3b1SJaegeuk Kim } 666e05df3b1SJaegeuk Kim offset[idx]++; 667e05df3b1SJaegeuk Kim offset[depth - 1] = 0; 668e05df3b1SJaegeuk Kim fail: 669e05df3b1SJaegeuk Kim for (i = depth - 3; i >= 0; i--) 670e05df3b1SJaegeuk Kim f2fs_put_page(pages[i], 1); 67151dd6249SNamjae Jeon 67251dd6249SNamjae Jeon trace_f2fs_truncate_partial_nodes(dn->inode, nid, depth, err); 67351dd6249SNamjae Jeon 674e05df3b1SJaegeuk Kim return err; 675e05df3b1SJaegeuk Kim } 676e05df3b1SJaegeuk Kim 6770a8165d7SJaegeuk Kim /* 678e05df3b1SJaegeuk Kim * All the block addresses of data and nodes should be nullified. 679e05df3b1SJaegeuk Kim */ 680e05df3b1SJaegeuk Kim int truncate_inode_blocks(struct inode *inode, pgoff_t from) 681e05df3b1SJaegeuk Kim { 682e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 683afcb7ca0SJaegeuk Kim struct address_space *node_mapping = sbi->node_inode->i_mapping; 684e05df3b1SJaegeuk Kim int err = 0, cont = 1; 685e05df3b1SJaegeuk Kim int level, offset[4], noffset[4]; 6867dd690c8SJaegeuk Kim unsigned int nofs = 0; 687e05df3b1SJaegeuk Kim struct f2fs_node *rn; 688e05df3b1SJaegeuk Kim struct dnode_of_data dn; 689e05df3b1SJaegeuk Kim struct page *page; 690e05df3b1SJaegeuk Kim 69151dd6249SNamjae Jeon trace_f2fs_truncate_inode_blocks_enter(inode, from); 69251dd6249SNamjae Jeon 693de93653fSJaegeuk Kim level = get_node_path(F2FS_I(inode), from, offset, noffset); 694afcb7ca0SJaegeuk Kim restart: 695e05df3b1SJaegeuk Kim page = get_node_page(sbi, inode->i_ino); 69651dd6249SNamjae Jeon if (IS_ERR(page)) { 69751dd6249SNamjae Jeon trace_f2fs_truncate_inode_blocks_exit(inode, PTR_ERR(page)); 698e05df3b1SJaegeuk Kim return PTR_ERR(page); 69951dd6249SNamjae Jeon } 700e05df3b1SJaegeuk Kim 701e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, page, NULL, 0); 702e05df3b1SJaegeuk Kim unlock_page(page); 703e05df3b1SJaegeuk Kim 70445590710SGu Zheng rn = F2FS_NODE(page); 705e05df3b1SJaegeuk Kim switch (level) { 706e05df3b1SJaegeuk Kim case 0: 707e05df3b1SJaegeuk Kim case 1: 708e05df3b1SJaegeuk Kim nofs = noffset[1]; 709e05df3b1SJaegeuk Kim break; 710e05df3b1SJaegeuk Kim case 2: 711e05df3b1SJaegeuk Kim nofs = noffset[1]; 712e05df3b1SJaegeuk Kim if (!offset[level - 1]) 713e05df3b1SJaegeuk Kim goto skip_partial; 714e05df3b1SJaegeuk Kim err = truncate_partial_nodes(&dn, &rn->i, offset, level); 715e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 716e05df3b1SJaegeuk Kim goto fail; 717e05df3b1SJaegeuk Kim nofs += 1 + NIDS_PER_BLOCK; 718e05df3b1SJaegeuk Kim break; 719e05df3b1SJaegeuk Kim case 3: 720e05df3b1SJaegeuk Kim nofs = 5 + 2 * NIDS_PER_BLOCK; 721e05df3b1SJaegeuk Kim if (!offset[level - 1]) 722e05df3b1SJaegeuk Kim goto skip_partial; 723e05df3b1SJaegeuk Kim err = truncate_partial_nodes(&dn, &rn->i, offset, level); 724e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 725e05df3b1SJaegeuk Kim goto fail; 726e05df3b1SJaegeuk Kim break; 727e05df3b1SJaegeuk Kim default: 728e05df3b1SJaegeuk Kim BUG(); 729e05df3b1SJaegeuk Kim } 730e05df3b1SJaegeuk Kim 731e05df3b1SJaegeuk Kim skip_partial: 732e05df3b1SJaegeuk Kim while (cont) { 733e05df3b1SJaegeuk Kim dn.nid = le32_to_cpu(rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]); 734e05df3b1SJaegeuk Kim switch (offset[0]) { 735e05df3b1SJaegeuk Kim case NODE_DIR1_BLOCK: 736e05df3b1SJaegeuk Kim case NODE_DIR2_BLOCK: 737e05df3b1SJaegeuk Kim err = truncate_dnode(&dn); 738e05df3b1SJaegeuk Kim break; 739e05df3b1SJaegeuk Kim 740e05df3b1SJaegeuk Kim case NODE_IND1_BLOCK: 741e05df3b1SJaegeuk Kim case NODE_IND2_BLOCK: 742e05df3b1SJaegeuk Kim err = truncate_nodes(&dn, nofs, offset[1], 2); 743e05df3b1SJaegeuk Kim break; 744e05df3b1SJaegeuk Kim 745e05df3b1SJaegeuk Kim case NODE_DIND_BLOCK: 746e05df3b1SJaegeuk Kim err = truncate_nodes(&dn, nofs, offset[1], 3); 747e05df3b1SJaegeuk Kim cont = 0; 748e05df3b1SJaegeuk Kim break; 749e05df3b1SJaegeuk Kim 750e05df3b1SJaegeuk Kim default: 751e05df3b1SJaegeuk Kim BUG(); 752e05df3b1SJaegeuk Kim } 753e05df3b1SJaegeuk Kim if (err < 0 && err != -ENOENT) 754e05df3b1SJaegeuk Kim goto fail; 755e05df3b1SJaegeuk Kim if (offset[1] == 0 && 756e05df3b1SJaegeuk Kim rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]) { 757e05df3b1SJaegeuk Kim lock_page(page); 7586bacf52fSJaegeuk Kim if (unlikely(page->mapping != node_mapping)) { 759afcb7ca0SJaegeuk Kim f2fs_put_page(page, 1); 760afcb7ca0SJaegeuk Kim goto restart; 761afcb7ca0SJaegeuk Kim } 762e05df3b1SJaegeuk Kim wait_on_page_writeback(page); 763e05df3b1SJaegeuk Kim rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK] = 0; 764e05df3b1SJaegeuk Kim set_page_dirty(page); 765e05df3b1SJaegeuk Kim unlock_page(page); 766e05df3b1SJaegeuk Kim } 767e05df3b1SJaegeuk Kim offset[1] = 0; 768e05df3b1SJaegeuk Kim offset[0]++; 769e05df3b1SJaegeuk Kim nofs += err; 770e05df3b1SJaegeuk Kim } 771e05df3b1SJaegeuk Kim fail: 772e05df3b1SJaegeuk Kim f2fs_put_page(page, 0); 77351dd6249SNamjae Jeon trace_f2fs_truncate_inode_blocks_exit(inode, err); 774e05df3b1SJaegeuk Kim return err > 0 ? 0 : err; 775e05df3b1SJaegeuk Kim } 776e05df3b1SJaegeuk Kim 7774f16fb0fSJaegeuk Kim int truncate_xattr_node(struct inode *inode, struct page *page) 7784f16fb0fSJaegeuk Kim { 7794f16fb0fSJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 7804f16fb0fSJaegeuk Kim nid_t nid = F2FS_I(inode)->i_xattr_nid; 7814f16fb0fSJaegeuk Kim struct dnode_of_data dn; 7824f16fb0fSJaegeuk Kim struct page *npage; 7834f16fb0fSJaegeuk Kim 7844f16fb0fSJaegeuk Kim if (!nid) 7854f16fb0fSJaegeuk Kim return 0; 7864f16fb0fSJaegeuk Kim 7874f16fb0fSJaegeuk Kim npage = get_node_page(sbi, nid); 7884f16fb0fSJaegeuk Kim if (IS_ERR(npage)) 7894f16fb0fSJaegeuk Kim return PTR_ERR(npage); 7904f16fb0fSJaegeuk Kim 7914f16fb0fSJaegeuk Kim F2FS_I(inode)->i_xattr_nid = 0; 79265985d93SJaegeuk Kim 79365985d93SJaegeuk Kim /* need to do checkpoint during fsync */ 79465985d93SJaegeuk Kim F2FS_I(inode)->xattr_ver = cur_cp_version(F2FS_CKPT(sbi)); 79565985d93SJaegeuk Kim 7964f16fb0fSJaegeuk Kim set_new_dnode(&dn, inode, page, npage, nid); 7974f16fb0fSJaegeuk Kim 7984f16fb0fSJaegeuk Kim if (page) 79901d2d1aaSChao Yu dn.inode_page_locked = true; 8004f16fb0fSJaegeuk Kim truncate_node(&dn); 8014f16fb0fSJaegeuk Kim return 0; 8024f16fb0fSJaegeuk Kim } 8034f16fb0fSJaegeuk Kim 80439936837SJaegeuk Kim /* 8054f4124d0SChao Yu * Caller should grab and release a rwsem by calling f2fs_lock_op() and 8064f4124d0SChao Yu * f2fs_unlock_op(). 80739936837SJaegeuk Kim */ 80858e674d6SGu Zheng void remove_inode_page(struct inode *inode) 809e05df3b1SJaegeuk Kim { 810e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 811e05df3b1SJaegeuk Kim struct page *page; 812e05df3b1SJaegeuk Kim nid_t ino = inode->i_ino; 813e05df3b1SJaegeuk Kim struct dnode_of_data dn; 814e05df3b1SJaegeuk Kim 815e05df3b1SJaegeuk Kim page = get_node_page(sbi, ino); 81639936837SJaegeuk Kim if (IS_ERR(page)) 81758e674d6SGu Zheng return; 818e05df3b1SJaegeuk Kim 81958e674d6SGu Zheng if (truncate_xattr_node(inode, page)) { 8204f16fb0fSJaegeuk Kim f2fs_put_page(page, 1); 82158e674d6SGu Zheng return; 822e05df3b1SJaegeuk Kim } 82371e9fec5SJaegeuk Kim /* 0 is possible, after f2fs_new_inode() is failed */ 8245d56b671SJaegeuk Kim f2fs_bug_on(inode->i_blocks != 0 && inode->i_blocks != 1); 825e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, page, page, ino); 826e05df3b1SJaegeuk Kim truncate_node(&dn); 827e05df3b1SJaegeuk Kim } 828e05df3b1SJaegeuk Kim 82944a83ff6SJaegeuk Kim struct page *new_inode_page(struct inode *inode, const struct qstr *name) 830e05df3b1SJaegeuk Kim { 831e05df3b1SJaegeuk Kim struct dnode_of_data dn; 832e05df3b1SJaegeuk Kim 833e05df3b1SJaegeuk Kim /* allocate inode page for new inode */ 834e05df3b1SJaegeuk Kim set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino); 83544a83ff6SJaegeuk Kim 83644a83ff6SJaegeuk Kim /* caller should f2fs_put_page(page, 1); */ 8378ae8f162SJaegeuk Kim return new_node_page(&dn, 0, NULL); 838e05df3b1SJaegeuk Kim } 839e05df3b1SJaegeuk Kim 8408ae8f162SJaegeuk Kim struct page *new_node_page(struct dnode_of_data *dn, 8418ae8f162SJaegeuk Kim unsigned int ofs, struct page *ipage) 842e05df3b1SJaegeuk Kim { 843e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); 844e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 845e05df3b1SJaegeuk Kim struct node_info old_ni, new_ni; 846e05df3b1SJaegeuk Kim struct page *page; 847e05df3b1SJaegeuk Kim int err; 848e05df3b1SJaegeuk Kim 8496bacf52fSJaegeuk Kim if (unlikely(is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC))) 850e05df3b1SJaegeuk Kim return ERR_PTR(-EPERM); 851e05df3b1SJaegeuk Kim 852e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, dn->nid); 853e05df3b1SJaegeuk Kim if (!page) 854e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 855e05df3b1SJaegeuk Kim 8566bacf52fSJaegeuk Kim if (unlikely(!inc_valid_node_count(sbi, dn->inode))) { 8579c02740cSJaegeuk Kim err = -ENOSPC; 8589c02740cSJaegeuk Kim goto fail; 8599c02740cSJaegeuk Kim } 860e05df3b1SJaegeuk Kim 8619c02740cSJaegeuk Kim get_node_info(sbi, dn->nid, &old_ni); 862e05df3b1SJaegeuk Kim 863e05df3b1SJaegeuk Kim /* Reinitialize old_ni with new node page */ 8645d56b671SJaegeuk Kim f2fs_bug_on(old_ni.blk_addr != NULL_ADDR); 865e05df3b1SJaegeuk Kim new_ni = old_ni; 866e05df3b1SJaegeuk Kim new_ni.ino = dn->inode->i_ino; 867e05df3b1SJaegeuk Kim set_node_addr(sbi, &new_ni, NEW_ADDR); 8689c02740cSJaegeuk Kim 8699c02740cSJaegeuk Kim fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true); 870398b1ac5SJaegeuk Kim set_cold_node(dn->inode, page); 8719c02740cSJaegeuk Kim SetPageUptodate(page); 8729c02740cSJaegeuk Kim set_page_dirty(page); 873e05df3b1SJaegeuk Kim 874479bd73aSJaegeuk Kim if (ofs == XATTR_NODE_OFFSET) 875479bd73aSJaegeuk Kim F2FS_I(dn->inode)->i_xattr_nid = dn->nid; 876479bd73aSJaegeuk Kim 877e05df3b1SJaegeuk Kim dn->node_page = page; 8788ae8f162SJaegeuk Kim if (ipage) 8798ae8f162SJaegeuk Kim update_inode(dn->inode, ipage); 8808ae8f162SJaegeuk Kim else 881e05df3b1SJaegeuk Kim sync_inode_page(dn); 882e05df3b1SJaegeuk Kim if (ofs == 0) 883e05df3b1SJaegeuk Kim inc_valid_inode_count(sbi); 884e05df3b1SJaegeuk Kim 885e05df3b1SJaegeuk Kim return page; 886e05df3b1SJaegeuk Kim 887e05df3b1SJaegeuk Kim fail: 88871e9fec5SJaegeuk Kim clear_node_page_dirty(page); 889e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 890e05df3b1SJaegeuk Kim return ERR_PTR(err); 891e05df3b1SJaegeuk Kim } 892e05df3b1SJaegeuk Kim 89356ae674cSJaegeuk Kim /* 89456ae674cSJaegeuk Kim * Caller should do after getting the following values. 89556ae674cSJaegeuk Kim * 0: f2fs_put_page(page, 0) 89656ae674cSJaegeuk Kim * LOCKED_PAGE: f2fs_put_page(page, 1) 89756ae674cSJaegeuk Kim * error: nothing 89856ae674cSJaegeuk Kim */ 89993dfe2acSJaegeuk Kim static int read_node_page(struct page *page, int rw) 900e05df3b1SJaegeuk Kim { 901e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); 902e05df3b1SJaegeuk Kim struct node_info ni; 903e05df3b1SJaegeuk Kim 904e05df3b1SJaegeuk Kim get_node_info(sbi, page->index, &ni); 905e05df3b1SJaegeuk Kim 9066bacf52fSJaegeuk Kim if (unlikely(ni.blk_addr == NULL_ADDR)) { 907393ff91fSJaegeuk Kim f2fs_put_page(page, 1); 908e05df3b1SJaegeuk Kim return -ENOENT; 909393ff91fSJaegeuk Kim } 910393ff91fSJaegeuk Kim 91156ae674cSJaegeuk Kim if (PageUptodate(page)) 91256ae674cSJaegeuk Kim return LOCKED_PAGE; 913393ff91fSJaegeuk Kim 91493dfe2acSJaegeuk Kim return f2fs_submit_page_bio(sbi, page, ni.blk_addr, rw); 915e05df3b1SJaegeuk Kim } 916e05df3b1SJaegeuk Kim 9170a8165d7SJaegeuk Kim /* 918e05df3b1SJaegeuk Kim * Readahead a node page 919e05df3b1SJaegeuk Kim */ 920e05df3b1SJaegeuk Kim void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid) 921e05df3b1SJaegeuk Kim { 922e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 923e05df3b1SJaegeuk Kim struct page *apage; 92456ae674cSJaegeuk Kim int err; 925e05df3b1SJaegeuk Kim 926e05df3b1SJaegeuk Kim apage = find_get_page(mapping, nid); 927393ff91fSJaegeuk Kim if (apage && PageUptodate(apage)) { 928393ff91fSJaegeuk Kim f2fs_put_page(apage, 0); 929393ff91fSJaegeuk Kim return; 930393ff91fSJaegeuk Kim } 931e05df3b1SJaegeuk Kim f2fs_put_page(apage, 0); 932e05df3b1SJaegeuk Kim 933e05df3b1SJaegeuk Kim apage = grab_cache_page(mapping, nid); 934e05df3b1SJaegeuk Kim if (!apage) 935e05df3b1SJaegeuk Kim return; 936e05df3b1SJaegeuk Kim 93756ae674cSJaegeuk Kim err = read_node_page(apage, READA); 93856ae674cSJaegeuk Kim if (err == 0) 939369a708cSJaegeuk Kim f2fs_put_page(apage, 0); 94056ae674cSJaegeuk Kim else if (err == LOCKED_PAGE) 94156ae674cSJaegeuk Kim f2fs_put_page(apage, 1); 942e05df3b1SJaegeuk Kim } 943e05df3b1SJaegeuk Kim 944e05df3b1SJaegeuk Kim struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid) 945e05df3b1SJaegeuk Kim { 946e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 94756ae674cSJaegeuk Kim struct page *page; 94856ae674cSJaegeuk Kim int err; 949afcb7ca0SJaegeuk Kim repeat: 950e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, nid); 951e05df3b1SJaegeuk Kim if (!page) 952e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 953e05df3b1SJaegeuk Kim 954e05df3b1SJaegeuk Kim err = read_node_page(page, READ_SYNC); 95556ae674cSJaegeuk Kim if (err < 0) 956e05df3b1SJaegeuk Kim return ERR_PTR(err); 95756ae674cSJaegeuk Kim else if (err == LOCKED_PAGE) 95856ae674cSJaegeuk Kim goto got_it; 959e05df3b1SJaegeuk Kim 960393ff91fSJaegeuk Kim lock_page(page); 9616bacf52fSJaegeuk Kim if (unlikely(!PageUptodate(page))) { 962393ff91fSJaegeuk Kim f2fs_put_page(page, 1); 963393ff91fSJaegeuk Kim return ERR_PTR(-EIO); 964393ff91fSJaegeuk Kim } 9656bacf52fSJaegeuk Kim if (unlikely(page->mapping != mapping)) { 966afcb7ca0SJaegeuk Kim f2fs_put_page(page, 1); 967afcb7ca0SJaegeuk Kim goto repeat; 968afcb7ca0SJaegeuk Kim } 96956ae674cSJaegeuk Kim got_it: 9705d56b671SJaegeuk Kim f2fs_bug_on(nid != nid_of_node(page)); 971e05df3b1SJaegeuk Kim mark_page_accessed(page); 972e05df3b1SJaegeuk Kim return page; 973e05df3b1SJaegeuk Kim } 974e05df3b1SJaegeuk Kim 9750a8165d7SJaegeuk Kim /* 976e05df3b1SJaegeuk Kim * Return a locked page for the desired node page. 977e05df3b1SJaegeuk Kim * And, readahead MAX_RA_NODE number of node pages. 978e05df3b1SJaegeuk Kim */ 979e05df3b1SJaegeuk Kim struct page *get_node_page_ra(struct page *parent, int start) 980e05df3b1SJaegeuk Kim { 981e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(parent->mapping->host->i_sb); 982e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 983c718379bSJaegeuk Kim struct blk_plug plug; 984e05df3b1SJaegeuk Kim struct page *page; 98556ae674cSJaegeuk Kim int err, i, end; 98656ae674cSJaegeuk Kim nid_t nid; 987e05df3b1SJaegeuk Kim 988e05df3b1SJaegeuk Kim /* First, try getting the desired direct node. */ 989e05df3b1SJaegeuk Kim nid = get_nid(parent, start, false); 990e05df3b1SJaegeuk Kim if (!nid) 991e05df3b1SJaegeuk Kim return ERR_PTR(-ENOENT); 992afcb7ca0SJaegeuk Kim repeat: 993e05df3b1SJaegeuk Kim page = grab_cache_page(mapping, nid); 994e05df3b1SJaegeuk Kim if (!page) 995e05df3b1SJaegeuk Kim return ERR_PTR(-ENOMEM); 996e05df3b1SJaegeuk Kim 99766d36a29SJaegeuk Kim err = read_node_page(page, READ_SYNC); 99856ae674cSJaegeuk Kim if (err < 0) 999e05df3b1SJaegeuk Kim return ERR_PTR(err); 100056ae674cSJaegeuk Kim else if (err == LOCKED_PAGE) 100156ae674cSJaegeuk Kim goto page_hit; 1002e05df3b1SJaegeuk Kim 1003c718379bSJaegeuk Kim blk_start_plug(&plug); 1004c718379bSJaegeuk Kim 1005e05df3b1SJaegeuk Kim /* Then, try readahead for siblings of the desired node */ 1006e05df3b1SJaegeuk Kim end = start + MAX_RA_NODE; 1007e05df3b1SJaegeuk Kim end = min(end, NIDS_PER_BLOCK); 1008e05df3b1SJaegeuk Kim for (i = start + 1; i < end; i++) { 1009e05df3b1SJaegeuk Kim nid = get_nid(parent, i, false); 1010e05df3b1SJaegeuk Kim if (!nid) 1011e05df3b1SJaegeuk Kim continue; 1012e05df3b1SJaegeuk Kim ra_node_page(sbi, nid); 1013e05df3b1SJaegeuk Kim } 1014e05df3b1SJaegeuk Kim 1015c718379bSJaegeuk Kim blk_finish_plug(&plug); 1016c718379bSJaegeuk Kim 1017e05df3b1SJaegeuk Kim lock_page(page); 10186bacf52fSJaegeuk Kim if (unlikely(page->mapping != mapping)) { 1019afcb7ca0SJaegeuk Kim f2fs_put_page(page, 1); 1020afcb7ca0SJaegeuk Kim goto repeat; 1021afcb7ca0SJaegeuk Kim } 1022e0f56cb4SNamjae Jeon page_hit: 10236bacf52fSJaegeuk Kim if (unlikely(!PageUptodate(page))) { 1024e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1025e05df3b1SJaegeuk Kim return ERR_PTR(-EIO); 1026e05df3b1SJaegeuk Kim } 1027393ff91fSJaegeuk Kim mark_page_accessed(page); 1028e05df3b1SJaegeuk Kim return page; 1029e05df3b1SJaegeuk Kim } 1030e05df3b1SJaegeuk Kim 1031e05df3b1SJaegeuk Kim void sync_inode_page(struct dnode_of_data *dn) 1032e05df3b1SJaegeuk Kim { 1033e05df3b1SJaegeuk Kim if (IS_INODE(dn->node_page) || dn->inode_page == dn->node_page) { 1034e05df3b1SJaegeuk Kim update_inode(dn->inode, dn->node_page); 1035e05df3b1SJaegeuk Kim } else if (dn->inode_page) { 1036e05df3b1SJaegeuk Kim if (!dn->inode_page_locked) 1037e05df3b1SJaegeuk Kim lock_page(dn->inode_page); 1038e05df3b1SJaegeuk Kim update_inode(dn->inode, dn->inode_page); 1039e05df3b1SJaegeuk Kim if (!dn->inode_page_locked) 1040e05df3b1SJaegeuk Kim unlock_page(dn->inode_page); 1041e05df3b1SJaegeuk Kim } else { 104239936837SJaegeuk Kim update_inode_page(dn->inode); 1043e05df3b1SJaegeuk Kim } 1044e05df3b1SJaegeuk Kim } 1045e05df3b1SJaegeuk Kim 1046e05df3b1SJaegeuk Kim int sync_node_pages(struct f2fs_sb_info *sbi, nid_t ino, 1047e05df3b1SJaegeuk Kim struct writeback_control *wbc) 1048e05df3b1SJaegeuk Kim { 1049e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 1050e05df3b1SJaegeuk Kim pgoff_t index, end; 1051e05df3b1SJaegeuk Kim struct pagevec pvec; 1052e05df3b1SJaegeuk Kim int step = ino ? 2 : 0; 1053e05df3b1SJaegeuk Kim int nwritten = 0, wrote = 0; 1054e05df3b1SJaegeuk Kim 1055e05df3b1SJaegeuk Kim pagevec_init(&pvec, 0); 1056e05df3b1SJaegeuk Kim 1057e05df3b1SJaegeuk Kim next_step: 1058e05df3b1SJaegeuk Kim index = 0; 1059e05df3b1SJaegeuk Kim end = LONG_MAX; 1060e05df3b1SJaegeuk Kim 1061e05df3b1SJaegeuk Kim while (index <= end) { 1062e05df3b1SJaegeuk Kim int i, nr_pages; 1063e05df3b1SJaegeuk Kim nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, 1064e05df3b1SJaegeuk Kim PAGECACHE_TAG_DIRTY, 1065e05df3b1SJaegeuk Kim min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1); 1066e05df3b1SJaegeuk Kim if (nr_pages == 0) 1067e05df3b1SJaegeuk Kim break; 1068e05df3b1SJaegeuk Kim 1069e05df3b1SJaegeuk Kim for (i = 0; i < nr_pages; i++) { 1070e05df3b1SJaegeuk Kim struct page *page = pvec.pages[i]; 1071e05df3b1SJaegeuk Kim 1072e05df3b1SJaegeuk Kim /* 1073e05df3b1SJaegeuk Kim * flushing sequence with step: 1074e05df3b1SJaegeuk Kim * 0. indirect nodes 1075e05df3b1SJaegeuk Kim * 1. dentry dnodes 1076e05df3b1SJaegeuk Kim * 2. file dnodes 1077e05df3b1SJaegeuk Kim */ 1078e05df3b1SJaegeuk Kim if (step == 0 && IS_DNODE(page)) 1079e05df3b1SJaegeuk Kim continue; 1080e05df3b1SJaegeuk Kim if (step == 1 && (!IS_DNODE(page) || 1081e05df3b1SJaegeuk Kim is_cold_node(page))) 1082e05df3b1SJaegeuk Kim continue; 1083e05df3b1SJaegeuk Kim if (step == 2 && (!IS_DNODE(page) || 1084e05df3b1SJaegeuk Kim !is_cold_node(page))) 1085e05df3b1SJaegeuk Kim continue; 1086e05df3b1SJaegeuk Kim 1087e05df3b1SJaegeuk Kim /* 1088e05df3b1SJaegeuk Kim * If an fsync mode, 1089e05df3b1SJaegeuk Kim * we should not skip writing node pages. 1090e05df3b1SJaegeuk Kim */ 1091e05df3b1SJaegeuk Kim if (ino && ino_of_node(page) == ino) 1092e05df3b1SJaegeuk Kim lock_page(page); 1093e05df3b1SJaegeuk Kim else if (!trylock_page(page)) 1094e05df3b1SJaegeuk Kim continue; 1095e05df3b1SJaegeuk Kim 1096e05df3b1SJaegeuk Kim if (unlikely(page->mapping != mapping)) { 1097e05df3b1SJaegeuk Kim continue_unlock: 1098e05df3b1SJaegeuk Kim unlock_page(page); 1099e05df3b1SJaegeuk Kim continue; 1100e05df3b1SJaegeuk Kim } 1101e05df3b1SJaegeuk Kim if (ino && ino_of_node(page) != ino) 1102e05df3b1SJaegeuk Kim goto continue_unlock; 1103e05df3b1SJaegeuk Kim 1104e05df3b1SJaegeuk Kim if (!PageDirty(page)) { 1105e05df3b1SJaegeuk Kim /* someone wrote it for us */ 1106e05df3b1SJaegeuk Kim goto continue_unlock; 1107e05df3b1SJaegeuk Kim } 1108e05df3b1SJaegeuk Kim 1109e05df3b1SJaegeuk Kim if (!clear_page_dirty_for_io(page)) 1110e05df3b1SJaegeuk Kim goto continue_unlock; 1111e05df3b1SJaegeuk Kim 1112e05df3b1SJaegeuk Kim /* called by fsync() */ 1113e05df3b1SJaegeuk Kim if (ino && IS_DNODE(page)) { 1114e05df3b1SJaegeuk Kim int mark = !is_checkpointed_node(sbi, ino); 1115e05df3b1SJaegeuk Kim set_fsync_mark(page, 1); 1116e05df3b1SJaegeuk Kim if (IS_INODE(page)) 1117e05df3b1SJaegeuk Kim set_dentry_mark(page, mark); 1118e05df3b1SJaegeuk Kim nwritten++; 1119e05df3b1SJaegeuk Kim } else { 1120e05df3b1SJaegeuk Kim set_fsync_mark(page, 0); 1121e05df3b1SJaegeuk Kim set_dentry_mark(page, 0); 1122e05df3b1SJaegeuk Kim } 1123e05df3b1SJaegeuk Kim mapping->a_ops->writepage(page, wbc); 1124e05df3b1SJaegeuk Kim wrote++; 1125e05df3b1SJaegeuk Kim 1126e05df3b1SJaegeuk Kim if (--wbc->nr_to_write == 0) 1127e05df3b1SJaegeuk Kim break; 1128e05df3b1SJaegeuk Kim } 1129e05df3b1SJaegeuk Kim pagevec_release(&pvec); 1130e05df3b1SJaegeuk Kim cond_resched(); 1131e05df3b1SJaegeuk Kim 1132e05df3b1SJaegeuk Kim if (wbc->nr_to_write == 0) { 1133e05df3b1SJaegeuk Kim step = 2; 1134e05df3b1SJaegeuk Kim break; 1135e05df3b1SJaegeuk Kim } 1136e05df3b1SJaegeuk Kim } 1137e05df3b1SJaegeuk Kim 1138e05df3b1SJaegeuk Kim if (step < 2) { 1139e05df3b1SJaegeuk Kim step++; 1140e05df3b1SJaegeuk Kim goto next_step; 1141e05df3b1SJaegeuk Kim } 1142e05df3b1SJaegeuk Kim 1143e05df3b1SJaegeuk Kim if (wrote) 1144458e6197SJaegeuk Kim f2fs_submit_merged_bio(sbi, NODE, WRITE); 1145e05df3b1SJaegeuk Kim return nwritten; 1146e05df3b1SJaegeuk Kim } 1147e05df3b1SJaegeuk Kim 1148cfe58f9dSJaegeuk Kim int wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, nid_t ino) 1149cfe58f9dSJaegeuk Kim { 1150cfe58f9dSJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 1151cfe58f9dSJaegeuk Kim pgoff_t index = 0, end = LONG_MAX; 1152cfe58f9dSJaegeuk Kim struct pagevec pvec; 1153cfe58f9dSJaegeuk Kim int nr_pages; 1154cfe58f9dSJaegeuk Kim int ret2 = 0, ret = 0; 1155cfe58f9dSJaegeuk Kim 1156cfe58f9dSJaegeuk Kim pagevec_init(&pvec, 0); 1157cfe58f9dSJaegeuk Kim while ((index <= end) && 1158cfe58f9dSJaegeuk Kim (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, 1159cfe58f9dSJaegeuk Kim PAGECACHE_TAG_WRITEBACK, 1160cfe58f9dSJaegeuk Kim min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1)) != 0) { 1161cfe58f9dSJaegeuk Kim unsigned i; 1162cfe58f9dSJaegeuk Kim 1163cfe58f9dSJaegeuk Kim for (i = 0; i < nr_pages; i++) { 1164cfe58f9dSJaegeuk Kim struct page *page = pvec.pages[i]; 1165cfe58f9dSJaegeuk Kim 1166cfe58f9dSJaegeuk Kim /* until radix tree lookup accepts end_index */ 1167cfb271d4SChao Yu if (unlikely(page->index > end)) 1168cfe58f9dSJaegeuk Kim continue; 1169cfe58f9dSJaegeuk Kim 11704bf08ff6SChao Yu if (ino && ino_of_node(page) == ino) { 1171cfe58f9dSJaegeuk Kim wait_on_page_writeback(page); 1172cfe58f9dSJaegeuk Kim if (TestClearPageError(page)) 1173cfe58f9dSJaegeuk Kim ret = -EIO; 1174cfe58f9dSJaegeuk Kim } 11754bf08ff6SChao Yu } 1176cfe58f9dSJaegeuk Kim pagevec_release(&pvec); 1177cfe58f9dSJaegeuk Kim cond_resched(); 1178cfe58f9dSJaegeuk Kim } 1179cfe58f9dSJaegeuk Kim 11806bacf52fSJaegeuk Kim if (unlikely(test_and_clear_bit(AS_ENOSPC, &mapping->flags))) 1181cfe58f9dSJaegeuk Kim ret2 = -ENOSPC; 11826bacf52fSJaegeuk Kim if (unlikely(test_and_clear_bit(AS_EIO, &mapping->flags))) 1183cfe58f9dSJaegeuk Kim ret2 = -EIO; 1184cfe58f9dSJaegeuk Kim if (!ret) 1185cfe58f9dSJaegeuk Kim ret = ret2; 1186cfe58f9dSJaegeuk Kim return ret; 1187cfe58f9dSJaegeuk Kim } 1188cfe58f9dSJaegeuk Kim 1189e05df3b1SJaegeuk Kim static int f2fs_write_node_page(struct page *page, 1190e05df3b1SJaegeuk Kim struct writeback_control *wbc) 1191e05df3b1SJaegeuk Kim { 1192e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); 1193e05df3b1SJaegeuk Kim nid_t nid; 1194e05df3b1SJaegeuk Kim block_t new_addr; 1195e05df3b1SJaegeuk Kim struct node_info ni; 1196e05df3b1SJaegeuk Kim 1197cfb271d4SChao Yu if (unlikely(sbi->por_doing)) 119887a9bd26SJaegeuk Kim goto redirty_out; 119987a9bd26SJaegeuk Kim 1200e05df3b1SJaegeuk Kim wait_on_page_writeback(page); 1201e05df3b1SJaegeuk Kim 1202e05df3b1SJaegeuk Kim /* get old block addr of this node page */ 1203e05df3b1SJaegeuk Kim nid = nid_of_node(page); 12045d56b671SJaegeuk Kim f2fs_bug_on(page->index != nid); 1205e05df3b1SJaegeuk Kim 1206e05df3b1SJaegeuk Kim get_node_info(sbi, nid, &ni); 1207e05df3b1SJaegeuk Kim 1208e05df3b1SJaegeuk Kim /* This page is already truncated */ 12096bacf52fSJaegeuk Kim if (unlikely(ni.blk_addr == NULL_ADDR)) { 121039936837SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 121139936837SJaegeuk Kim unlock_page(page); 121239936837SJaegeuk Kim return 0; 121339936837SJaegeuk Kim } 1214e05df3b1SJaegeuk Kim 121587a9bd26SJaegeuk Kim if (wbc->for_reclaim) 121687a9bd26SJaegeuk Kim goto redirty_out; 121708d8058bSJaegeuk Kim 121839936837SJaegeuk Kim mutex_lock(&sbi->node_write); 1219e05df3b1SJaegeuk Kim set_page_writeback(page); 1220e05df3b1SJaegeuk Kim write_node_page(sbi, page, nid, ni.blk_addr, &new_addr); 1221e05df3b1SJaegeuk Kim set_node_addr(sbi, &ni, new_addr); 1222e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 122339936837SJaegeuk Kim mutex_unlock(&sbi->node_write); 1224e05df3b1SJaegeuk Kim unlock_page(page); 1225e05df3b1SJaegeuk Kim return 0; 122687a9bd26SJaegeuk Kim 122787a9bd26SJaegeuk Kim redirty_out: 122887a9bd26SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 122987a9bd26SJaegeuk Kim wbc->pages_skipped++; 123087a9bd26SJaegeuk Kim set_page_dirty(page); 123187a9bd26SJaegeuk Kim return AOP_WRITEPAGE_ACTIVATE; 1232e05df3b1SJaegeuk Kim } 1233e05df3b1SJaegeuk Kim 1234a7fdffbdSJaegeuk Kim /* 1235a7fdffbdSJaegeuk Kim * It is very important to gather dirty pages and write at once, so that we can 1236a7fdffbdSJaegeuk Kim * submit a big bio without interfering other data writes. 1237423e95ccSJaegeuk Kim * Be default, 512 pages (2MB) * 3 node types, is more reasonable. 1238a7fdffbdSJaegeuk Kim */ 1239423e95ccSJaegeuk Kim #define COLLECT_DIRTY_NODES 1536 1240e05df3b1SJaegeuk Kim static int f2fs_write_node_pages(struct address_space *mapping, 1241e05df3b1SJaegeuk Kim struct writeback_control *wbc) 1242e05df3b1SJaegeuk Kim { 1243e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 1244e05df3b1SJaegeuk Kim long nr_to_write = wbc->nr_to_write; 1245e05df3b1SJaegeuk Kim 12464660f9c0SJaegeuk Kim /* balancing f2fs's metadata in background */ 12474660f9c0SJaegeuk Kim f2fs_balance_fs_bg(sbi); 1248e05df3b1SJaegeuk Kim 1249a7fdffbdSJaegeuk Kim /* collect a number of dirty node pages and write together */ 1250a7fdffbdSJaegeuk Kim if (get_pages(sbi, F2FS_DIRTY_NODES) < COLLECT_DIRTY_NODES) 1251a7fdffbdSJaegeuk Kim return 0; 1252a7fdffbdSJaegeuk Kim 1253e05df3b1SJaegeuk Kim /* if mounting is failed, skip writing node pages */ 1254423e95ccSJaegeuk Kim wbc->nr_to_write = 3 * max_hw_blocks(sbi); 1255e05df3b1SJaegeuk Kim sync_node_pages(sbi, 0, wbc); 1256423e95ccSJaegeuk Kim wbc->nr_to_write = nr_to_write - (3 * max_hw_blocks(sbi) - 1257423e95ccSJaegeuk Kim wbc->nr_to_write); 1258e05df3b1SJaegeuk Kim return 0; 1259e05df3b1SJaegeuk Kim } 1260e05df3b1SJaegeuk Kim 1261e05df3b1SJaegeuk Kim static int f2fs_set_node_page_dirty(struct page *page) 1262e05df3b1SJaegeuk Kim { 1263e05df3b1SJaegeuk Kim struct address_space *mapping = page->mapping; 1264e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); 1265e05df3b1SJaegeuk Kim 126626c6b887SJaegeuk Kim trace_f2fs_set_page_dirty(page, NODE); 126726c6b887SJaegeuk Kim 1268e05df3b1SJaegeuk Kim SetPageUptodate(page); 1269e05df3b1SJaegeuk Kim if (!PageDirty(page)) { 1270e05df3b1SJaegeuk Kim __set_page_dirty_nobuffers(page); 1271e05df3b1SJaegeuk Kim inc_page_count(sbi, F2FS_DIRTY_NODES); 1272e05df3b1SJaegeuk Kim SetPagePrivate(page); 1273e05df3b1SJaegeuk Kim return 1; 1274e05df3b1SJaegeuk Kim } 1275e05df3b1SJaegeuk Kim return 0; 1276e05df3b1SJaegeuk Kim } 1277e05df3b1SJaegeuk Kim 1278d47992f8SLukas Czerner static void f2fs_invalidate_node_page(struct page *page, unsigned int offset, 1279d47992f8SLukas Czerner unsigned int length) 1280e05df3b1SJaegeuk Kim { 1281e05df3b1SJaegeuk Kim struct inode *inode = page->mapping->host; 1282e05df3b1SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); 1283e05df3b1SJaegeuk Kim if (PageDirty(page)) 1284e05df3b1SJaegeuk Kim dec_page_count(sbi, F2FS_DIRTY_NODES); 1285e05df3b1SJaegeuk Kim ClearPagePrivate(page); 1286e05df3b1SJaegeuk Kim } 1287e05df3b1SJaegeuk Kim 1288e05df3b1SJaegeuk Kim static int f2fs_release_node_page(struct page *page, gfp_t wait) 1289e05df3b1SJaegeuk Kim { 1290e05df3b1SJaegeuk Kim ClearPagePrivate(page); 1291c3850aa1SJaegeuk Kim return 1; 1292e05df3b1SJaegeuk Kim } 1293e05df3b1SJaegeuk Kim 12940a8165d7SJaegeuk Kim /* 1295e05df3b1SJaegeuk Kim * Structure of the f2fs node operations 1296e05df3b1SJaegeuk Kim */ 1297e05df3b1SJaegeuk Kim const struct address_space_operations f2fs_node_aops = { 1298e05df3b1SJaegeuk Kim .writepage = f2fs_write_node_page, 1299e05df3b1SJaegeuk Kim .writepages = f2fs_write_node_pages, 1300e05df3b1SJaegeuk Kim .set_page_dirty = f2fs_set_node_page_dirty, 1301e05df3b1SJaegeuk Kim .invalidatepage = f2fs_invalidate_node_page, 1302e05df3b1SJaegeuk Kim .releasepage = f2fs_release_node_page, 1303e05df3b1SJaegeuk Kim }; 1304e05df3b1SJaegeuk Kim 1305e05df3b1SJaegeuk Kim static struct free_nid *__lookup_free_nid_list(nid_t n, struct list_head *head) 1306e05df3b1SJaegeuk Kim { 1307e05df3b1SJaegeuk Kim struct list_head *this; 13083aa770a9SNamjae Jeon struct free_nid *i; 1309e05df3b1SJaegeuk Kim list_for_each(this, head) { 1310e05df3b1SJaegeuk Kim i = list_entry(this, struct free_nid, list); 1311e05df3b1SJaegeuk Kim if (i->nid == n) 1312e05df3b1SJaegeuk Kim return i; 1313e05df3b1SJaegeuk Kim } 13143aa770a9SNamjae Jeon return NULL; 13153aa770a9SNamjae Jeon } 1316e05df3b1SJaegeuk Kim 1317e05df3b1SJaegeuk Kim static void __del_from_free_nid_list(struct free_nid *i) 1318e05df3b1SJaegeuk Kim { 1319e05df3b1SJaegeuk Kim list_del(&i->list); 1320e05df3b1SJaegeuk Kim kmem_cache_free(free_nid_slab, i); 1321e05df3b1SJaegeuk Kim } 1322e05df3b1SJaegeuk Kim 132359bbd474SJaegeuk Kim static int add_free_nid(struct f2fs_nm_info *nm_i, nid_t nid, bool build) 1324e05df3b1SJaegeuk Kim { 1325e05df3b1SJaegeuk Kim struct free_nid *i; 132659bbd474SJaegeuk Kim struct nat_entry *ne; 132759bbd474SJaegeuk Kim bool allocated = false; 1328e05df3b1SJaegeuk Kim 1329e05df3b1SJaegeuk Kim if (nm_i->fcnt > 2 * MAX_FREE_NIDS) 133023d38844SHaicheng Li return -1; 13319198acebSJaegeuk Kim 13329198acebSJaegeuk Kim /* 0 nid should not be used */ 1333cfb271d4SChao Yu if (unlikely(nid == 0)) 13349198acebSJaegeuk Kim return 0; 133559bbd474SJaegeuk Kim 13367bd59381SGu Zheng if (build) { 133759bbd474SJaegeuk Kim /* do not add allocated nids */ 133859bbd474SJaegeuk Kim read_lock(&nm_i->nat_tree_lock); 133959bbd474SJaegeuk Kim ne = __lookup_nat_cache(nm_i, nid); 134059bbd474SJaegeuk Kim if (ne && nat_get_blkaddr(ne) != NULL_ADDR) 134159bbd474SJaegeuk Kim allocated = true; 134259bbd474SJaegeuk Kim read_unlock(&nm_i->nat_tree_lock); 134359bbd474SJaegeuk Kim if (allocated) 134459bbd474SJaegeuk Kim return 0; 1345e05df3b1SJaegeuk Kim } 13467bd59381SGu Zheng 13477bd59381SGu Zheng i = f2fs_kmem_cache_alloc(free_nid_slab, GFP_NOFS); 1348e05df3b1SJaegeuk Kim i->nid = nid; 1349e05df3b1SJaegeuk Kim i->state = NID_NEW; 1350e05df3b1SJaegeuk Kim 1351e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1352e05df3b1SJaegeuk Kim if (__lookup_free_nid_list(nid, &nm_i->free_nid_list)) { 1353e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1354e05df3b1SJaegeuk Kim kmem_cache_free(free_nid_slab, i); 1355e05df3b1SJaegeuk Kim return 0; 1356e05df3b1SJaegeuk Kim } 1357e05df3b1SJaegeuk Kim list_add_tail(&i->list, &nm_i->free_nid_list); 1358e05df3b1SJaegeuk Kim nm_i->fcnt++; 1359e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1360e05df3b1SJaegeuk Kim return 1; 1361e05df3b1SJaegeuk Kim } 1362e05df3b1SJaegeuk Kim 1363e05df3b1SJaegeuk Kim static void remove_free_nid(struct f2fs_nm_info *nm_i, nid_t nid) 1364e05df3b1SJaegeuk Kim { 1365e05df3b1SJaegeuk Kim struct free_nid *i; 1366e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1367e05df3b1SJaegeuk Kim i = __lookup_free_nid_list(nid, &nm_i->free_nid_list); 1368e05df3b1SJaegeuk Kim if (i && i->state == NID_NEW) { 1369e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1370e05df3b1SJaegeuk Kim nm_i->fcnt--; 1371e05df3b1SJaegeuk Kim } 1372e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1373e05df3b1SJaegeuk Kim } 1374e05df3b1SJaegeuk Kim 13758760952dSHaicheng Li static void scan_nat_page(struct f2fs_nm_info *nm_i, 1376e05df3b1SJaegeuk Kim struct page *nat_page, nid_t start_nid) 1377e05df3b1SJaegeuk Kim { 1378e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk = page_address(nat_page); 1379e05df3b1SJaegeuk Kim block_t blk_addr; 1380e05df3b1SJaegeuk Kim int i; 1381e05df3b1SJaegeuk Kim 1382e05df3b1SJaegeuk Kim i = start_nid % NAT_ENTRY_PER_BLOCK; 1383e05df3b1SJaegeuk Kim 1384e05df3b1SJaegeuk Kim for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) { 138523d38844SHaicheng Li 1386cfb271d4SChao Yu if (unlikely(start_nid >= nm_i->max_nid)) 138704431c44SJaegeuk Kim break; 138823d38844SHaicheng Li 1389e05df3b1SJaegeuk Kim blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr); 13905d56b671SJaegeuk Kim f2fs_bug_on(blk_addr == NEW_ADDR); 139123d38844SHaicheng Li if (blk_addr == NULL_ADDR) { 139259bbd474SJaegeuk Kim if (add_free_nid(nm_i, start_nid, true) < 0) 139323d38844SHaicheng Li break; 139423d38844SHaicheng Li } 1395e05df3b1SJaegeuk Kim } 1396e05df3b1SJaegeuk Kim } 1397e05df3b1SJaegeuk Kim 1398e05df3b1SJaegeuk Kim static void build_free_nids(struct f2fs_sb_info *sbi) 1399e05df3b1SJaegeuk Kim { 1400e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1401e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1402e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 14038760952dSHaicheng Li int i = 0; 140455008d84SJaegeuk Kim nid_t nid = nm_i->next_scan_nid; 1405e05df3b1SJaegeuk Kim 140655008d84SJaegeuk Kim /* Enough entries */ 140755008d84SJaegeuk Kim if (nm_i->fcnt > NAT_ENTRY_PER_BLOCK) 140855008d84SJaegeuk Kim return; 1409e05df3b1SJaegeuk Kim 141055008d84SJaegeuk Kim /* readahead nat pages to be scanned */ 1411e05df3b1SJaegeuk Kim ra_nat_pages(sbi, nid); 1412e05df3b1SJaegeuk Kim 1413e05df3b1SJaegeuk Kim while (1) { 1414e05df3b1SJaegeuk Kim struct page *page = get_current_nat_page(sbi, nid); 1415e05df3b1SJaegeuk Kim 14168760952dSHaicheng Li scan_nat_page(nm_i, page, nid); 1417e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1418e05df3b1SJaegeuk Kim 1419e05df3b1SJaegeuk Kim nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK)); 1420cfb271d4SChao Yu if (unlikely(nid >= nm_i->max_nid)) 1421e05df3b1SJaegeuk Kim nid = 0; 142255008d84SJaegeuk Kim 142355008d84SJaegeuk Kim if (i++ == FREE_NID_PAGES) 1424e05df3b1SJaegeuk Kim break; 1425e05df3b1SJaegeuk Kim } 1426e05df3b1SJaegeuk Kim 142755008d84SJaegeuk Kim /* go to the next free nat pages to find free nids abundantly */ 142855008d84SJaegeuk Kim nm_i->next_scan_nid = nid; 1429e05df3b1SJaegeuk Kim 1430e05df3b1SJaegeuk Kim /* find free nids from current sum_pages */ 1431e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1432e05df3b1SJaegeuk Kim for (i = 0; i < nats_in_cursum(sum); i++) { 1433e05df3b1SJaegeuk Kim block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr); 1434e05df3b1SJaegeuk Kim nid = le32_to_cpu(nid_in_journal(sum, i)); 1435e05df3b1SJaegeuk Kim if (addr == NULL_ADDR) 143659bbd474SJaegeuk Kim add_free_nid(nm_i, nid, true); 1437e05df3b1SJaegeuk Kim else 1438e05df3b1SJaegeuk Kim remove_free_nid(nm_i, nid); 1439e05df3b1SJaegeuk Kim } 1440e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1441e05df3b1SJaegeuk Kim } 1442e05df3b1SJaegeuk Kim 1443e05df3b1SJaegeuk Kim /* 1444e05df3b1SJaegeuk Kim * If this function returns success, caller can obtain a new nid 1445e05df3b1SJaegeuk Kim * from second parameter of this function. 1446e05df3b1SJaegeuk Kim * The returned nid could be used ino as well as nid when inode is created. 1447e05df3b1SJaegeuk Kim */ 1448e05df3b1SJaegeuk Kim bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid) 1449e05df3b1SJaegeuk Kim { 1450e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1451e05df3b1SJaegeuk Kim struct free_nid *i = NULL; 1452e05df3b1SJaegeuk Kim struct list_head *this; 1453e05df3b1SJaegeuk Kim retry: 1454cfb271d4SChao Yu if (unlikely(sbi->total_valid_node_count + 1 >= nm_i->max_nid)) 1455e05df3b1SJaegeuk Kim return false; 1456e05df3b1SJaegeuk Kim 1457e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1458e05df3b1SJaegeuk Kim 145955008d84SJaegeuk Kim /* We should not use stale free nids created by build_free_nids */ 146055008d84SJaegeuk Kim if (nm_i->fcnt && !sbi->on_build_free_nids) { 14615d56b671SJaegeuk Kim f2fs_bug_on(list_empty(&nm_i->free_nid_list)); 1462e05df3b1SJaegeuk Kim list_for_each(this, &nm_i->free_nid_list) { 1463e05df3b1SJaegeuk Kim i = list_entry(this, struct free_nid, list); 1464e05df3b1SJaegeuk Kim if (i->state == NID_NEW) 1465e05df3b1SJaegeuk Kim break; 1466e05df3b1SJaegeuk Kim } 1467e05df3b1SJaegeuk Kim 14685d56b671SJaegeuk Kim f2fs_bug_on(i->state != NID_NEW); 1469e05df3b1SJaegeuk Kim *nid = i->nid; 1470e05df3b1SJaegeuk Kim i->state = NID_ALLOC; 1471e05df3b1SJaegeuk Kim nm_i->fcnt--; 1472e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1473e05df3b1SJaegeuk Kim return true; 1474e05df3b1SJaegeuk Kim } 147555008d84SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 147655008d84SJaegeuk Kim 147755008d84SJaegeuk Kim /* Let's scan nat pages and its caches to get free nids */ 147855008d84SJaegeuk Kim mutex_lock(&nm_i->build_lock); 1479aabe5136SHaicheng Li sbi->on_build_free_nids = true; 148055008d84SJaegeuk Kim build_free_nids(sbi); 1481aabe5136SHaicheng Li sbi->on_build_free_nids = false; 148255008d84SJaegeuk Kim mutex_unlock(&nm_i->build_lock); 148355008d84SJaegeuk Kim goto retry; 148455008d84SJaegeuk Kim } 1485e05df3b1SJaegeuk Kim 14860a8165d7SJaegeuk Kim /* 1487e05df3b1SJaegeuk Kim * alloc_nid() should be called prior to this function. 1488e05df3b1SJaegeuk Kim */ 1489e05df3b1SJaegeuk Kim void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid) 1490e05df3b1SJaegeuk Kim { 1491e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1492e05df3b1SJaegeuk Kim struct free_nid *i; 1493e05df3b1SJaegeuk Kim 1494e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1495e05df3b1SJaegeuk Kim i = __lookup_free_nid_list(nid, &nm_i->free_nid_list); 14965d56b671SJaegeuk Kim f2fs_bug_on(!i || i->state != NID_ALLOC); 1497e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1498e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1499e05df3b1SJaegeuk Kim } 1500e05df3b1SJaegeuk Kim 15010a8165d7SJaegeuk Kim /* 1502e05df3b1SJaegeuk Kim * alloc_nid() should be called prior to this function. 1503e05df3b1SJaegeuk Kim */ 1504e05df3b1SJaegeuk Kim void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid) 1505e05df3b1SJaegeuk Kim { 150649952fa1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 150749952fa1SJaegeuk Kim struct free_nid *i; 150849952fa1SJaegeuk Kim 150965985d93SJaegeuk Kim if (!nid) 151065985d93SJaegeuk Kim return; 151165985d93SJaegeuk Kim 151249952fa1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 151349952fa1SJaegeuk Kim i = __lookup_free_nid_list(nid, &nm_i->free_nid_list); 15145d56b671SJaegeuk Kim f2fs_bug_on(!i || i->state != NID_ALLOC); 151595630cbaSHaicheng Li if (nm_i->fcnt > 2 * MAX_FREE_NIDS) { 151695630cbaSHaicheng Li __del_from_free_nid_list(i); 151795630cbaSHaicheng Li } else { 151849952fa1SJaegeuk Kim i->state = NID_NEW; 151949952fa1SJaegeuk Kim nm_i->fcnt++; 152095630cbaSHaicheng Li } 152149952fa1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1522e05df3b1SJaegeuk Kim } 1523e05df3b1SJaegeuk Kim 1524e05df3b1SJaegeuk Kim void recover_node_page(struct f2fs_sb_info *sbi, struct page *page, 1525e05df3b1SJaegeuk Kim struct f2fs_summary *sum, struct node_info *ni, 1526e05df3b1SJaegeuk Kim block_t new_blkaddr) 1527e05df3b1SJaegeuk Kim { 1528e05df3b1SJaegeuk Kim rewrite_node_page(sbi, page, sum, ni->blk_addr, new_blkaddr); 1529e05df3b1SJaegeuk Kim set_node_addr(sbi, ni, new_blkaddr); 1530e05df3b1SJaegeuk Kim clear_node_page_dirty(page); 1531e05df3b1SJaegeuk Kim } 1532e05df3b1SJaegeuk Kim 1533e05df3b1SJaegeuk Kim int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page) 1534e05df3b1SJaegeuk Kim { 1535e05df3b1SJaegeuk Kim struct address_space *mapping = sbi->node_inode->i_mapping; 1536e05df3b1SJaegeuk Kim struct f2fs_node *src, *dst; 1537e05df3b1SJaegeuk Kim nid_t ino = ino_of_node(page); 1538e05df3b1SJaegeuk Kim struct node_info old_ni, new_ni; 1539e05df3b1SJaegeuk Kim struct page *ipage; 1540e05df3b1SJaegeuk Kim 1541e05df3b1SJaegeuk Kim ipage = grab_cache_page(mapping, ino); 1542e05df3b1SJaegeuk Kim if (!ipage) 1543e05df3b1SJaegeuk Kim return -ENOMEM; 1544e05df3b1SJaegeuk Kim 1545e05df3b1SJaegeuk Kim /* Should not use this inode from free nid list */ 1546e05df3b1SJaegeuk Kim remove_free_nid(NM_I(sbi), ino); 1547e05df3b1SJaegeuk Kim 1548e05df3b1SJaegeuk Kim get_node_info(sbi, ino, &old_ni); 1549e05df3b1SJaegeuk Kim SetPageUptodate(ipage); 1550e05df3b1SJaegeuk Kim fill_node_footer(ipage, ino, ino, 0, true); 1551e05df3b1SJaegeuk Kim 155245590710SGu Zheng src = F2FS_NODE(page); 155345590710SGu Zheng dst = F2FS_NODE(ipage); 1554e05df3b1SJaegeuk Kim 1555e05df3b1SJaegeuk Kim memcpy(dst, src, (unsigned long)&src->i.i_ext - (unsigned long)&src->i); 1556e05df3b1SJaegeuk Kim dst->i.i_size = 0; 155725ca923bSJaegeuk Kim dst->i.i_blocks = cpu_to_le64(1); 155825ca923bSJaegeuk Kim dst->i.i_links = cpu_to_le32(1); 1559e05df3b1SJaegeuk Kim dst->i.i_xattr_nid = 0; 1560e05df3b1SJaegeuk Kim 1561e05df3b1SJaegeuk Kim new_ni = old_ni; 1562e05df3b1SJaegeuk Kim new_ni.ino = ino; 1563e05df3b1SJaegeuk Kim 1564cfb271d4SChao Yu if (unlikely(!inc_valid_node_count(sbi, NULL))) 156565e5cd0aSJaegeuk Kim WARN_ON(1); 1566e05df3b1SJaegeuk Kim set_node_addr(sbi, &new_ni, NEW_ADDR); 1567e05df3b1SJaegeuk Kim inc_valid_inode_count(sbi); 1568e05df3b1SJaegeuk Kim f2fs_put_page(ipage, 1); 1569e05df3b1SJaegeuk Kim return 0; 1570e05df3b1SJaegeuk Kim } 1571e05df3b1SJaegeuk Kim 15729af0ff1cSChao Yu /* 15739af0ff1cSChao Yu * ra_sum_pages() merge contiguous pages into one bio and submit. 15749af0ff1cSChao Yu * these pre-readed pages are linked in pages list. 15759af0ff1cSChao Yu */ 15769af0ff1cSChao Yu static int ra_sum_pages(struct f2fs_sb_info *sbi, struct list_head *pages, 15779af0ff1cSChao Yu int start, int nrpages) 15789af0ff1cSChao Yu { 15799af0ff1cSChao Yu struct page *page; 15809af0ff1cSChao Yu int page_idx = start; 1581458e6197SJaegeuk Kim struct f2fs_io_info fio = { 1582458e6197SJaegeuk Kim .type = META, 15837e8f2308SGu Zheng .rw = READ_SYNC | REQ_META | REQ_PRIO 1584458e6197SJaegeuk Kim }; 15859af0ff1cSChao Yu 15869af0ff1cSChao Yu for (; page_idx < start + nrpages; page_idx++) { 15879af0ff1cSChao Yu /* alloc temporal page for read node summary info*/ 1588a0acdfe0SChao Yu page = alloc_page(GFP_F2FS_ZERO); 15899af0ff1cSChao Yu if (!page) { 15909af0ff1cSChao Yu struct page *tmp; 15919af0ff1cSChao Yu list_for_each_entry_safe(page, tmp, pages, lru) { 15929af0ff1cSChao Yu list_del(&page->lru); 15939af0ff1cSChao Yu unlock_page(page); 15949af0ff1cSChao Yu __free_pages(page, 0); 15959af0ff1cSChao Yu } 15969af0ff1cSChao Yu return -ENOMEM; 15979af0ff1cSChao Yu } 15989af0ff1cSChao Yu 15999af0ff1cSChao Yu lock_page(page); 16009af0ff1cSChao Yu page->index = page_idx; 16019af0ff1cSChao Yu list_add_tail(&page->lru, pages); 16029af0ff1cSChao Yu } 16039af0ff1cSChao Yu 16049af0ff1cSChao Yu list_for_each_entry(page, pages, lru) 1605458e6197SJaegeuk Kim f2fs_submit_page_mbio(sbi, page, page->index, &fio); 16069af0ff1cSChao Yu 1607458e6197SJaegeuk Kim f2fs_submit_merged_bio(sbi, META, READ); 16089af0ff1cSChao Yu return 0; 16099af0ff1cSChao Yu } 16109af0ff1cSChao Yu 1611e05df3b1SJaegeuk Kim int restore_node_summary(struct f2fs_sb_info *sbi, 1612e05df3b1SJaegeuk Kim unsigned int segno, struct f2fs_summary_block *sum) 1613e05df3b1SJaegeuk Kim { 1614e05df3b1SJaegeuk Kim struct f2fs_node *rn; 1615e05df3b1SJaegeuk Kim struct f2fs_summary *sum_entry; 16169af0ff1cSChao Yu struct page *page, *tmp; 1617e05df3b1SJaegeuk Kim block_t addr; 16189af0ff1cSChao Yu int bio_blocks = MAX_BIO_BLOCKS(max_hw_blocks(sbi)); 16199af0ff1cSChao Yu int i, last_offset, nrpages, err = 0; 16209af0ff1cSChao Yu LIST_HEAD(page_list); 1621e05df3b1SJaegeuk Kim 1622e05df3b1SJaegeuk Kim /* scan the node segment */ 1623e05df3b1SJaegeuk Kim last_offset = sbi->blocks_per_seg; 1624e05df3b1SJaegeuk Kim addr = START_BLOCK(sbi, segno); 1625e05df3b1SJaegeuk Kim sum_entry = &sum->entries[0]; 1626e05df3b1SJaegeuk Kim 16279af0ff1cSChao Yu for (i = 0; i < last_offset; i += nrpages, addr += nrpages) { 16289af0ff1cSChao Yu nrpages = min(last_offset - i, bio_blocks); 1629393ff91fSJaegeuk Kim 16309af0ff1cSChao Yu /* read ahead node pages */ 16319af0ff1cSChao Yu err = ra_sum_pages(sbi, &page_list, addr, nrpages); 16329af0ff1cSChao Yu if (err) 16339af0ff1cSChao Yu return err; 16349af0ff1cSChao Yu 16359af0ff1cSChao Yu list_for_each_entry_safe(page, tmp, &page_list, lru) { 1636393ff91fSJaegeuk Kim 1637393ff91fSJaegeuk Kim lock_page(page); 16386bacf52fSJaegeuk Kim if (unlikely(!PageUptodate(page))) { 16396bacf52fSJaegeuk Kim err = -EIO; 16406bacf52fSJaegeuk Kim } else { 164145590710SGu Zheng rn = F2FS_NODE(page); 1642393ff91fSJaegeuk Kim sum_entry->nid = rn->footer.nid; 1643393ff91fSJaegeuk Kim sum_entry->version = 0; 1644393ff91fSJaegeuk Kim sum_entry->ofs_in_node = 0; 16459af0ff1cSChao Yu sum_entry++; 1646e05df3b1SJaegeuk Kim } 16479af0ff1cSChao Yu 16489af0ff1cSChao Yu list_del(&page->lru); 1649e05df3b1SJaegeuk Kim unlock_page(page); 1650e05df3b1SJaegeuk Kim __free_pages(page, 0); 16519af0ff1cSChao Yu } 16529af0ff1cSChao Yu } 16539af0ff1cSChao Yu return err; 1654e05df3b1SJaegeuk Kim } 1655e05df3b1SJaegeuk Kim 1656e05df3b1SJaegeuk Kim static bool flush_nats_in_journal(struct f2fs_sb_info *sbi) 1657e05df3b1SJaegeuk Kim { 1658e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1659e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1660e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 1661e05df3b1SJaegeuk Kim int i; 1662e05df3b1SJaegeuk Kim 1663e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1664e05df3b1SJaegeuk Kim 1665e05df3b1SJaegeuk Kim if (nats_in_cursum(sum) < NAT_JOURNAL_ENTRIES) { 1666e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1667e05df3b1SJaegeuk Kim return false; 1668e05df3b1SJaegeuk Kim } 1669e05df3b1SJaegeuk Kim 1670e05df3b1SJaegeuk Kim for (i = 0; i < nats_in_cursum(sum); i++) { 1671e05df3b1SJaegeuk Kim struct nat_entry *ne; 1672e05df3b1SJaegeuk Kim struct f2fs_nat_entry raw_ne; 1673e05df3b1SJaegeuk Kim nid_t nid = le32_to_cpu(nid_in_journal(sum, i)); 1674e05df3b1SJaegeuk Kim 1675e05df3b1SJaegeuk Kim raw_ne = nat_in_journal(sum, i); 1676e05df3b1SJaegeuk Kim retry: 1677e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1678e05df3b1SJaegeuk Kim ne = __lookup_nat_cache(nm_i, nid); 1679e05df3b1SJaegeuk Kim if (ne) { 1680e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, ne); 1681e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1682e05df3b1SJaegeuk Kim continue; 1683e05df3b1SJaegeuk Kim } 1684e05df3b1SJaegeuk Kim ne = grab_nat_entry(nm_i, nid); 1685e05df3b1SJaegeuk Kim if (!ne) { 1686e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1687e05df3b1SJaegeuk Kim goto retry; 1688e05df3b1SJaegeuk Kim } 1689e05df3b1SJaegeuk Kim nat_set_blkaddr(ne, le32_to_cpu(raw_ne.block_addr)); 1690e05df3b1SJaegeuk Kim nat_set_ino(ne, le32_to_cpu(raw_ne.ino)); 1691e05df3b1SJaegeuk Kim nat_set_version(ne, raw_ne.version); 1692e05df3b1SJaegeuk Kim __set_nat_cache_dirty(nm_i, ne); 1693e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1694e05df3b1SJaegeuk Kim } 1695e05df3b1SJaegeuk Kim update_nats_in_cursum(sum, -i); 1696e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1697e05df3b1SJaegeuk Kim return true; 1698e05df3b1SJaegeuk Kim } 1699e05df3b1SJaegeuk Kim 17000a8165d7SJaegeuk Kim /* 1701e05df3b1SJaegeuk Kim * This function is called during the checkpointing process. 1702e05df3b1SJaegeuk Kim */ 1703e05df3b1SJaegeuk Kim void flush_nat_entries(struct f2fs_sb_info *sbi) 1704e05df3b1SJaegeuk Kim { 1705e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1706e05df3b1SJaegeuk Kim struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1707e05df3b1SJaegeuk Kim struct f2fs_summary_block *sum = curseg->sum_blk; 1708e05df3b1SJaegeuk Kim struct list_head *cur, *n; 1709e05df3b1SJaegeuk Kim struct page *page = NULL; 1710e05df3b1SJaegeuk Kim struct f2fs_nat_block *nat_blk = NULL; 1711e05df3b1SJaegeuk Kim nid_t start_nid = 0, end_nid = 0; 1712e05df3b1SJaegeuk Kim bool flushed; 1713e05df3b1SJaegeuk Kim 1714e05df3b1SJaegeuk Kim flushed = flush_nats_in_journal(sbi); 1715e05df3b1SJaegeuk Kim 1716e05df3b1SJaegeuk Kim if (!flushed) 1717e05df3b1SJaegeuk Kim mutex_lock(&curseg->curseg_mutex); 1718e05df3b1SJaegeuk Kim 1719e05df3b1SJaegeuk Kim /* 1) flush dirty nat caches */ 1720e05df3b1SJaegeuk Kim list_for_each_safe(cur, n, &nm_i->dirty_nat_entries) { 1721e05df3b1SJaegeuk Kim struct nat_entry *ne; 1722e05df3b1SJaegeuk Kim nid_t nid; 1723e05df3b1SJaegeuk Kim struct f2fs_nat_entry raw_ne; 1724e05df3b1SJaegeuk Kim int offset = -1; 17252b50638dSJaegeuk Kim block_t new_blkaddr; 1726e05df3b1SJaegeuk Kim 1727e05df3b1SJaegeuk Kim ne = list_entry(cur, struct nat_entry, list); 1728e05df3b1SJaegeuk Kim nid = nat_get_nid(ne); 1729e05df3b1SJaegeuk Kim 1730e05df3b1SJaegeuk Kim if (nat_get_blkaddr(ne) == NEW_ADDR) 1731e05df3b1SJaegeuk Kim continue; 1732e05df3b1SJaegeuk Kim if (flushed) 1733e05df3b1SJaegeuk Kim goto to_nat_page; 1734e05df3b1SJaegeuk Kim 1735e05df3b1SJaegeuk Kim /* if there is room for nat enries in curseg->sumpage */ 1736e05df3b1SJaegeuk Kim offset = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 1); 1737e05df3b1SJaegeuk Kim if (offset >= 0) { 1738e05df3b1SJaegeuk Kim raw_ne = nat_in_journal(sum, offset); 1739e05df3b1SJaegeuk Kim goto flush_now; 1740e05df3b1SJaegeuk Kim } 1741e05df3b1SJaegeuk Kim to_nat_page: 1742e05df3b1SJaegeuk Kim if (!page || (start_nid > nid || nid > end_nid)) { 1743e05df3b1SJaegeuk Kim if (page) { 1744e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1745e05df3b1SJaegeuk Kim page = NULL; 1746e05df3b1SJaegeuk Kim } 1747e05df3b1SJaegeuk Kim start_nid = START_NID(nid); 1748e05df3b1SJaegeuk Kim end_nid = start_nid + NAT_ENTRY_PER_BLOCK - 1; 1749e05df3b1SJaegeuk Kim 1750e05df3b1SJaegeuk Kim /* 1751e05df3b1SJaegeuk Kim * get nat block with dirty flag, increased reference 1752e05df3b1SJaegeuk Kim * count, mapped and lock 1753e05df3b1SJaegeuk Kim */ 1754e05df3b1SJaegeuk Kim page = get_next_nat_page(sbi, start_nid); 1755e05df3b1SJaegeuk Kim nat_blk = page_address(page); 1756e05df3b1SJaegeuk Kim } 1757e05df3b1SJaegeuk Kim 17585d56b671SJaegeuk Kim f2fs_bug_on(!nat_blk); 1759e05df3b1SJaegeuk Kim raw_ne = nat_blk->entries[nid - start_nid]; 1760e05df3b1SJaegeuk Kim flush_now: 1761e05df3b1SJaegeuk Kim new_blkaddr = nat_get_blkaddr(ne); 1762e05df3b1SJaegeuk Kim 1763e05df3b1SJaegeuk Kim raw_ne.ino = cpu_to_le32(nat_get_ino(ne)); 1764e05df3b1SJaegeuk Kim raw_ne.block_addr = cpu_to_le32(new_blkaddr); 1765e05df3b1SJaegeuk Kim raw_ne.version = nat_get_version(ne); 1766e05df3b1SJaegeuk Kim 1767e05df3b1SJaegeuk Kim if (offset < 0) { 1768e05df3b1SJaegeuk Kim nat_blk->entries[nid - start_nid] = raw_ne; 1769e05df3b1SJaegeuk Kim } else { 1770e05df3b1SJaegeuk Kim nat_in_journal(sum, offset) = raw_ne; 1771e05df3b1SJaegeuk Kim nid_in_journal(sum, offset) = cpu_to_le32(nid); 1772e05df3b1SJaegeuk Kim } 1773e05df3b1SJaegeuk Kim 1774fa372417SJaegeuk Kim if (nat_get_blkaddr(ne) == NULL_ADDR && 177559bbd474SJaegeuk Kim add_free_nid(NM_I(sbi), nid, false) <= 0) { 1776e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1777e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, ne); 1778e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1779e05df3b1SJaegeuk Kim } else { 1780e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1781e05df3b1SJaegeuk Kim __clear_nat_cache_dirty(nm_i, ne); 1782e05df3b1SJaegeuk Kim ne->checkpointed = true; 1783e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1784e05df3b1SJaegeuk Kim } 1785e05df3b1SJaegeuk Kim } 1786e05df3b1SJaegeuk Kim if (!flushed) 1787e05df3b1SJaegeuk Kim mutex_unlock(&curseg->curseg_mutex); 1788e05df3b1SJaegeuk Kim f2fs_put_page(page, 1); 1789e05df3b1SJaegeuk Kim 1790e05df3b1SJaegeuk Kim /* 2) shrink nat caches if necessary */ 1791e05df3b1SJaegeuk Kim try_to_free_nats(sbi, nm_i->nat_cnt - NM_WOUT_THRESHOLD); 1792e05df3b1SJaegeuk Kim } 1793e05df3b1SJaegeuk Kim 1794e05df3b1SJaegeuk Kim static int init_node_manager(struct f2fs_sb_info *sbi) 1795e05df3b1SJaegeuk Kim { 1796e05df3b1SJaegeuk Kim struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi); 1797e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1798e05df3b1SJaegeuk Kim unsigned char *version_bitmap; 1799e05df3b1SJaegeuk Kim unsigned int nat_segs, nat_blocks; 1800e05df3b1SJaegeuk Kim 1801e05df3b1SJaegeuk Kim nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); 1802e05df3b1SJaegeuk Kim 1803e05df3b1SJaegeuk Kim /* segment_count_nat includes pair segment so divide to 2. */ 1804e05df3b1SJaegeuk Kim nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1; 1805e05df3b1SJaegeuk Kim nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); 1806e05df3b1SJaegeuk Kim nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks; 1807e05df3b1SJaegeuk Kim nm_i->fcnt = 0; 1808e05df3b1SJaegeuk Kim nm_i->nat_cnt = 0; 1809e05df3b1SJaegeuk Kim 1810e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->free_nid_list); 1811e05df3b1SJaegeuk Kim INIT_RADIX_TREE(&nm_i->nat_root, GFP_ATOMIC); 1812e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->nat_entries); 1813e05df3b1SJaegeuk Kim INIT_LIST_HEAD(&nm_i->dirty_nat_entries); 1814e05df3b1SJaegeuk Kim 1815e05df3b1SJaegeuk Kim mutex_init(&nm_i->build_lock); 1816e05df3b1SJaegeuk Kim spin_lock_init(&nm_i->free_nid_list_lock); 1817e05df3b1SJaegeuk Kim rwlock_init(&nm_i->nat_tree_lock); 1818e05df3b1SJaegeuk Kim 1819e05df3b1SJaegeuk Kim nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); 182079b5793bSAlexandru Gheorghiu nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); 1821e05df3b1SJaegeuk Kim version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP); 1822e05df3b1SJaegeuk Kim if (!version_bitmap) 1823e05df3b1SJaegeuk Kim return -EFAULT; 1824e05df3b1SJaegeuk Kim 182579b5793bSAlexandru Gheorghiu nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size, 182679b5793bSAlexandru Gheorghiu GFP_KERNEL); 182779b5793bSAlexandru Gheorghiu if (!nm_i->nat_bitmap) 182879b5793bSAlexandru Gheorghiu return -ENOMEM; 1829e05df3b1SJaegeuk Kim return 0; 1830e05df3b1SJaegeuk Kim } 1831e05df3b1SJaegeuk Kim 1832e05df3b1SJaegeuk Kim int build_node_manager(struct f2fs_sb_info *sbi) 1833e05df3b1SJaegeuk Kim { 1834e05df3b1SJaegeuk Kim int err; 1835e05df3b1SJaegeuk Kim 1836e05df3b1SJaegeuk Kim sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL); 1837e05df3b1SJaegeuk Kim if (!sbi->nm_info) 1838e05df3b1SJaegeuk Kim return -ENOMEM; 1839e05df3b1SJaegeuk Kim 1840e05df3b1SJaegeuk Kim err = init_node_manager(sbi); 1841e05df3b1SJaegeuk Kim if (err) 1842e05df3b1SJaegeuk Kim return err; 1843e05df3b1SJaegeuk Kim 1844e05df3b1SJaegeuk Kim build_free_nids(sbi); 1845e05df3b1SJaegeuk Kim return 0; 1846e05df3b1SJaegeuk Kim } 1847e05df3b1SJaegeuk Kim 1848e05df3b1SJaegeuk Kim void destroy_node_manager(struct f2fs_sb_info *sbi) 1849e05df3b1SJaegeuk Kim { 1850e05df3b1SJaegeuk Kim struct f2fs_nm_info *nm_i = NM_I(sbi); 1851e05df3b1SJaegeuk Kim struct free_nid *i, *next_i; 1852e05df3b1SJaegeuk Kim struct nat_entry *natvec[NATVEC_SIZE]; 1853e05df3b1SJaegeuk Kim nid_t nid = 0; 1854e05df3b1SJaegeuk Kim unsigned int found; 1855e05df3b1SJaegeuk Kim 1856e05df3b1SJaegeuk Kim if (!nm_i) 1857e05df3b1SJaegeuk Kim return; 1858e05df3b1SJaegeuk Kim 1859e05df3b1SJaegeuk Kim /* destroy free nid list */ 1860e05df3b1SJaegeuk Kim spin_lock(&nm_i->free_nid_list_lock); 1861e05df3b1SJaegeuk Kim list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { 18625d56b671SJaegeuk Kim f2fs_bug_on(i->state == NID_ALLOC); 1863e05df3b1SJaegeuk Kim __del_from_free_nid_list(i); 1864e05df3b1SJaegeuk Kim nm_i->fcnt--; 1865e05df3b1SJaegeuk Kim } 18665d56b671SJaegeuk Kim f2fs_bug_on(nm_i->fcnt); 1867e05df3b1SJaegeuk Kim spin_unlock(&nm_i->free_nid_list_lock); 1868e05df3b1SJaegeuk Kim 1869e05df3b1SJaegeuk Kim /* destroy nat cache */ 1870e05df3b1SJaegeuk Kim write_lock(&nm_i->nat_tree_lock); 1871e05df3b1SJaegeuk Kim while ((found = __gang_lookup_nat_cache(nm_i, 1872e05df3b1SJaegeuk Kim nid, NATVEC_SIZE, natvec))) { 1873e05df3b1SJaegeuk Kim unsigned idx; 1874e05df3b1SJaegeuk Kim for (idx = 0; idx < found; idx++) { 1875e05df3b1SJaegeuk Kim struct nat_entry *e = natvec[idx]; 1876e05df3b1SJaegeuk Kim nid = nat_get_nid(e) + 1; 1877e05df3b1SJaegeuk Kim __del_from_nat_cache(nm_i, e); 1878e05df3b1SJaegeuk Kim } 1879e05df3b1SJaegeuk Kim } 18805d56b671SJaegeuk Kim f2fs_bug_on(nm_i->nat_cnt); 1881e05df3b1SJaegeuk Kim write_unlock(&nm_i->nat_tree_lock); 1882e05df3b1SJaegeuk Kim 1883e05df3b1SJaegeuk Kim kfree(nm_i->nat_bitmap); 1884e05df3b1SJaegeuk Kim sbi->nm_info = NULL; 1885e05df3b1SJaegeuk Kim kfree(nm_i); 1886e05df3b1SJaegeuk Kim } 1887e05df3b1SJaegeuk Kim 18886e6093a8SNamjae Jeon int __init create_node_manager_caches(void) 1889e05df3b1SJaegeuk Kim { 1890e05df3b1SJaegeuk Kim nat_entry_slab = f2fs_kmem_cache_create("nat_entry", 1891e05df3b1SJaegeuk Kim sizeof(struct nat_entry), NULL); 1892e05df3b1SJaegeuk Kim if (!nat_entry_slab) 1893e05df3b1SJaegeuk Kim return -ENOMEM; 1894e05df3b1SJaegeuk Kim 1895e05df3b1SJaegeuk Kim free_nid_slab = f2fs_kmem_cache_create("free_nid", 1896e05df3b1SJaegeuk Kim sizeof(struct free_nid), NULL); 1897e05df3b1SJaegeuk Kim if (!free_nid_slab) { 1898e05df3b1SJaegeuk Kim kmem_cache_destroy(nat_entry_slab); 1899e05df3b1SJaegeuk Kim return -ENOMEM; 1900e05df3b1SJaegeuk Kim } 1901e05df3b1SJaegeuk Kim return 0; 1902e05df3b1SJaegeuk Kim } 1903e05df3b1SJaegeuk Kim 1904e05df3b1SJaegeuk Kim void destroy_node_manager_caches(void) 1905e05df3b1SJaegeuk Kim { 1906e05df3b1SJaegeuk Kim kmem_cache_destroy(free_nid_slab); 1907e05df3b1SJaegeuk Kim kmem_cache_destroy(nat_entry_slab); 1908e05df3b1SJaegeuk Kim } 1909