4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
12 #include <linux/f2fs_fs.h>
13 #include <linux/mpage.h>
14 #include <linux/backing-dev.h>
15 #include <linux/blkdev.h>
16 #include <linux/pagevec.h>
17 #include <linux/swap.h>
24 #include <trace/events/f2fs.h>
26 #define on_build_free_nids(nmi) mutex_is_locked(&(nm_i)->build_lock)
28 static struct kmem_cache *nat_entry_slab;
29 static struct kmem_cache *free_nid_slab;
30 static struct kmem_cache *nat_entry_set_slab;
32 bool available_free_memory(struct f2fs_sb_info *sbi, int type)
34 struct f2fs_nm_info *nm_i = NM_I(sbi);
36 unsigned long avail_ram;
37 unsigned long mem_size = 0;
42 /* only uses low memory */
43 avail_ram = val.totalram - val.totalhigh;
46 * give 25%, 25%, 50%, 50%, 50% memory for each components respectively
48 if (type == FREE_NIDS) {
49 mem_size = (nm_i->nid_cnt[FREE_NID] *
50 sizeof(struct free_nid)) >> PAGE_SHIFT;
51 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2);
52 } else if (type == NAT_ENTRIES) {
53 mem_size = (nm_i->nat_cnt * sizeof(struct nat_entry)) >>
55 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2);
56 if (excess_cached_nats(sbi))
58 } else if (type == DIRTY_DENTS) {
59 if (sbi->sb->s_bdi->wb.dirty_exceeded)
61 mem_size = get_pages(sbi, F2FS_DIRTY_DENTS);
62 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1);
63 } else if (type == INO_ENTRIES) {
66 for (i = 0; i < MAX_INO_ENTRY; i++)
67 mem_size += sbi->im[i].ino_num *
68 sizeof(struct ino_entry);
69 mem_size >>= PAGE_SHIFT;
70 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1);
71 } else if (type == EXTENT_CACHE) {
72 mem_size = (atomic_read(&sbi->total_ext_tree) *
73 sizeof(struct extent_tree) +
74 atomic_read(&sbi->total_ext_node) *
75 sizeof(struct extent_node)) >> PAGE_SHIFT;
76 res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1);
77 } else if (type == INMEM_PAGES) {
78 /* it allows 20% / total_ram for inmemory pages */
79 mem_size = get_pages(sbi, F2FS_INMEM_PAGES);
80 res = mem_size < (val.totalram / 5);
82 if (!sbi->sb->s_bdi->wb.dirty_exceeded)
88 static void clear_node_page_dirty(struct page *page)
90 struct address_space *mapping = page->mapping;
91 unsigned int long flags;
93 if (PageDirty(page)) {
94 spin_lock_irqsave(&mapping->tree_lock, flags);
95 radix_tree_tag_clear(&mapping->page_tree,
98 spin_unlock_irqrestore(&mapping->tree_lock, flags);
100 clear_page_dirty_for_io(page);
101 dec_page_count(F2FS_M_SB(mapping), F2FS_DIRTY_NODES);
103 ClearPageUptodate(page);
106 static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
108 pgoff_t index = current_nat_addr(sbi, nid);
109 return get_meta_page(sbi, index);
112 static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
114 struct page *src_page;
115 struct page *dst_page;
120 struct f2fs_nm_info *nm_i = NM_I(sbi);
122 src_off = current_nat_addr(sbi, nid);
123 dst_off = next_nat_addr(sbi, src_off);
125 /* get current nat block page with lock */
126 src_page = get_meta_page(sbi, src_off);
127 dst_page = grab_meta_page(sbi, dst_off);
128 f2fs_bug_on(sbi, PageDirty(src_page));
130 src_addr = page_address(src_page);
131 dst_addr = page_address(dst_page);
132 memcpy(dst_addr, src_addr, PAGE_SIZE);
133 set_page_dirty(dst_page);
134 f2fs_put_page(src_page, 1);
136 set_to_next_nat(nm_i, nid);
141 static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n)
143 return radix_tree_lookup(&nm_i->nat_root, n);
146 static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i,
147 nid_t start, unsigned int nr, struct nat_entry **ep)
149 return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr);
152 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e)
155 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e));
157 kmem_cache_free(nat_entry_slab, e);
160 static void __set_nat_cache_dirty(struct f2fs_nm_info *nm_i,
161 struct nat_entry *ne)
163 nid_t set = NAT_BLOCK_OFFSET(ne->ni.nid);
164 struct nat_entry_set *head;
166 head = radix_tree_lookup(&nm_i->nat_set_root, set);
168 head = f2fs_kmem_cache_alloc(nat_entry_set_slab, GFP_NOFS);
170 INIT_LIST_HEAD(&head->entry_list);
171 INIT_LIST_HEAD(&head->set_list);
174 f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head);
177 if (get_nat_flag(ne, IS_DIRTY))
180 nm_i->dirty_nat_cnt++;
182 set_nat_flag(ne, IS_DIRTY, true);
184 if (nat_get_blkaddr(ne) == NEW_ADDR)
185 list_del_init(&ne->list);
187 list_move_tail(&ne->list, &head->entry_list);
190 static void __clear_nat_cache_dirty(struct f2fs_nm_info *nm_i,
191 struct nat_entry_set *set, struct nat_entry *ne)
193 list_move_tail(&ne->list, &nm_i->nat_entries);
194 set_nat_flag(ne, IS_DIRTY, false);
196 nm_i->dirty_nat_cnt--;
199 static unsigned int __gang_lookup_nat_set(struct f2fs_nm_info *nm_i,
200 nid_t start, unsigned int nr, struct nat_entry_set **ep)
202 return radix_tree_gang_lookup(&nm_i->nat_set_root, (void **)ep,
206 int need_dentry_mark(struct f2fs_sb_info *sbi, nid_t nid)
208 struct f2fs_nm_info *nm_i = NM_I(sbi);
212 down_read(&nm_i->nat_tree_lock);
213 e = __lookup_nat_cache(nm_i, nid);
215 if (!get_nat_flag(e, IS_CHECKPOINTED) &&
216 !get_nat_flag(e, HAS_FSYNCED_INODE))
219 up_read(&nm_i->nat_tree_lock);
223 bool is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid)
225 struct f2fs_nm_info *nm_i = NM_I(sbi);
229 down_read(&nm_i->nat_tree_lock);
230 e = __lookup_nat_cache(nm_i, nid);
231 if (e && !get_nat_flag(e, IS_CHECKPOINTED))
233 up_read(&nm_i->nat_tree_lock);
237 bool need_inode_block_update(struct f2fs_sb_info *sbi, nid_t ino)
239 struct f2fs_nm_info *nm_i = NM_I(sbi);
241 bool need_update = true;
243 down_read(&nm_i->nat_tree_lock);
244 e = __lookup_nat_cache(nm_i, ino);
245 if (e && get_nat_flag(e, HAS_LAST_FSYNC) &&
246 (get_nat_flag(e, IS_CHECKPOINTED) ||
247 get_nat_flag(e, HAS_FSYNCED_INODE)))
249 up_read(&nm_i->nat_tree_lock);
253 static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid,
256 struct nat_entry *new;
259 new = f2fs_kmem_cache_alloc(nat_entry_slab, GFP_NOFS);
260 f2fs_radix_tree_insert(&nm_i->nat_root, nid, new);
262 new = kmem_cache_alloc(nat_entry_slab, GFP_NOFS);
265 if (radix_tree_insert(&nm_i->nat_root, nid, new)) {
266 kmem_cache_free(nat_entry_slab, new);
271 memset(new, 0, sizeof(struct nat_entry));
272 nat_set_nid(new, nid);
274 list_add_tail(&new->list, &nm_i->nat_entries);
279 static void cache_nat_entry(struct f2fs_sb_info *sbi, nid_t nid,
280 struct f2fs_nat_entry *ne)
282 struct f2fs_nm_info *nm_i = NM_I(sbi);
285 e = __lookup_nat_cache(nm_i, nid);
287 e = grab_nat_entry(nm_i, nid, false);
289 node_info_from_raw_nat(&e->ni, ne);
291 f2fs_bug_on(sbi, nat_get_ino(e) != le32_to_cpu(ne->ino) ||
292 nat_get_blkaddr(e) !=
293 le32_to_cpu(ne->block_addr) ||
294 nat_get_version(e) != ne->version);
298 static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni,
299 block_t new_blkaddr, bool fsync_done)
301 struct f2fs_nm_info *nm_i = NM_I(sbi);
304 down_write(&nm_i->nat_tree_lock);
305 e = __lookup_nat_cache(nm_i, ni->nid);
307 e = grab_nat_entry(nm_i, ni->nid, true);
308 copy_node_info(&e->ni, ni);
309 f2fs_bug_on(sbi, ni->blk_addr == NEW_ADDR);
310 } else if (new_blkaddr == NEW_ADDR) {
312 * when nid is reallocated,
313 * previous nat entry can be remained in nat cache.
314 * So, reinitialize it with new information.
316 copy_node_info(&e->ni, ni);
317 f2fs_bug_on(sbi, ni->blk_addr != NULL_ADDR);
321 f2fs_bug_on(sbi, nat_get_blkaddr(e) != ni->blk_addr);
322 f2fs_bug_on(sbi, nat_get_blkaddr(e) == NULL_ADDR &&
323 new_blkaddr == NULL_ADDR);
324 f2fs_bug_on(sbi, nat_get_blkaddr(e) == NEW_ADDR &&
325 new_blkaddr == NEW_ADDR);
326 f2fs_bug_on(sbi, nat_get_blkaddr(e) != NEW_ADDR &&
327 nat_get_blkaddr(e) != NULL_ADDR &&
328 new_blkaddr == NEW_ADDR);
330 /* increment version no as node is removed */
331 if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) {
332 unsigned char version = nat_get_version(e);
333 nat_set_version(e, inc_node_version(version));
337 nat_set_blkaddr(e, new_blkaddr);
338 if (new_blkaddr == NEW_ADDR || new_blkaddr == NULL_ADDR)
339 set_nat_flag(e, IS_CHECKPOINTED, false);
340 __set_nat_cache_dirty(nm_i, e);
342 /* update fsync_mark if its inode nat entry is still alive */
343 if (ni->nid != ni->ino)
344 e = __lookup_nat_cache(nm_i, ni->ino);
346 if (fsync_done && ni->nid == ni->ino)
347 set_nat_flag(e, HAS_FSYNCED_INODE, true);
348 set_nat_flag(e, HAS_LAST_FSYNC, fsync_done);
350 up_write(&nm_i->nat_tree_lock);
353 int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink)
355 struct f2fs_nm_info *nm_i = NM_I(sbi);
358 if (!down_write_trylock(&nm_i->nat_tree_lock))
361 while (nr_shrink && !list_empty(&nm_i->nat_entries)) {
362 struct nat_entry *ne;
363 ne = list_first_entry(&nm_i->nat_entries,
364 struct nat_entry, list);
365 __del_from_nat_cache(nm_i, ne);
368 up_write(&nm_i->nat_tree_lock);
369 return nr - nr_shrink;
373 * This function always returns success
375 void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni)
377 struct f2fs_nm_info *nm_i = NM_I(sbi);
378 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
379 struct f2fs_journal *journal = curseg->journal;
380 nid_t start_nid = START_NID(nid);
381 struct f2fs_nat_block *nat_blk;
382 struct page *page = NULL;
383 struct f2fs_nat_entry ne;
390 /* Check nat cache */
391 down_read(&nm_i->nat_tree_lock);
392 e = __lookup_nat_cache(nm_i, nid);
394 ni->ino = nat_get_ino(e);
395 ni->blk_addr = nat_get_blkaddr(e);
396 ni->version = nat_get_version(e);
397 up_read(&nm_i->nat_tree_lock);
401 memset(&ne, 0, sizeof(struct f2fs_nat_entry));
403 /* Check current segment summary */
404 down_read(&curseg->journal_rwsem);
405 i = lookup_journal_in_cursum(journal, NAT_JOURNAL, nid, 0);
407 ne = nat_in_journal(journal, i);
408 node_info_from_raw_nat(ni, &ne);
410 up_read(&curseg->journal_rwsem);
412 up_read(&nm_i->nat_tree_lock);
416 /* Fill node_info from nat page */
417 index = current_nat_addr(sbi, nid);
418 up_read(&nm_i->nat_tree_lock);
420 page = get_meta_page(sbi, index);
421 nat_blk = (struct f2fs_nat_block *)page_address(page);
422 ne = nat_blk->entries[nid - start_nid];
423 node_info_from_raw_nat(ni, &ne);
424 f2fs_put_page(page, 1);
426 /* cache nat entry */
427 down_write(&nm_i->nat_tree_lock);
428 cache_nat_entry(sbi, nid, &ne);
429 up_write(&nm_i->nat_tree_lock);
433 * readahead MAX_RA_NODE number of node pages.
435 static void ra_node_pages(struct page *parent, int start, int n)
437 struct f2fs_sb_info *sbi = F2FS_P_SB(parent);
438 struct blk_plug plug;
442 blk_start_plug(&plug);
444 /* Then, try readahead for siblings of the desired node */
446 end = min(end, NIDS_PER_BLOCK);
447 for (i = start; i < end; i++) {
448 nid = get_nid(parent, i, false);
449 ra_node_page(sbi, nid);
452 blk_finish_plug(&plug);
455 pgoff_t get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs)
457 const long direct_index = ADDRS_PER_INODE(dn->inode);
458 const long direct_blks = ADDRS_PER_BLOCK;
459 const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK;
460 unsigned int skipped_unit = ADDRS_PER_BLOCK;
461 int cur_level = dn->cur_level;
462 int max_level = dn->max_level;
468 while (max_level-- > cur_level)
469 skipped_unit *= NIDS_PER_BLOCK;
471 switch (dn->max_level) {
473 base += 2 * indirect_blks;
475 base += 2 * direct_blks;
477 base += direct_index;
480 f2fs_bug_on(F2FS_I_SB(dn->inode), 1);
483 return ((pgofs - base) / skipped_unit + 1) * skipped_unit + base;
487 * The maximum depth is four.
488 * Offset[0] will have raw inode offset.
490 static int get_node_path(struct inode *inode, long block,
491 int offset[4], unsigned int noffset[4])
493 const long direct_index = ADDRS_PER_INODE(inode);
494 const long direct_blks = ADDRS_PER_BLOCK;
495 const long dptrs_per_blk = NIDS_PER_BLOCK;
496 const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK;
497 const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK;
503 if (block < direct_index) {
507 block -= direct_index;
508 if (block < direct_blks) {
509 offset[n++] = NODE_DIR1_BLOCK;
515 block -= direct_blks;
516 if (block < direct_blks) {
517 offset[n++] = NODE_DIR2_BLOCK;
523 block -= direct_blks;
524 if (block < indirect_blks) {
525 offset[n++] = NODE_IND1_BLOCK;
527 offset[n++] = block / direct_blks;
528 noffset[n] = 4 + offset[n - 1];
529 offset[n] = block % direct_blks;
533 block -= indirect_blks;
534 if (block < indirect_blks) {
535 offset[n++] = NODE_IND2_BLOCK;
536 noffset[n] = 4 + dptrs_per_blk;
537 offset[n++] = block / direct_blks;
538 noffset[n] = 5 + dptrs_per_blk + offset[n - 1];
539 offset[n] = block % direct_blks;
543 block -= indirect_blks;
544 if (block < dindirect_blks) {
545 offset[n++] = NODE_DIND_BLOCK;
546 noffset[n] = 5 + (dptrs_per_blk * 2);
547 offset[n++] = block / indirect_blks;
548 noffset[n] = 6 + (dptrs_per_blk * 2) +
549 offset[n - 1] * (dptrs_per_blk + 1);
550 offset[n++] = (block / direct_blks) % dptrs_per_blk;
551 noffset[n] = 7 + (dptrs_per_blk * 2) +
552 offset[n - 2] * (dptrs_per_blk + 1) +
554 offset[n] = block % direct_blks;
565 * Caller should call f2fs_put_dnode(dn).
566 * Also, it should grab and release a rwsem by calling f2fs_lock_op() and
567 * f2fs_unlock_op() only if ro is not set RDONLY_NODE.
568 * In the case of RDONLY_NODE, we don't need to care about mutex.
570 int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode)
572 struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
573 struct page *npage[4];
574 struct page *parent = NULL;
576 unsigned int noffset[4];
581 level = get_node_path(dn->inode, index, offset, noffset);
585 nids[0] = dn->inode->i_ino;
586 npage[0] = dn->inode_page;
589 npage[0] = get_node_page(sbi, nids[0]);
590 if (IS_ERR(npage[0]))
591 return PTR_ERR(npage[0]);
594 /* if inline_data is set, should not report any block indices */
595 if (f2fs_has_inline_data(dn->inode) && index) {
597 f2fs_put_page(npage[0], 1);
603 nids[1] = get_nid(parent, offset[0], true);
604 dn->inode_page = npage[0];
605 dn->inode_page_locked = true;
607 /* get indirect or direct nodes */
608 for (i = 1; i <= level; i++) {
611 if (!nids[i] && mode == ALLOC_NODE) {
613 if (!alloc_nid(sbi, &(nids[i]))) {
619 npage[i] = new_node_page(dn, noffset[i]);
620 if (IS_ERR(npage[i])) {
621 alloc_nid_failed(sbi, nids[i]);
622 err = PTR_ERR(npage[i]);
626 set_nid(parent, offset[i - 1], nids[i], i == 1);
627 alloc_nid_done(sbi, nids[i]);
629 } else if (mode == LOOKUP_NODE_RA && i == level && level > 1) {
630 npage[i] = get_node_page_ra(parent, offset[i - 1]);
631 if (IS_ERR(npage[i])) {
632 err = PTR_ERR(npage[i]);
638 dn->inode_page_locked = false;
641 f2fs_put_page(parent, 1);
645 npage[i] = get_node_page(sbi, nids[i]);
646 if (IS_ERR(npage[i])) {
647 err = PTR_ERR(npage[i]);
648 f2fs_put_page(npage[0], 0);
654 nids[i + 1] = get_nid(parent, offset[i], false);
657 dn->nid = nids[level];
658 dn->ofs_in_node = offset[level];
659 dn->node_page = npage[level];
660 dn->data_blkaddr = datablock_addr(dn->inode,
661 dn->node_page, dn->ofs_in_node);
665 f2fs_put_page(parent, 1);
667 f2fs_put_page(npage[0], 0);
669 dn->inode_page = NULL;
670 dn->node_page = NULL;
671 if (err == -ENOENT) {
673 dn->max_level = level;
674 dn->ofs_in_node = offset[level];
679 static void truncate_node(struct dnode_of_data *dn)
681 struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
684 get_node_info(sbi, dn->nid, &ni);
685 f2fs_bug_on(sbi, ni.blk_addr == NULL_ADDR);
687 /* Deallocate node address */
688 invalidate_blocks(sbi, ni.blk_addr);
689 dec_valid_node_count(sbi, dn->inode, dn->nid == dn->inode->i_ino);
690 set_node_addr(sbi, &ni, NULL_ADDR, false);
692 if (dn->nid == dn->inode->i_ino) {
693 remove_orphan_inode(sbi, dn->nid);
694 dec_valid_inode_count(sbi);
695 f2fs_inode_synced(dn->inode);
698 clear_node_page_dirty(dn->node_page);
699 set_sbi_flag(sbi, SBI_IS_DIRTY);
701 f2fs_put_page(dn->node_page, 1);
703 invalidate_mapping_pages(NODE_MAPPING(sbi),
704 dn->node_page->index, dn->node_page->index);
706 dn->node_page = NULL;
707 trace_f2fs_truncate_node(dn->inode, dn->nid, ni.blk_addr);
710 static int truncate_dnode(struct dnode_of_data *dn)
717 /* get direct node */
718 page = get_node_page(F2FS_I_SB(dn->inode), dn->nid);
719 if (IS_ERR(page) && PTR_ERR(page) == -ENOENT)
721 else if (IS_ERR(page))
722 return PTR_ERR(page);
724 /* Make dnode_of_data for parameter */
725 dn->node_page = page;
727 truncate_data_blocks(dn);
732 static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs,
735 struct dnode_of_data rdn = *dn;
737 struct f2fs_node *rn;
739 unsigned int child_nofs;
744 return NIDS_PER_BLOCK + 1;
746 trace_f2fs_truncate_nodes_enter(dn->inode, dn->nid, dn->data_blkaddr);
748 page = get_node_page(F2FS_I_SB(dn->inode), dn->nid);
750 trace_f2fs_truncate_nodes_exit(dn->inode, PTR_ERR(page));
751 return PTR_ERR(page);
754 ra_node_pages(page, ofs, NIDS_PER_BLOCK);
756 rn = F2FS_NODE(page);
758 for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) {
759 child_nid = le32_to_cpu(rn->in.nid[i]);
763 ret = truncate_dnode(&rdn);
766 if (set_nid(page, i, 0, false))
767 dn->node_changed = true;
770 child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1;
771 for (i = ofs; i < NIDS_PER_BLOCK; i++) {
772 child_nid = le32_to_cpu(rn->in.nid[i]);
773 if (child_nid == 0) {
774 child_nofs += NIDS_PER_BLOCK + 1;
778 ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1);
779 if (ret == (NIDS_PER_BLOCK + 1)) {
780 if (set_nid(page, i, 0, false))
781 dn->node_changed = true;
783 } else if (ret < 0 && ret != -ENOENT) {
791 /* remove current indirect node */
792 dn->node_page = page;
796 f2fs_put_page(page, 1);
798 trace_f2fs_truncate_nodes_exit(dn->inode, freed);
802 f2fs_put_page(page, 1);
803 trace_f2fs_truncate_nodes_exit(dn->inode, ret);
807 static int truncate_partial_nodes(struct dnode_of_data *dn,
808 struct f2fs_inode *ri, int *offset, int depth)
810 struct page *pages[2];
817 nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]);
821 /* get indirect nodes in the path */
822 for (i = 0; i < idx + 1; i++) {
823 /* reference count'll be increased */
824 pages[i] = get_node_page(F2FS_I_SB(dn->inode), nid[i]);
825 if (IS_ERR(pages[i])) {
826 err = PTR_ERR(pages[i]);
830 nid[i + 1] = get_nid(pages[i], offset[i + 1], false);
833 ra_node_pages(pages[idx], offset[idx + 1], NIDS_PER_BLOCK);
835 /* free direct nodes linked to a partial indirect node */
836 for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) {
837 child_nid = get_nid(pages[idx], i, false);
841 err = truncate_dnode(dn);
844 if (set_nid(pages[idx], i, 0, false))
845 dn->node_changed = true;
848 if (offset[idx + 1] == 0) {
849 dn->node_page = pages[idx];
853 f2fs_put_page(pages[idx], 1);
859 for (i = idx; i >= 0; i--)
860 f2fs_put_page(pages[i], 1);
862 trace_f2fs_truncate_partial_nodes(dn->inode, nid, depth, err);
868 * All the block addresses of data and nodes should be nullified.
870 int truncate_inode_blocks(struct inode *inode, pgoff_t from)
872 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
873 int err = 0, cont = 1;
874 int level, offset[4], noffset[4];
875 unsigned int nofs = 0;
876 struct f2fs_inode *ri;
877 struct dnode_of_data dn;
880 trace_f2fs_truncate_inode_blocks_enter(inode, from);
882 level = get_node_path(inode, from, offset, noffset);
886 page = get_node_page(sbi, inode->i_ino);
888 trace_f2fs_truncate_inode_blocks_exit(inode, PTR_ERR(page));
889 return PTR_ERR(page);
892 set_new_dnode(&dn, inode, page, NULL, 0);
895 ri = F2FS_INODE(page);
903 if (!offset[level - 1])
905 err = truncate_partial_nodes(&dn, ri, offset, level);
906 if (err < 0 && err != -ENOENT)
908 nofs += 1 + NIDS_PER_BLOCK;
911 nofs = 5 + 2 * NIDS_PER_BLOCK;
912 if (!offset[level - 1])
914 err = truncate_partial_nodes(&dn, ri, offset, level);
915 if (err < 0 && err != -ENOENT)
924 dn.nid = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]);
926 case NODE_DIR1_BLOCK:
927 case NODE_DIR2_BLOCK:
928 err = truncate_dnode(&dn);
931 case NODE_IND1_BLOCK:
932 case NODE_IND2_BLOCK:
933 err = truncate_nodes(&dn, nofs, offset[1], 2);
936 case NODE_DIND_BLOCK:
937 err = truncate_nodes(&dn, nofs, offset[1], 3);
944 if (err < 0 && err != -ENOENT)
946 if (offset[1] == 0 &&
947 ri->i_nid[offset[0] - NODE_DIR1_BLOCK]) {
949 BUG_ON(page->mapping != NODE_MAPPING(sbi));
950 f2fs_wait_on_page_writeback(page, NODE, true);
951 ri->i_nid[offset[0] - NODE_DIR1_BLOCK] = 0;
952 set_page_dirty(page);
960 f2fs_put_page(page, 0);
961 trace_f2fs_truncate_inode_blocks_exit(inode, err);
962 return err > 0 ? 0 : err;
965 /* caller must lock inode page */
966 int truncate_xattr_node(struct inode *inode)
968 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
969 nid_t nid = F2FS_I(inode)->i_xattr_nid;
970 struct dnode_of_data dn;
976 npage = get_node_page(sbi, nid);
978 return PTR_ERR(npage);
980 f2fs_i_xnid_write(inode, 0);
982 set_new_dnode(&dn, inode, NULL, npage, nid);
988 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
991 int remove_inode_page(struct inode *inode)
993 struct dnode_of_data dn;
996 set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino);
997 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
1001 err = truncate_xattr_node(inode);
1003 f2fs_put_dnode(&dn);
1007 /* remove potential inline_data blocks */
1008 if (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) ||
1009 S_ISLNK(inode->i_mode))
1010 truncate_data_blocks_range(&dn, 1);
1012 /* 0 is possible, after f2fs_new_inode() has failed */
1013 f2fs_bug_on(F2FS_I_SB(inode),
1014 inode->i_blocks != 0 && inode->i_blocks != 8);
1016 /* will put inode & node pages */
1021 struct page *new_inode_page(struct inode *inode)
1023 struct dnode_of_data dn;
1025 /* allocate inode page for new inode */
1026 set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino);
1028 /* caller should f2fs_put_page(page, 1); */
1029 return new_node_page(&dn, 0);
1032 struct page *new_node_page(struct dnode_of_data *dn, unsigned int ofs)
1034 struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
1035 struct node_info new_ni;
1039 if (unlikely(is_inode_flag_set(dn->inode, FI_NO_ALLOC)))
1040 return ERR_PTR(-EPERM);
1042 page = f2fs_grab_cache_page(NODE_MAPPING(sbi), dn->nid, false);
1044 return ERR_PTR(-ENOMEM);
1046 if (unlikely((err = inc_valid_node_count(sbi, dn->inode, !ofs))))
1049 #ifdef CONFIG_F2FS_CHECK_FS
1050 get_node_info(sbi, dn->nid, &new_ni);
1051 f2fs_bug_on(sbi, new_ni.blk_addr != NULL_ADDR);
1053 new_ni.nid = dn->nid;
1054 new_ni.ino = dn->inode->i_ino;
1055 new_ni.blk_addr = NULL_ADDR;
1058 set_node_addr(sbi, &new_ni, NEW_ADDR, false);
1060 f2fs_wait_on_page_writeback(page, NODE, true);
1061 fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true);
1062 set_cold_node(dn->inode, page);
1063 if (!PageUptodate(page))
1064 SetPageUptodate(page);
1065 if (set_page_dirty(page))
1066 dn->node_changed = true;
1068 if (f2fs_has_xattr_block(ofs))
1069 f2fs_i_xnid_write(dn->inode, dn->nid);
1072 inc_valid_inode_count(sbi);
1076 clear_node_page_dirty(page);
1077 f2fs_put_page(page, 1);
1078 return ERR_PTR(err);
1082 * Caller should do after getting the following values.
1083 * 0: f2fs_put_page(page, 0)
1084 * LOCKED_PAGE or error: f2fs_put_page(page, 1)
1086 static int read_node_page(struct page *page, int op_flags)
1088 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
1089 struct node_info ni;
1090 struct f2fs_io_info fio = {
1094 .op_flags = op_flags,
1096 .encrypted_page = NULL,
1099 if (PageUptodate(page))
1102 get_node_info(sbi, page->index, &ni);
1104 if (unlikely(ni.blk_addr == NULL_ADDR)) {
1105 ClearPageUptodate(page);
1109 fio.new_blkaddr = fio.old_blkaddr = ni.blk_addr;
1110 return f2fs_submit_page_bio(&fio);
1114 * Readahead a node page
1116 void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid)
1123 f2fs_bug_on(sbi, check_nid_range(sbi, nid));
1126 apage = radix_tree_lookup(&NODE_MAPPING(sbi)->page_tree, nid);
1131 apage = f2fs_grab_cache_page(NODE_MAPPING(sbi), nid, false);
1135 err = read_node_page(apage, REQ_RAHEAD);
1136 f2fs_put_page(apage, err ? 1 : 0);
1139 static struct page *__get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid,
1140 struct page *parent, int start)
1146 return ERR_PTR(-ENOENT);
1147 f2fs_bug_on(sbi, check_nid_range(sbi, nid));
1149 page = f2fs_grab_cache_page(NODE_MAPPING(sbi), nid, false);
1151 return ERR_PTR(-ENOMEM);
1153 err = read_node_page(page, 0);
1155 f2fs_put_page(page, 1);
1156 return ERR_PTR(err);
1157 } else if (err == LOCKED_PAGE) {
1163 ra_node_pages(parent, start + 1, MAX_RA_NODE);
1167 if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1168 f2fs_put_page(page, 1);
1172 if (unlikely(!PageUptodate(page))) {
1177 if (!f2fs_inode_chksum_verify(sbi, page)) {
1182 if(unlikely(nid != nid_of_node(page))) {
1183 f2fs_msg(sbi->sb, KERN_WARNING, "inconsistent node block, "
1184 "nid:%lu, node_footer[nid:%u,ino:%u,ofs:%u,cpver:%llu,blkaddr:%u]",
1185 nid, nid_of_node(page), ino_of_node(page),
1186 ofs_of_node(page), cpver_of_node(page),
1187 next_blkaddr_of_node(page));
1190 ClearPageUptodate(page);
1191 f2fs_put_page(page, 1);
1192 return ERR_PTR(err);
1197 struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid)
1199 return __get_node_page(sbi, nid, NULL, 0);
1202 struct page *get_node_page_ra(struct page *parent, int start)
1204 struct f2fs_sb_info *sbi = F2FS_P_SB(parent);
1205 nid_t nid = get_nid(parent, start, false);
1207 return __get_node_page(sbi, nid, parent, start);
1210 static void flush_inline_data(struct f2fs_sb_info *sbi, nid_t ino)
1212 struct inode *inode;
1216 /* should flush inline_data before evict_inode */
1217 inode = ilookup(sbi->sb, ino);
1221 page = f2fs_pagecache_get_page(inode->i_mapping, 0,
1222 FGP_LOCK|FGP_NOWAIT, 0);
1226 if (!PageUptodate(page))
1229 if (!PageDirty(page))
1232 if (!clear_page_dirty_for_io(page))
1235 ret = f2fs_write_inline_data(inode, page);
1236 inode_dec_dirty_pages(inode);
1237 remove_dirty_inode(inode);
1239 set_page_dirty(page);
1241 f2fs_put_page(page, 1);
1246 static struct page *last_fsync_dnode(struct f2fs_sb_info *sbi, nid_t ino)
1249 struct pagevec pvec;
1250 struct page *last_page = NULL;
1252 pagevec_init(&pvec, 0);
1256 while (index <= end) {
1258 nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
1259 PAGECACHE_TAG_DIRTY,
1260 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
1264 for (i = 0; i < nr_pages; i++) {
1265 struct page *page = pvec.pages[i];
1267 if (unlikely(f2fs_cp_error(sbi))) {
1268 f2fs_put_page(last_page, 0);
1269 pagevec_release(&pvec);
1270 return ERR_PTR(-EIO);
1273 if (!IS_DNODE(page) || !is_cold_node(page))
1275 if (ino_of_node(page) != ino)
1280 if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1285 if (ino_of_node(page) != ino)
1286 goto continue_unlock;
1288 if (!PageDirty(page)) {
1289 /* someone wrote it for us */
1290 goto continue_unlock;
1294 f2fs_put_page(last_page, 0);
1300 pagevec_release(&pvec);
1306 static int __write_node_page(struct page *page, bool atomic, bool *submitted,
1307 struct writeback_control *wbc, bool do_balance,
1308 enum iostat_type io_type)
1310 struct f2fs_sb_info *sbi = F2FS_P_SB(page);
1312 struct node_info ni;
1313 struct f2fs_io_info fio = {
1315 .ino = ino_of_node(page),
1318 .op_flags = wbc_to_write_flags(wbc),
1320 .encrypted_page = NULL,
1325 trace_f2fs_writepage(page, NODE);
1327 if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
1329 if (unlikely(f2fs_cp_error(sbi)))
1332 /* get old block addr of this node page */
1333 nid = nid_of_node(page);
1334 f2fs_bug_on(sbi, page->index != nid);
1336 if (wbc->for_reclaim) {
1337 if (!down_read_trylock(&sbi->node_write))
1340 down_read(&sbi->node_write);
1343 get_node_info(sbi, nid, &ni);
1345 /* This page is already truncated */
1346 if (unlikely(ni.blk_addr == NULL_ADDR)) {
1347 ClearPageUptodate(page);
1348 dec_page_count(sbi, F2FS_DIRTY_NODES);
1349 up_read(&sbi->node_write);
1354 if (atomic && !test_opt(sbi, NOBARRIER))
1355 fio.op_flags |= REQ_PREFLUSH | REQ_FUA;
1357 set_page_writeback(page);
1358 fio.old_blkaddr = ni.blk_addr;
1359 write_node_page(nid, &fio);
1360 set_node_addr(sbi, &ni, fio.new_blkaddr, is_fsync_dnode(page));
1361 dec_page_count(sbi, F2FS_DIRTY_NODES);
1362 up_read(&sbi->node_write);
1364 if (wbc->for_reclaim) {
1365 f2fs_submit_merged_write_cond(sbi, page->mapping->host, 0,
1372 if (unlikely(f2fs_cp_error(sbi))) {
1373 f2fs_submit_merged_write(sbi, NODE);
1377 *submitted = fio.submitted;
1380 f2fs_balance_fs(sbi, false);
1384 redirty_page_for_writepage(wbc, page);
1385 return AOP_WRITEPAGE_ACTIVATE;
1388 void move_node_page(struct page *node_page, int gc_type)
1390 if (gc_type == FG_GC) {
1391 struct writeback_control wbc = {
1392 .sync_mode = WB_SYNC_ALL,
1397 set_page_dirty(node_page);
1398 f2fs_wait_on_page_writeback(node_page, NODE, true);
1400 f2fs_bug_on(F2FS_P_SB(node_page), PageWriteback(node_page));
1401 if (!clear_page_dirty_for_io(node_page))
1404 if (__write_node_page(node_page, false, NULL,
1405 &wbc, false, FS_GC_NODE_IO))
1406 unlock_page(node_page);
1409 /* set page dirty and write it */
1410 if (!PageWriteback(node_page))
1411 set_page_dirty(node_page);
1414 unlock_page(node_page);
1416 f2fs_put_page(node_page, 0);
1419 static int f2fs_write_node_page(struct page *page,
1420 struct writeback_control *wbc)
1422 return __write_node_page(page, false, NULL, wbc, false, FS_NODE_IO);
1425 int fsync_node_pages(struct f2fs_sb_info *sbi, struct inode *inode,
1426 struct writeback_control *wbc, bool atomic)
1429 pgoff_t last_idx = ULONG_MAX;
1430 struct pagevec pvec;
1432 struct page *last_page = NULL;
1433 bool marked = false;
1434 nid_t ino = inode->i_ino;
1437 last_page = last_fsync_dnode(sbi, ino);
1438 if (IS_ERR_OR_NULL(last_page))
1439 return PTR_ERR_OR_ZERO(last_page);
1442 pagevec_init(&pvec, 0);
1446 while (index <= end) {
1448 nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
1449 PAGECACHE_TAG_DIRTY,
1450 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
1454 for (i = 0; i < nr_pages; i++) {
1455 struct page *page = pvec.pages[i];
1456 bool submitted = false;
1458 if (unlikely(f2fs_cp_error(sbi))) {
1459 f2fs_put_page(last_page, 0);
1460 pagevec_release(&pvec);
1465 if (!IS_DNODE(page) || !is_cold_node(page))
1467 if (ino_of_node(page) != ino)
1472 if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1477 if (ino_of_node(page) != ino)
1478 goto continue_unlock;
1480 if (!PageDirty(page) && page != last_page) {
1481 /* someone wrote it for us */
1482 goto continue_unlock;
1485 f2fs_wait_on_page_writeback(page, NODE, true);
1486 BUG_ON(PageWriteback(page));
1488 set_fsync_mark(page, 0);
1489 set_dentry_mark(page, 0);
1491 if (!atomic || page == last_page) {
1492 set_fsync_mark(page, 1);
1493 if (IS_INODE(page)) {
1494 if (is_inode_flag_set(inode,
1496 update_inode(inode, page);
1497 set_dentry_mark(page,
1498 need_dentry_mark(sbi, ino));
1500 /* may be written by other thread */
1501 if (!PageDirty(page))
1502 set_page_dirty(page);
1505 if (!clear_page_dirty_for_io(page))
1506 goto continue_unlock;
1508 ret = __write_node_page(page, atomic &&
1510 &submitted, wbc, true,
1514 f2fs_put_page(last_page, 0);
1516 } else if (submitted) {
1517 last_idx = page->index;
1520 if (page == last_page) {
1521 f2fs_put_page(page, 0);
1526 pagevec_release(&pvec);
1532 if (!ret && atomic && !marked) {
1533 f2fs_msg(sbi->sb, KERN_DEBUG,
1534 "Retry to write fsync mark: ino=%u, idx=%lx",
1535 ino, last_page->index);
1536 lock_page(last_page);
1537 f2fs_wait_on_page_writeback(last_page, NODE, true);
1538 set_page_dirty(last_page);
1539 unlock_page(last_page);
1543 if (last_idx != ULONG_MAX)
1544 f2fs_submit_merged_write_cond(sbi, NULL, ino, last_idx, NODE);
1545 return ret ? -EIO: 0;
1548 int sync_node_pages(struct f2fs_sb_info *sbi, struct writeback_control *wbc,
1549 bool do_balance, enum iostat_type io_type)
1552 struct pagevec pvec;
1557 pagevec_init(&pvec, 0);
1563 while (index <= end) {
1565 nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
1566 PAGECACHE_TAG_DIRTY,
1567 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
1571 for (i = 0; i < nr_pages; i++) {
1572 struct page *page = pvec.pages[i];
1573 bool submitted = false;
1575 if (unlikely(f2fs_cp_error(sbi))) {
1576 pagevec_release(&pvec);
1582 * flushing sequence with step:
1587 if (step == 0 && IS_DNODE(page))
1589 if (step == 1 && (!IS_DNODE(page) ||
1590 is_cold_node(page)))
1592 if (step == 2 && (!IS_DNODE(page) ||
1593 !is_cold_node(page)))
1596 if (!trylock_page(page))
1599 if (unlikely(page->mapping != NODE_MAPPING(sbi))) {
1605 if (!PageDirty(page)) {
1606 /* someone wrote it for us */
1607 goto continue_unlock;
1610 /* flush inline_data */
1611 if (is_inline_node(page)) {
1612 clear_inline_node(page);
1614 flush_inline_data(sbi, ino_of_node(page));
1618 f2fs_wait_on_page_writeback(page, NODE, true);
1620 BUG_ON(PageWriteback(page));
1621 if (!clear_page_dirty_for_io(page))
1622 goto continue_unlock;
1624 set_fsync_mark(page, 0);
1625 set_dentry_mark(page, 0);
1627 ret = __write_node_page(page, false, &submitted,
1628 wbc, do_balance, io_type);
1634 if (--wbc->nr_to_write == 0)
1637 pagevec_release(&pvec);
1640 if (wbc->nr_to_write == 0) {
1652 f2fs_submit_merged_write(sbi, NODE);
1656 int wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, nid_t ino)
1658 pgoff_t index = 0, end = ULONG_MAX;
1659 struct pagevec pvec;
1662 pagevec_init(&pvec, 0);
1664 while (index <= end) {
1666 nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index,
1667 PAGECACHE_TAG_WRITEBACK,
1668 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
1672 for (i = 0; i < nr_pages; i++) {
1673 struct page *page = pvec.pages[i];
1675 /* until radix tree lookup accepts end_index */
1676 if (unlikely(page->index > end))
1679 if (ino && ino_of_node(page) == ino) {
1680 f2fs_wait_on_page_writeback(page, NODE, true);
1681 if (TestClearPageError(page))
1685 pagevec_release(&pvec);
1689 ret2 = filemap_check_errors(NODE_MAPPING(sbi));
1695 static int f2fs_write_node_pages(struct address_space *mapping,
1696 struct writeback_control *wbc)
1698 struct f2fs_sb_info *sbi = F2FS_M_SB(mapping);
1699 struct blk_plug plug;
1702 if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
1705 /* balancing f2fs's metadata in background */
1706 f2fs_balance_fs_bg(sbi);
1708 /* collect a number of dirty node pages and write together */
1709 if (get_pages(sbi, F2FS_DIRTY_NODES) < nr_pages_to_skip(sbi, NODE))
1712 trace_f2fs_writepages(mapping->host, wbc, NODE);
1714 diff = nr_pages_to_write(sbi, NODE, wbc);
1715 wbc->sync_mode = WB_SYNC_NONE;
1716 blk_start_plug(&plug);
1717 sync_node_pages(sbi, wbc, true, FS_NODE_IO);
1718 blk_finish_plug(&plug);
1719 wbc->nr_to_write = max((long)0, wbc->nr_to_write - diff);
1723 wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_NODES);
1724 trace_f2fs_writepages(mapping->host, wbc, NODE);
1728 static int f2fs_set_node_page_dirty(struct page *page)
1730 trace_f2fs_set_page_dirty(page, NODE);
1732 if (!PageUptodate(page))
1733 SetPageUptodate(page);
1734 if (!PageDirty(page)) {
1735 f2fs_set_page_dirty_nobuffers(page);
1736 inc_page_count(F2FS_P_SB(page), F2FS_DIRTY_NODES);
1737 SetPagePrivate(page);
1738 f2fs_trace_pid(page);
1745 * Structure of the f2fs node operations
1747 const struct address_space_operations f2fs_node_aops = {
1748 .writepage = f2fs_write_node_page,
1749 .writepages = f2fs_write_node_pages,
1750 .set_page_dirty = f2fs_set_node_page_dirty,
1751 .invalidatepage = f2fs_invalidate_page,
1752 .releasepage = f2fs_release_page,
1753 #ifdef CONFIG_MIGRATION
1754 .migratepage = f2fs_migrate_page,
1758 static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i,
1761 return radix_tree_lookup(&nm_i->free_nid_root, n);
1764 static int __insert_free_nid(struct f2fs_sb_info *sbi,
1765 struct free_nid *i, enum nid_state state)
1767 struct f2fs_nm_info *nm_i = NM_I(sbi);
1769 int err = radix_tree_insert(&nm_i->free_nid_root, i->nid, i);
1773 f2fs_bug_on(sbi, state != i->state);
1774 nm_i->nid_cnt[state]++;
1775 if (state == FREE_NID)
1776 list_add_tail(&i->list, &nm_i->free_nid_list);
1780 static void __remove_free_nid(struct f2fs_sb_info *sbi,
1781 struct free_nid *i, enum nid_state state)
1783 struct f2fs_nm_info *nm_i = NM_I(sbi);
1785 f2fs_bug_on(sbi, state != i->state);
1786 nm_i->nid_cnt[state]--;
1787 if (state == FREE_NID)
1789 radix_tree_delete(&nm_i->free_nid_root, i->nid);
1792 static void __move_free_nid(struct f2fs_sb_info *sbi, struct free_nid *i,
1793 enum nid_state org_state, enum nid_state dst_state)
1795 struct f2fs_nm_info *nm_i = NM_I(sbi);
1797 f2fs_bug_on(sbi, org_state != i->state);
1798 i->state = dst_state;
1799 nm_i->nid_cnt[org_state]--;
1800 nm_i->nid_cnt[dst_state]++;
1802 switch (dst_state) {
1807 list_add_tail(&i->list, &nm_i->free_nid_list);
1814 /* return if the nid is recognized as free */
1815 static bool add_free_nid(struct f2fs_sb_info *sbi, nid_t nid, bool build)
1817 struct f2fs_nm_info *nm_i = NM_I(sbi);
1818 struct free_nid *i, *e;
1819 struct nat_entry *ne;
1823 /* 0 nid should not be used */
1824 if (unlikely(nid == 0))
1827 i = f2fs_kmem_cache_alloc(free_nid_slab, GFP_NOFS);
1829 i->state = FREE_NID;
1831 if (radix_tree_preload(GFP_NOFS))
1834 spin_lock(&nm_i->nid_list_lock);
1842 * - __insert_nid_to_list(PREALLOC_NID)
1843 * - f2fs_balance_fs_bg
1845 * - __build_free_nids
1848 * - __lookup_nat_cache
1850 * - init_inode_metadata
1855 * - __remove_nid_from_list(PREALLOC_NID)
1856 * - __insert_nid_to_list(FREE_NID)
1858 ne = __lookup_nat_cache(nm_i, nid);
1859 if (ne && (!get_nat_flag(ne, IS_CHECKPOINTED) ||
1860 nat_get_blkaddr(ne) != NULL_ADDR))
1863 e = __lookup_free_nid_list(nm_i, nid);
1865 if (e->state == FREE_NID)
1871 err = __insert_free_nid(sbi, i, FREE_NID);
1873 spin_unlock(&nm_i->nid_list_lock);
1874 radix_tree_preload_end();
1877 kmem_cache_free(free_nid_slab, i);
1881 static void remove_free_nid(struct f2fs_sb_info *sbi, nid_t nid)
1883 struct f2fs_nm_info *nm_i = NM_I(sbi);
1885 bool need_free = false;
1887 spin_lock(&nm_i->nid_list_lock);
1888 i = __lookup_free_nid_list(nm_i, nid);
1889 if (i && i->state == FREE_NID) {
1890 __remove_free_nid(sbi, i, FREE_NID);
1893 spin_unlock(&nm_i->nid_list_lock);
1896 kmem_cache_free(free_nid_slab, i);
1899 static void update_free_nid_bitmap(struct f2fs_sb_info *sbi, nid_t nid,
1900 bool set, bool build)
1902 struct f2fs_nm_info *nm_i = NM_I(sbi);
1903 unsigned int nat_ofs = NAT_BLOCK_OFFSET(nid);
1904 unsigned int nid_ofs = nid - START_NID(nid);
1906 if (!test_bit_le(nat_ofs, nm_i->nat_block_bitmap))
1910 __set_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]);
1912 __clear_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]);
1915 nm_i->free_nid_count[nat_ofs]++;
1917 nm_i->free_nid_count[nat_ofs]--;
1920 static void scan_nat_page(struct f2fs_sb_info *sbi,
1921 struct page *nat_page, nid_t start_nid)
1923 struct f2fs_nm_info *nm_i = NM_I(sbi);
1924 struct f2fs_nat_block *nat_blk = page_address(nat_page);
1926 unsigned int nat_ofs = NAT_BLOCK_OFFSET(start_nid);
1929 if (test_bit_le(nat_ofs, nm_i->nat_block_bitmap))
1932 __set_bit_le(nat_ofs, nm_i->nat_block_bitmap);
1934 i = start_nid % NAT_ENTRY_PER_BLOCK;
1936 for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) {
1939 if (unlikely(start_nid >= nm_i->max_nid))
1942 blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr);
1943 f2fs_bug_on(sbi, blk_addr == NEW_ADDR);
1944 if (blk_addr == NULL_ADDR)
1945 freed = add_free_nid(sbi, start_nid, true);
1946 spin_lock(&NM_I(sbi)->nid_list_lock);
1947 update_free_nid_bitmap(sbi, start_nid, freed, true);
1948 spin_unlock(&NM_I(sbi)->nid_list_lock);
1952 static void scan_curseg_cache(struct f2fs_sb_info *sbi)
1954 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
1955 struct f2fs_journal *journal = curseg->journal;
1958 down_read(&curseg->journal_rwsem);
1959 for (i = 0; i < nats_in_cursum(journal); i++) {
1963 addr = le32_to_cpu(nat_in_journal(journal, i).block_addr);
1964 nid = le32_to_cpu(nid_in_journal(journal, i));
1965 if (addr == NULL_ADDR)
1966 add_free_nid(sbi, nid, true);
1968 remove_free_nid(sbi, nid);
1970 up_read(&curseg->journal_rwsem);
1973 static void scan_free_nid_bits(struct f2fs_sb_info *sbi)
1975 struct f2fs_nm_info *nm_i = NM_I(sbi);
1976 unsigned int i, idx;
1979 down_read(&nm_i->nat_tree_lock);
1981 for (i = 0; i < nm_i->nat_blocks; i++) {
1982 if (!test_bit_le(i, nm_i->nat_block_bitmap))
1984 if (!nm_i->free_nid_count[i])
1986 for (idx = 0; idx < NAT_ENTRY_PER_BLOCK; idx++) {
1987 idx = find_next_bit_le(nm_i->free_nid_bitmap[i],
1988 NAT_ENTRY_PER_BLOCK, idx);
1989 if (idx >= NAT_ENTRY_PER_BLOCK)
1992 nid = i * NAT_ENTRY_PER_BLOCK + idx;
1993 add_free_nid(sbi, nid, true);
1995 if (nm_i->nid_cnt[FREE_NID] >= MAX_FREE_NIDS)
2000 scan_curseg_cache(sbi);
2002 up_read(&nm_i->nat_tree_lock);
2005 static void __build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount)
2007 struct f2fs_nm_info *nm_i = NM_I(sbi);
2009 nid_t nid = nm_i->next_scan_nid;
2011 if (unlikely(nid >= nm_i->max_nid))
2014 /* Enough entries */
2015 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK)
2018 if (!sync && !available_free_memory(sbi, FREE_NIDS))
2022 /* try to find free nids in free_nid_bitmap */
2023 scan_free_nid_bits(sbi);
2025 if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK)
2029 /* readahead nat pages to be scanned */
2030 ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), FREE_NID_PAGES,
2033 down_read(&nm_i->nat_tree_lock);
2036 struct page *page = get_current_nat_page(sbi, nid);
2038 scan_nat_page(sbi, page, nid);
2039 f2fs_put_page(page, 1);
2041 nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK));
2042 if (unlikely(nid >= nm_i->max_nid))
2045 if (++i >= FREE_NID_PAGES)
2049 /* go to the next free nat pages to find free nids abundantly */
2050 nm_i->next_scan_nid = nid;
2052 /* find free nids from current sum_pages */
2053 scan_curseg_cache(sbi);
2055 up_read(&nm_i->nat_tree_lock);
2057 ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nm_i->next_scan_nid),
2058 nm_i->ra_nid_pages, META_NAT, false);
2061 void build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount)
2063 mutex_lock(&NM_I(sbi)->build_lock);
2064 __build_free_nids(sbi, sync, mount);
2065 mutex_unlock(&NM_I(sbi)->build_lock);
2069 * If this function returns success, caller can obtain a new nid
2070 * from second parameter of this function.
2071 * The returned nid could be used ino as well as nid when inode is created.
2073 bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid)
2075 struct f2fs_nm_info *nm_i = NM_I(sbi);
2076 struct free_nid *i = NULL;
2078 #ifdef CONFIG_F2FS_FAULT_INJECTION
2079 if (time_to_inject(sbi, FAULT_ALLOC_NID)) {
2080 f2fs_show_injection_info(FAULT_ALLOC_NID);
2084 spin_lock(&nm_i->nid_list_lock);
2086 if (unlikely(nm_i->available_nids == 0)) {
2087 spin_unlock(&nm_i->nid_list_lock);
2091 /* We should not use stale free nids created by build_free_nids */
2092 if (nm_i->nid_cnt[FREE_NID] && !on_build_free_nids(nm_i)) {
2093 f2fs_bug_on(sbi, list_empty(&nm_i->free_nid_list));
2094 i = list_first_entry(&nm_i->free_nid_list,
2095 struct free_nid, list);
2098 __move_free_nid(sbi, i, FREE_NID, PREALLOC_NID);
2099 nm_i->available_nids--;
2101 update_free_nid_bitmap(sbi, *nid, false, false);
2103 spin_unlock(&nm_i->nid_list_lock);
2106 spin_unlock(&nm_i->nid_list_lock);
2108 /* Let's scan nat pages and its caches to get free nids */
2109 build_free_nids(sbi, true, false);
2114 * alloc_nid() should be called prior to this function.
2116 void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid)
2118 struct f2fs_nm_info *nm_i = NM_I(sbi);
2121 spin_lock(&nm_i->nid_list_lock);
2122 i = __lookup_free_nid_list(nm_i, nid);
2123 f2fs_bug_on(sbi, !i);
2124 __remove_free_nid(sbi, i, PREALLOC_NID);
2125 spin_unlock(&nm_i->nid_list_lock);
2127 kmem_cache_free(free_nid_slab, i);
2131 * alloc_nid() should be called prior to this function.
2133 void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid)
2135 struct f2fs_nm_info *nm_i = NM_I(sbi);
2137 bool need_free = false;
2142 spin_lock(&nm_i->nid_list_lock);
2143 i = __lookup_free_nid_list(nm_i, nid);
2144 f2fs_bug_on(sbi, !i);
2146 if (!available_free_memory(sbi, FREE_NIDS)) {
2147 __remove_free_nid(sbi, i, PREALLOC_NID);
2150 __move_free_nid(sbi, i, PREALLOC_NID, FREE_NID);
2153 nm_i->available_nids++;
2155 update_free_nid_bitmap(sbi, nid, true, false);
2157 spin_unlock(&nm_i->nid_list_lock);
2160 kmem_cache_free(free_nid_slab, i);
2163 int try_to_free_nids(struct f2fs_sb_info *sbi, int nr_shrink)
2165 struct f2fs_nm_info *nm_i = NM_I(sbi);
2166 struct free_nid *i, *next;
2169 if (nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS)
2172 if (!mutex_trylock(&nm_i->build_lock))
2175 spin_lock(&nm_i->nid_list_lock);
2176 list_for_each_entry_safe(i, next, &nm_i->free_nid_list, list) {
2177 if (nr_shrink <= 0 ||
2178 nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS)
2181 __remove_free_nid(sbi, i, FREE_NID);
2182 kmem_cache_free(free_nid_slab, i);
2185 spin_unlock(&nm_i->nid_list_lock);
2186 mutex_unlock(&nm_i->build_lock);
2188 return nr - nr_shrink;
2191 void recover_inline_xattr(struct inode *inode, struct page *page)
2193 void *src_addr, *dst_addr;
2196 struct f2fs_inode *ri;
2198 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
2199 f2fs_bug_on(F2FS_I_SB(inode), IS_ERR(ipage));
2201 ri = F2FS_INODE(page);
2202 if (!(ri->i_inline & F2FS_INLINE_XATTR)) {
2203 clear_inode_flag(inode, FI_INLINE_XATTR);
2207 dst_addr = inline_xattr_addr(inode, ipage);
2208 src_addr = inline_xattr_addr(inode, page);
2209 inline_size = inline_xattr_size(inode);
2211 f2fs_wait_on_page_writeback(ipage, NODE, true);
2212 memcpy(dst_addr, src_addr, inline_size);
2214 update_inode(inode, ipage);
2215 f2fs_put_page(ipage, 1);
2218 int recover_xattr_data(struct inode *inode, struct page *page, block_t blkaddr)
2220 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
2221 nid_t prev_xnid = F2FS_I(inode)->i_xattr_nid;
2223 struct dnode_of_data dn;
2224 struct node_info ni;
2230 /* 1: invalidate the previous xattr nid */
2231 get_node_info(sbi, prev_xnid, &ni);
2232 f2fs_bug_on(sbi, ni.blk_addr == NULL_ADDR);
2233 invalidate_blocks(sbi, ni.blk_addr);
2234 dec_valid_node_count(sbi, inode, false);
2235 set_node_addr(sbi, &ni, NULL_ADDR, false);
2238 /* 2: update xattr nid in inode */
2239 if (!alloc_nid(sbi, &new_xnid))
2242 set_new_dnode(&dn, inode, NULL, NULL, new_xnid);
2243 xpage = new_node_page(&dn, XATTR_NODE_OFFSET);
2244 if (IS_ERR(xpage)) {
2245 alloc_nid_failed(sbi, new_xnid);
2246 return PTR_ERR(xpage);
2249 alloc_nid_done(sbi, new_xnid);
2250 update_inode_page(inode);
2252 /* 3: update and set xattr node page dirty */
2253 memcpy(F2FS_NODE(xpage), F2FS_NODE(page), VALID_XATTR_BLOCK_SIZE);
2255 set_page_dirty(xpage);
2256 f2fs_put_page(xpage, 1);
2261 int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page)
2263 struct f2fs_inode *src, *dst;
2264 nid_t ino = ino_of_node(page);
2265 struct node_info old_ni, new_ni;
2268 get_node_info(sbi, ino, &old_ni);
2270 if (unlikely(old_ni.blk_addr != NULL_ADDR))
2273 ipage = f2fs_grab_cache_page(NODE_MAPPING(sbi), ino, false);
2275 congestion_wait(BLK_RW_ASYNC, HZ/50);
2279 /* Should not use this inode from free nid list */
2280 remove_free_nid(sbi, ino);
2282 if (!PageUptodate(ipage))
2283 SetPageUptodate(ipage);
2284 fill_node_footer(ipage, ino, ino, 0, true);
2286 src = F2FS_INODE(page);
2287 dst = F2FS_INODE(ipage);
2289 memcpy(dst, src, (unsigned long)&src->i_ext - (unsigned long)src);
2291 dst->i_blocks = cpu_to_le64(1);
2292 dst->i_links = cpu_to_le32(1);
2293 dst->i_xattr_nid = 0;
2294 dst->i_inline = src->i_inline & (F2FS_INLINE_XATTR | F2FS_EXTRA_ATTR);
2295 if (dst->i_inline & F2FS_EXTRA_ATTR) {
2296 dst->i_extra_isize = src->i_extra_isize;
2298 if (f2fs_sb_has_flexible_inline_xattr(sbi->sb) &&
2299 F2FS_FITS_IN_INODE(src, le16_to_cpu(src->i_extra_isize),
2300 i_inline_xattr_size))
2301 dst->i_inline_xattr_size = src->i_inline_xattr_size;
2303 if (f2fs_sb_has_project_quota(sbi->sb) &&
2304 F2FS_FITS_IN_INODE(src, le16_to_cpu(src->i_extra_isize),
2306 dst->i_projid = src->i_projid;
2312 if (unlikely(inc_valid_node_count(sbi, NULL, true)))
2314 set_node_addr(sbi, &new_ni, NEW_ADDR, false);
2315 inc_valid_inode_count(sbi);
2316 set_page_dirty(ipage);
2317 f2fs_put_page(ipage, 1);
2321 int restore_node_summary(struct f2fs_sb_info *sbi,
2322 unsigned int segno, struct f2fs_summary_block *sum)
2324 struct f2fs_node *rn;
2325 struct f2fs_summary *sum_entry;
2327 int i, idx, last_offset, nrpages;
2329 /* scan the node segment */
2330 last_offset = sbi->blocks_per_seg;
2331 addr = START_BLOCK(sbi, segno);
2332 sum_entry = &sum->entries[0];
2334 for (i = 0; i < last_offset; i += nrpages, addr += nrpages) {
2335 nrpages = min(last_offset - i, BIO_MAX_PAGES);
2337 /* readahead node pages */
2338 ra_meta_pages(sbi, addr, nrpages, META_POR, true);
2340 for (idx = addr; idx < addr + nrpages; idx++) {
2341 struct page *page = get_tmp_page(sbi, idx);
2343 rn = F2FS_NODE(page);
2344 sum_entry->nid = rn->footer.nid;
2345 sum_entry->version = 0;
2346 sum_entry->ofs_in_node = 0;
2348 f2fs_put_page(page, 1);
2351 invalidate_mapping_pages(META_MAPPING(sbi), addr,
2357 static void remove_nats_in_journal(struct f2fs_sb_info *sbi)
2359 struct f2fs_nm_info *nm_i = NM_I(sbi);
2360 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
2361 struct f2fs_journal *journal = curseg->journal;
2364 down_write(&curseg->journal_rwsem);
2365 for (i = 0; i < nats_in_cursum(journal); i++) {
2366 struct nat_entry *ne;
2367 struct f2fs_nat_entry raw_ne;
2368 nid_t nid = le32_to_cpu(nid_in_journal(journal, i));
2370 raw_ne = nat_in_journal(journal, i);
2372 ne = __lookup_nat_cache(nm_i, nid);
2374 ne = grab_nat_entry(nm_i, nid, true);
2375 node_info_from_raw_nat(&ne->ni, &raw_ne);
2379 * if a free nat in journal has not been used after last
2380 * checkpoint, we should remove it from available nids,
2381 * since later we will add it again.
2383 if (!get_nat_flag(ne, IS_DIRTY) &&
2384 le32_to_cpu(raw_ne.block_addr) == NULL_ADDR) {
2385 spin_lock(&nm_i->nid_list_lock);
2386 nm_i->available_nids--;
2387 spin_unlock(&nm_i->nid_list_lock);
2390 __set_nat_cache_dirty(nm_i, ne);
2392 update_nats_in_cursum(journal, -i);
2393 up_write(&curseg->journal_rwsem);
2396 static void __adjust_nat_entry_set(struct nat_entry_set *nes,
2397 struct list_head *head, int max)
2399 struct nat_entry_set *cur;
2401 if (nes->entry_cnt >= max)
2404 list_for_each_entry(cur, head, set_list) {
2405 if (cur->entry_cnt >= nes->entry_cnt) {
2406 list_add(&nes->set_list, cur->set_list.prev);
2411 list_add_tail(&nes->set_list, head);
2414 static void __update_nat_bits(struct f2fs_sb_info *sbi, nid_t start_nid,
2417 struct f2fs_nm_info *nm_i = NM_I(sbi);
2418 unsigned int nat_index = start_nid / NAT_ENTRY_PER_BLOCK;
2419 struct f2fs_nat_block *nat_blk = page_address(page);
2423 if (!enabled_nat_bits(sbi, NULL))
2426 if (nat_index == 0) {
2430 for (; i < NAT_ENTRY_PER_BLOCK; i++) {
2431 if (nat_blk->entries[i].block_addr != NULL_ADDR)
2435 __set_bit_le(nat_index, nm_i->empty_nat_bits);
2436 __clear_bit_le(nat_index, nm_i->full_nat_bits);
2440 __clear_bit_le(nat_index, nm_i->empty_nat_bits);
2441 if (valid == NAT_ENTRY_PER_BLOCK)
2442 __set_bit_le(nat_index, nm_i->full_nat_bits);
2444 __clear_bit_le(nat_index, nm_i->full_nat_bits);
2447 static void __flush_nat_entry_set(struct f2fs_sb_info *sbi,
2448 struct nat_entry_set *set, struct cp_control *cpc)
2450 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
2451 struct f2fs_journal *journal = curseg->journal;
2452 nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK;
2453 bool to_journal = true;
2454 struct f2fs_nat_block *nat_blk;
2455 struct nat_entry *ne, *cur;
2456 struct page *page = NULL;
2459 * there are two steps to flush nat entries:
2460 * #1, flush nat entries to journal in current hot data summary block.
2461 * #2, flush nat entries to nat page.
2463 if (enabled_nat_bits(sbi, cpc) ||
2464 !__has_cursum_space(journal, set->entry_cnt, NAT_JOURNAL))
2468 down_write(&curseg->journal_rwsem);
2470 page = get_next_nat_page(sbi, start_nid);
2471 nat_blk = page_address(page);
2472 f2fs_bug_on(sbi, !nat_blk);
2475 /* flush dirty nats in nat entry set */
2476 list_for_each_entry_safe(ne, cur, &set->entry_list, list) {
2477 struct f2fs_nat_entry *raw_ne;
2478 nid_t nid = nat_get_nid(ne);
2481 f2fs_bug_on(sbi, nat_get_blkaddr(ne) == NEW_ADDR);
2484 offset = lookup_journal_in_cursum(journal,
2485 NAT_JOURNAL, nid, 1);
2486 f2fs_bug_on(sbi, offset < 0);
2487 raw_ne = &nat_in_journal(journal, offset);
2488 nid_in_journal(journal, offset) = cpu_to_le32(nid);
2490 raw_ne = &nat_blk->entries[nid - start_nid];
2492 raw_nat_from_node_info(raw_ne, &ne->ni);
2494 __clear_nat_cache_dirty(NM_I(sbi), set, ne);
2495 if (nat_get_blkaddr(ne) == NULL_ADDR) {
2496 add_free_nid(sbi, nid, false);
2497 spin_lock(&NM_I(sbi)->nid_list_lock);
2498 NM_I(sbi)->available_nids++;
2499 update_free_nid_bitmap(sbi, nid, true, false);
2500 spin_unlock(&NM_I(sbi)->nid_list_lock);
2502 spin_lock(&NM_I(sbi)->nid_list_lock);
2503 update_free_nid_bitmap(sbi, nid, false, false);
2504 spin_unlock(&NM_I(sbi)->nid_list_lock);
2509 up_write(&curseg->journal_rwsem);
2511 __update_nat_bits(sbi, start_nid, page);
2512 f2fs_put_page(page, 1);
2515 /* Allow dirty nats by node block allocation in write_begin */
2516 if (!set->entry_cnt) {
2517 radix_tree_delete(&NM_I(sbi)->nat_set_root, set->set);
2518 kmem_cache_free(nat_entry_set_slab, set);
2523 * This function is called during the checkpointing process.
2525 void flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc)
2527 struct f2fs_nm_info *nm_i = NM_I(sbi);
2528 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
2529 struct f2fs_journal *journal = curseg->journal;
2530 struct nat_entry_set *setvec[SETVEC_SIZE];
2531 struct nat_entry_set *set, *tmp;
2536 if (!nm_i->dirty_nat_cnt)
2539 down_write(&nm_i->nat_tree_lock);
2542 * if there are no enough space in journal to store dirty nat
2543 * entries, remove all entries from journal and merge them
2544 * into nat entry set.
2546 if (enabled_nat_bits(sbi, cpc) ||
2547 !__has_cursum_space(journal, nm_i->dirty_nat_cnt, NAT_JOURNAL))
2548 remove_nats_in_journal(sbi);
2550 while ((found = __gang_lookup_nat_set(nm_i,
2551 set_idx, SETVEC_SIZE, setvec))) {
2553 set_idx = setvec[found - 1]->set + 1;
2554 for (idx = 0; idx < found; idx++)
2555 __adjust_nat_entry_set(setvec[idx], &sets,
2556 MAX_NAT_JENTRIES(journal));
2559 /* flush dirty nats in nat entry set */
2560 list_for_each_entry_safe(set, tmp, &sets, set_list)
2561 __flush_nat_entry_set(sbi, set, cpc);
2563 up_write(&nm_i->nat_tree_lock);
2564 /* Allow dirty nats by node block allocation in write_begin */
2567 static int __get_nat_bitmaps(struct f2fs_sb_info *sbi)
2569 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
2570 struct f2fs_nm_info *nm_i = NM_I(sbi);
2571 unsigned int nat_bits_bytes = nm_i->nat_blocks / BITS_PER_BYTE;
2573 __u64 cp_ver = cur_cp_version(ckpt);
2574 block_t nat_bits_addr;
2576 if (!enabled_nat_bits(sbi, NULL))
2579 nm_i->nat_bits_blocks = F2FS_BYTES_TO_BLK((nat_bits_bytes << 1) + 8 +
2581 nm_i->nat_bits = kzalloc(nm_i->nat_bits_blocks << F2FS_BLKSIZE_BITS,
2583 if (!nm_i->nat_bits)
2586 nat_bits_addr = __start_cp_addr(sbi) + sbi->blocks_per_seg -
2587 nm_i->nat_bits_blocks;
2588 for (i = 0; i < nm_i->nat_bits_blocks; i++) {
2589 struct page *page = get_meta_page(sbi, nat_bits_addr++);
2591 memcpy(nm_i->nat_bits + (i << F2FS_BLKSIZE_BITS),
2592 page_address(page), F2FS_BLKSIZE);
2593 f2fs_put_page(page, 1);
2596 cp_ver |= (cur_cp_crc(ckpt) << 32);
2597 if (cpu_to_le64(cp_ver) != *(__le64 *)nm_i->nat_bits) {
2598 disable_nat_bits(sbi, true);
2602 nm_i->full_nat_bits = nm_i->nat_bits + 8;
2603 nm_i->empty_nat_bits = nm_i->full_nat_bits + nat_bits_bytes;
2605 f2fs_msg(sbi->sb, KERN_NOTICE, "Found nat_bits in checkpoint");
2609 static inline void load_free_nid_bitmap(struct f2fs_sb_info *sbi)
2611 struct f2fs_nm_info *nm_i = NM_I(sbi);
2613 nid_t nid, last_nid;
2615 if (!enabled_nat_bits(sbi, NULL))
2618 for (i = 0; i < nm_i->nat_blocks; i++) {
2619 i = find_next_bit_le(nm_i->empty_nat_bits, nm_i->nat_blocks, i);
2620 if (i >= nm_i->nat_blocks)
2623 __set_bit_le(i, nm_i->nat_block_bitmap);
2625 nid = i * NAT_ENTRY_PER_BLOCK;
2626 last_nid = nid + NAT_ENTRY_PER_BLOCK;
2628 spin_lock(&NM_I(sbi)->nid_list_lock);
2629 for (; nid < last_nid; nid++)
2630 update_free_nid_bitmap(sbi, nid, true, true);
2631 spin_unlock(&NM_I(sbi)->nid_list_lock);
2634 for (i = 0; i < nm_i->nat_blocks; i++) {
2635 i = find_next_bit_le(nm_i->full_nat_bits, nm_i->nat_blocks, i);
2636 if (i >= nm_i->nat_blocks)
2639 __set_bit_le(i, nm_i->nat_block_bitmap);
2643 static int init_node_manager(struct f2fs_sb_info *sbi)
2645 struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi);
2646 struct f2fs_nm_info *nm_i = NM_I(sbi);
2647 unsigned char *version_bitmap;
2648 unsigned int nat_segs;
2651 nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr);
2653 /* segment_count_nat includes pair segment so divide to 2. */
2654 nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1;
2655 nm_i->nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg);
2656 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks;
2658 /* not used nids: 0, node, meta, (and root counted as valid node) */
2659 nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count -
2660 F2FS_RESERVED_NODE_NUM;
2661 nm_i->nid_cnt[FREE_NID] = 0;
2662 nm_i->nid_cnt[PREALLOC_NID] = 0;
2664 nm_i->ram_thresh = DEF_RAM_THRESHOLD;
2665 nm_i->ra_nid_pages = DEF_RA_NID_PAGES;
2666 nm_i->dirty_nats_ratio = DEF_DIRTY_NAT_RATIO_THRESHOLD;
2668 INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC);
2669 INIT_LIST_HEAD(&nm_i->free_nid_list);
2670 INIT_RADIX_TREE(&nm_i->nat_root, GFP_NOIO);
2671 INIT_RADIX_TREE(&nm_i->nat_set_root, GFP_NOIO);
2672 INIT_LIST_HEAD(&nm_i->nat_entries);
2674 mutex_init(&nm_i->build_lock);
2675 spin_lock_init(&nm_i->nid_list_lock);
2676 init_rwsem(&nm_i->nat_tree_lock);
2678 nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid);
2679 nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP);
2680 version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP);
2681 if (!version_bitmap)
2684 nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size,
2686 if (!nm_i->nat_bitmap)
2689 err = __get_nat_bitmaps(sbi);
2693 #ifdef CONFIG_F2FS_CHECK_FS
2694 nm_i->nat_bitmap_mir = kmemdup(version_bitmap, nm_i->bitmap_size,
2696 if (!nm_i->nat_bitmap_mir)
2703 static int init_free_nid_cache(struct f2fs_sb_info *sbi)
2705 struct f2fs_nm_info *nm_i = NM_I(sbi);
2707 nm_i->free_nid_bitmap = kvzalloc(nm_i->nat_blocks *
2708 NAT_ENTRY_BITMAP_SIZE, GFP_KERNEL);
2709 if (!nm_i->free_nid_bitmap)
2712 nm_i->nat_block_bitmap = kvzalloc(nm_i->nat_blocks / 8,
2714 if (!nm_i->nat_block_bitmap)
2717 nm_i->free_nid_count = kvzalloc(nm_i->nat_blocks *
2718 sizeof(unsigned short), GFP_KERNEL);
2719 if (!nm_i->free_nid_count)
2724 int build_node_manager(struct f2fs_sb_info *sbi)
2728 sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL);
2732 err = init_node_manager(sbi);
2736 err = init_free_nid_cache(sbi);
2740 /* load free nid status from nat_bits table */
2741 load_free_nid_bitmap(sbi);
2743 build_free_nids(sbi, true, true);
2747 void destroy_node_manager(struct f2fs_sb_info *sbi)
2749 struct f2fs_nm_info *nm_i = NM_I(sbi);
2750 struct free_nid *i, *next_i;
2751 struct nat_entry *natvec[NATVEC_SIZE];
2752 struct nat_entry_set *setvec[SETVEC_SIZE];
2759 /* destroy free nid list */
2760 spin_lock(&nm_i->nid_list_lock);
2761 list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) {
2762 __remove_free_nid(sbi, i, FREE_NID);
2763 spin_unlock(&nm_i->nid_list_lock);
2764 kmem_cache_free(free_nid_slab, i);
2765 spin_lock(&nm_i->nid_list_lock);
2767 f2fs_bug_on(sbi, nm_i->nid_cnt[FREE_NID]);
2768 f2fs_bug_on(sbi, nm_i->nid_cnt[PREALLOC_NID]);
2769 f2fs_bug_on(sbi, !list_empty(&nm_i->free_nid_list));
2770 spin_unlock(&nm_i->nid_list_lock);
2772 /* destroy nat cache */
2773 down_write(&nm_i->nat_tree_lock);
2774 while ((found = __gang_lookup_nat_cache(nm_i,
2775 nid, NATVEC_SIZE, natvec))) {
2778 nid = nat_get_nid(natvec[found - 1]) + 1;
2779 for (idx = 0; idx < found; idx++)
2780 __del_from_nat_cache(nm_i, natvec[idx]);
2782 f2fs_bug_on(sbi, nm_i->nat_cnt);
2784 /* destroy nat set cache */
2786 while ((found = __gang_lookup_nat_set(nm_i,
2787 nid, SETVEC_SIZE, setvec))) {
2790 nid = setvec[found - 1]->set + 1;
2791 for (idx = 0; idx < found; idx++) {
2792 /* entry_cnt is not zero, when cp_error was occurred */
2793 f2fs_bug_on(sbi, !list_empty(&setvec[idx]->entry_list));
2794 radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set);
2795 kmem_cache_free(nat_entry_set_slab, setvec[idx]);
2798 up_write(&nm_i->nat_tree_lock);
2800 kvfree(nm_i->nat_block_bitmap);
2801 kvfree(nm_i->free_nid_bitmap);
2802 kvfree(nm_i->free_nid_count);
2804 kfree(nm_i->nat_bitmap);
2805 kfree(nm_i->nat_bits);
2806 #ifdef CONFIG_F2FS_CHECK_FS
2807 kfree(nm_i->nat_bitmap_mir);
2809 sbi->nm_info = NULL;
2813 int __init create_node_manager_caches(void)
2815 nat_entry_slab = f2fs_kmem_cache_create("nat_entry",
2816 sizeof(struct nat_entry));
2817 if (!nat_entry_slab)
2820 free_nid_slab = f2fs_kmem_cache_create("free_nid",
2821 sizeof(struct free_nid));
2823 goto destroy_nat_entry;
2825 nat_entry_set_slab = f2fs_kmem_cache_create("nat_entry_set",
2826 sizeof(struct nat_entry_set));
2827 if (!nat_entry_set_slab)
2828 goto destroy_free_nid;
2832 kmem_cache_destroy(free_nid_slab);
2834 kmem_cache_destroy(nat_entry_slab);
2839 void destroy_node_manager_caches(void)
2841 kmem_cache_destroy(nat_entry_set_slab);
2842 kmem_cache_destroy(free_nid_slab);
2843 kmem_cache_destroy(nat_entry_slab);