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>
23 static struct kmem_cache *nat_entry_slab;
24 static struct kmem_cache *free_nid_slab;
26 static void clear_node_page_dirty(struct page *page)
28 struct address_space *mapping = page->mapping;
29 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
30 unsigned int long flags;
32 if (PageDirty(page)) {
33 spin_lock_irqsave(&mapping->tree_lock, flags);
34 radix_tree_tag_clear(&mapping->page_tree,
37 spin_unlock_irqrestore(&mapping->tree_lock, flags);
39 clear_page_dirty_for_io(page);
40 dec_page_count(sbi, F2FS_DIRTY_NODES);
42 ClearPageUptodate(page);
45 static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
47 pgoff_t index = current_nat_addr(sbi, nid);
48 return get_meta_page(sbi, index);
51 static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid)
53 struct page *src_page;
54 struct page *dst_page;
59 struct f2fs_nm_info *nm_i = NM_I(sbi);
61 src_off = current_nat_addr(sbi, nid);
62 dst_off = next_nat_addr(sbi, src_off);
64 /* get current nat block page with lock */
65 src_page = get_meta_page(sbi, src_off);
67 /* Dirty src_page means that it is already the new target NAT page. */
68 if (PageDirty(src_page))
71 dst_page = grab_meta_page(sbi, dst_off);
73 src_addr = page_address(src_page);
74 dst_addr = page_address(dst_page);
75 memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE);
76 set_page_dirty(dst_page);
77 f2fs_put_page(src_page, 1);
79 set_to_next_nat(nm_i, nid);
87 static void ra_nat_pages(struct f2fs_sb_info *sbi, int nid)
89 struct address_space *mapping = sbi->meta_inode->i_mapping;
90 struct f2fs_nm_info *nm_i = NM_I(sbi);
95 for (i = 0; i < FREE_NID_PAGES; i++, nid += NAT_ENTRY_PER_BLOCK) {
96 if (nid >= nm_i->max_nid)
98 index = current_nat_addr(sbi, nid);
100 page = grab_cache_page(mapping, index);
103 if (f2fs_readpage(sbi, page, index, READ)) {
104 f2fs_put_page(page, 1);
107 f2fs_put_page(page, 0);
111 static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n)
113 return radix_tree_lookup(&nm_i->nat_root, n);
116 static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i,
117 nid_t start, unsigned int nr, struct nat_entry **ep)
119 return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr);
122 static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e)
125 radix_tree_delete(&nm_i->nat_root, nat_get_nid(e));
127 kmem_cache_free(nat_entry_slab, e);
130 int is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid)
132 struct f2fs_nm_info *nm_i = NM_I(sbi);
136 read_lock(&nm_i->nat_tree_lock);
137 e = __lookup_nat_cache(nm_i, nid);
138 if (e && !e->checkpointed)
140 read_unlock(&nm_i->nat_tree_lock);
144 static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid)
146 struct nat_entry *new;
148 new = kmem_cache_alloc(nat_entry_slab, GFP_ATOMIC);
151 if (radix_tree_insert(&nm_i->nat_root, nid, new)) {
152 kmem_cache_free(nat_entry_slab, new);
155 memset(new, 0, sizeof(struct nat_entry));
156 nat_set_nid(new, nid);
157 list_add_tail(&new->list, &nm_i->nat_entries);
162 static void cache_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid,
163 struct f2fs_nat_entry *ne)
167 write_lock(&nm_i->nat_tree_lock);
168 e = __lookup_nat_cache(nm_i, nid);
170 e = grab_nat_entry(nm_i, nid);
172 write_unlock(&nm_i->nat_tree_lock);
175 nat_set_blkaddr(e, le32_to_cpu(ne->block_addr));
176 nat_set_ino(e, le32_to_cpu(ne->ino));
177 nat_set_version(e, ne->version);
178 e->checkpointed = true;
180 write_unlock(&nm_i->nat_tree_lock);
183 static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni,
186 struct f2fs_nm_info *nm_i = NM_I(sbi);
189 write_lock(&nm_i->nat_tree_lock);
190 e = __lookup_nat_cache(nm_i, ni->nid);
192 e = grab_nat_entry(nm_i, ni->nid);
194 write_unlock(&nm_i->nat_tree_lock);
198 e->checkpointed = true;
199 BUG_ON(ni->blk_addr == NEW_ADDR);
200 } else if (new_blkaddr == NEW_ADDR) {
202 * when nid is reallocated,
203 * previous nat entry can be remained in nat cache.
204 * So, reinitialize it with new information.
207 BUG_ON(ni->blk_addr != NULL_ADDR);
210 if (new_blkaddr == NEW_ADDR)
211 e->checkpointed = false;
214 BUG_ON(nat_get_blkaddr(e) != ni->blk_addr);
215 BUG_ON(nat_get_blkaddr(e) == NULL_ADDR &&
216 new_blkaddr == NULL_ADDR);
217 BUG_ON(nat_get_blkaddr(e) == NEW_ADDR &&
218 new_blkaddr == NEW_ADDR);
219 BUG_ON(nat_get_blkaddr(e) != NEW_ADDR &&
220 nat_get_blkaddr(e) != NULL_ADDR &&
221 new_blkaddr == NEW_ADDR);
223 /* increament version no as node is removed */
224 if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) {
225 unsigned char version = nat_get_version(e);
226 nat_set_version(e, inc_node_version(version));
230 nat_set_blkaddr(e, new_blkaddr);
231 __set_nat_cache_dirty(nm_i, e);
232 write_unlock(&nm_i->nat_tree_lock);
235 static int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink)
237 struct f2fs_nm_info *nm_i = NM_I(sbi);
239 if (nm_i->nat_cnt < 2 * NM_WOUT_THRESHOLD)
242 write_lock(&nm_i->nat_tree_lock);
243 while (nr_shrink && !list_empty(&nm_i->nat_entries)) {
244 struct nat_entry *ne;
245 ne = list_first_entry(&nm_i->nat_entries,
246 struct nat_entry, list);
247 __del_from_nat_cache(nm_i, ne);
250 write_unlock(&nm_i->nat_tree_lock);
255 * This function returns always success
257 void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni)
259 struct f2fs_nm_info *nm_i = NM_I(sbi);
260 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
261 struct f2fs_summary_block *sum = curseg->sum_blk;
262 nid_t start_nid = START_NID(nid);
263 struct f2fs_nat_block *nat_blk;
264 struct page *page = NULL;
265 struct f2fs_nat_entry ne;
269 memset(&ne, 0, sizeof(struct f2fs_nat_entry));
272 /* Check nat cache */
273 read_lock(&nm_i->nat_tree_lock);
274 e = __lookup_nat_cache(nm_i, nid);
276 ni->ino = nat_get_ino(e);
277 ni->blk_addr = nat_get_blkaddr(e);
278 ni->version = nat_get_version(e);
280 read_unlock(&nm_i->nat_tree_lock);
284 /* Check current segment summary */
285 mutex_lock(&curseg->curseg_mutex);
286 i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0);
288 ne = nat_in_journal(sum, i);
289 node_info_from_raw_nat(ni, &ne);
291 mutex_unlock(&curseg->curseg_mutex);
295 /* Fill node_info from nat page */
296 page = get_current_nat_page(sbi, start_nid);
297 nat_blk = (struct f2fs_nat_block *)page_address(page);
298 ne = nat_blk->entries[nid - start_nid];
299 node_info_from_raw_nat(ni, &ne);
300 f2fs_put_page(page, 1);
302 /* cache nat entry */
303 cache_nat_entry(NM_I(sbi), nid, &ne);
307 * The maximum depth is four.
308 * Offset[0] will have raw inode offset.
310 static int get_node_path(long block, int offset[4], unsigned int noffset[4])
312 const long direct_index = ADDRS_PER_INODE;
313 const long direct_blks = ADDRS_PER_BLOCK;
314 const long dptrs_per_blk = NIDS_PER_BLOCK;
315 const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK;
316 const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK;
322 if (block < direct_index) {
327 block -= direct_index;
328 if (block < direct_blks) {
329 offset[n++] = NODE_DIR1_BLOCK;
335 block -= direct_blks;
336 if (block < direct_blks) {
337 offset[n++] = NODE_DIR2_BLOCK;
343 block -= direct_blks;
344 if (block < indirect_blks) {
345 offset[n++] = NODE_IND1_BLOCK;
347 offset[n++] = block / direct_blks;
348 noffset[n] = 4 + offset[n - 1];
349 offset[n++] = block % direct_blks;
353 block -= indirect_blks;
354 if (block < indirect_blks) {
355 offset[n++] = NODE_IND2_BLOCK;
356 noffset[n] = 4 + dptrs_per_blk;
357 offset[n++] = block / direct_blks;
358 noffset[n] = 5 + dptrs_per_blk + offset[n - 1];
359 offset[n++] = block % direct_blks;
363 block -= indirect_blks;
364 if (block < dindirect_blks) {
365 offset[n++] = NODE_DIND_BLOCK;
366 noffset[n] = 5 + (dptrs_per_blk * 2);
367 offset[n++] = block / indirect_blks;
368 noffset[n] = 6 + (dptrs_per_blk * 2) +
369 offset[n - 1] * (dptrs_per_blk + 1);
370 offset[n++] = (block / direct_blks) % dptrs_per_blk;
371 noffset[n] = 7 + (dptrs_per_blk * 2) +
372 offset[n - 2] * (dptrs_per_blk + 1) +
374 offset[n++] = block % direct_blks;
385 * Caller should call f2fs_put_dnode(dn).
387 int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode)
389 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
390 struct page *npage[4];
393 unsigned int noffset[4];
398 level = get_node_path(index, offset, noffset);
400 nids[0] = dn->inode->i_ino;
401 npage[0] = get_node_page(sbi, nids[0]);
402 if (IS_ERR(npage[0]))
403 return PTR_ERR(npage[0]);
407 nids[1] = get_nid(parent, offset[0], true);
408 dn->inode_page = npage[0];
409 dn->inode_page_locked = true;
411 /* get indirect or direct nodes */
412 for (i = 1; i <= level; i++) {
415 if (!nids[i] && mode == ALLOC_NODE) {
416 mutex_lock_op(sbi, NODE_NEW);
419 if (!alloc_nid(sbi, &(nids[i]))) {
420 mutex_unlock_op(sbi, NODE_NEW);
426 npage[i] = new_node_page(dn, noffset[i]);
427 if (IS_ERR(npage[i])) {
428 alloc_nid_failed(sbi, nids[i]);
429 mutex_unlock_op(sbi, NODE_NEW);
430 err = PTR_ERR(npage[i]);
434 set_nid(parent, offset[i - 1], nids[i], i == 1);
435 alloc_nid_done(sbi, nids[i]);
436 mutex_unlock_op(sbi, NODE_NEW);
438 } else if (mode == LOOKUP_NODE_RA && i == level && level > 1) {
439 npage[i] = get_node_page_ra(parent, offset[i - 1]);
440 if (IS_ERR(npage[i])) {
441 err = PTR_ERR(npage[i]);
447 dn->inode_page_locked = false;
450 f2fs_put_page(parent, 1);
454 npage[i] = get_node_page(sbi, nids[i]);
455 if (IS_ERR(npage[i])) {
456 err = PTR_ERR(npage[i]);
457 f2fs_put_page(npage[0], 0);
463 nids[i + 1] = get_nid(parent, offset[i], false);
466 dn->nid = nids[level];
467 dn->ofs_in_node = offset[level];
468 dn->node_page = npage[level];
469 dn->data_blkaddr = datablock_addr(dn->node_page, dn->ofs_in_node);
473 f2fs_put_page(parent, 1);
475 f2fs_put_page(npage[0], 0);
477 dn->inode_page = NULL;
478 dn->node_page = NULL;
482 static void truncate_node(struct dnode_of_data *dn)
484 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
487 get_node_info(sbi, dn->nid, &ni);
488 if (dn->inode->i_blocks == 0) {
489 BUG_ON(ni.blk_addr != NULL_ADDR);
492 BUG_ON(ni.blk_addr == NULL_ADDR);
494 /* Deallocate node address */
495 invalidate_blocks(sbi, ni.blk_addr);
496 dec_valid_node_count(sbi, dn->inode, 1);
497 set_node_addr(sbi, &ni, NULL_ADDR);
499 if (dn->nid == dn->inode->i_ino) {
500 remove_orphan_inode(sbi, dn->nid);
501 dec_valid_inode_count(sbi);
506 clear_node_page_dirty(dn->node_page);
507 F2FS_SET_SB_DIRT(sbi);
509 f2fs_put_page(dn->node_page, 1);
510 dn->node_page = NULL;
513 static int truncate_dnode(struct dnode_of_data *dn)
515 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
521 /* get direct node */
522 page = get_node_page(sbi, dn->nid);
523 if (IS_ERR(page) && PTR_ERR(page) == -ENOENT)
525 else if (IS_ERR(page))
526 return PTR_ERR(page);
528 /* Make dnode_of_data for parameter */
529 dn->node_page = page;
531 truncate_data_blocks(dn);
536 static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs,
539 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
540 struct dnode_of_data rdn = *dn;
542 struct f2fs_node *rn;
544 unsigned int child_nofs;
549 return NIDS_PER_BLOCK + 1;
551 page = get_node_page(sbi, dn->nid);
553 return PTR_ERR(page);
555 rn = (struct f2fs_node *)page_address(page);
557 for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) {
558 child_nid = le32_to_cpu(rn->in.nid[i]);
562 ret = truncate_dnode(&rdn);
565 set_nid(page, i, 0, false);
568 child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1;
569 for (i = ofs; i < NIDS_PER_BLOCK; i++) {
570 child_nid = le32_to_cpu(rn->in.nid[i]);
571 if (child_nid == 0) {
572 child_nofs += NIDS_PER_BLOCK + 1;
576 ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1);
577 if (ret == (NIDS_PER_BLOCK + 1)) {
578 set_nid(page, i, 0, false);
580 } else if (ret < 0 && ret != -ENOENT) {
588 /* remove current indirect node */
589 dn->node_page = page;
593 f2fs_put_page(page, 1);
598 f2fs_put_page(page, 1);
602 static int truncate_partial_nodes(struct dnode_of_data *dn,
603 struct f2fs_inode *ri, int *offset, int depth)
605 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
606 struct page *pages[2];
613 nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]);
617 /* get indirect nodes in the path */
618 for (i = 0; i < depth - 1; i++) {
619 /* refernece count'll be increased */
620 pages[i] = get_node_page(sbi, nid[i]);
621 if (IS_ERR(pages[i])) {
623 err = PTR_ERR(pages[i]);
626 nid[i + 1] = get_nid(pages[i], offset[i + 1], false);
629 /* free direct nodes linked to a partial indirect node */
630 for (i = offset[depth - 1]; i < NIDS_PER_BLOCK; i++) {
631 child_nid = get_nid(pages[idx], i, false);
635 err = truncate_dnode(dn);
638 set_nid(pages[idx], i, 0, false);
641 if (offset[depth - 1] == 0) {
642 dn->node_page = pages[idx];
646 f2fs_put_page(pages[idx], 1);
649 offset[depth - 1] = 0;
651 for (i = depth - 3; i >= 0; i--)
652 f2fs_put_page(pages[i], 1);
657 * All the block addresses of data and nodes should be nullified.
659 int truncate_inode_blocks(struct inode *inode, pgoff_t from)
661 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
662 int err = 0, cont = 1;
663 int level, offset[4], noffset[4];
664 unsigned int nofs = 0;
665 struct f2fs_node *rn;
666 struct dnode_of_data dn;
669 level = get_node_path(from, offset, noffset);
671 page = get_node_page(sbi, inode->i_ino);
673 return PTR_ERR(page);
675 set_new_dnode(&dn, inode, page, NULL, 0);
678 rn = page_address(page);
686 if (!offset[level - 1])
688 err = truncate_partial_nodes(&dn, &rn->i, offset, level);
689 if (err < 0 && err != -ENOENT)
691 nofs += 1 + NIDS_PER_BLOCK;
694 nofs = 5 + 2 * NIDS_PER_BLOCK;
695 if (!offset[level - 1])
697 err = truncate_partial_nodes(&dn, &rn->i, offset, level);
698 if (err < 0 && err != -ENOENT)
707 dn.nid = le32_to_cpu(rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]);
709 case NODE_DIR1_BLOCK:
710 case NODE_DIR2_BLOCK:
711 err = truncate_dnode(&dn);
714 case NODE_IND1_BLOCK:
715 case NODE_IND2_BLOCK:
716 err = truncate_nodes(&dn, nofs, offset[1], 2);
719 case NODE_DIND_BLOCK:
720 err = truncate_nodes(&dn, nofs, offset[1], 3);
727 if (err < 0 && err != -ENOENT)
729 if (offset[1] == 0 &&
730 rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK]) {
732 wait_on_page_writeback(page);
733 rn->i.i_nid[offset[0] - NODE_DIR1_BLOCK] = 0;
734 set_page_dirty(page);
742 f2fs_put_page(page, 0);
743 return err > 0 ? 0 : err;
746 int remove_inode_page(struct inode *inode)
748 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
750 nid_t ino = inode->i_ino;
751 struct dnode_of_data dn;
753 mutex_lock_op(sbi, NODE_TRUNC);
754 page = get_node_page(sbi, ino);
756 mutex_unlock_op(sbi, NODE_TRUNC);
757 return PTR_ERR(page);
760 if (F2FS_I(inode)->i_xattr_nid) {
761 nid_t nid = F2FS_I(inode)->i_xattr_nid;
762 struct page *npage = get_node_page(sbi, nid);
765 mutex_unlock_op(sbi, NODE_TRUNC);
766 return PTR_ERR(npage);
769 F2FS_I(inode)->i_xattr_nid = 0;
770 set_new_dnode(&dn, inode, page, npage, nid);
771 dn.inode_page_locked = 1;
775 /* 0 is possible, after f2fs_new_inode() is failed */
776 BUG_ON(inode->i_blocks != 0 && inode->i_blocks != 1);
777 set_new_dnode(&dn, inode, page, page, ino);
780 mutex_unlock_op(sbi, NODE_TRUNC);
784 int new_inode_page(struct inode *inode, const struct qstr *name)
786 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
788 struct dnode_of_data dn;
790 /* allocate inode page for new inode */
791 set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino);
792 mutex_lock_op(sbi, NODE_NEW);
793 page = new_node_page(&dn, 0);
794 init_dent_inode(name, page);
795 mutex_unlock_op(sbi, NODE_NEW);
797 return PTR_ERR(page);
798 f2fs_put_page(page, 1);
802 struct page *new_node_page(struct dnode_of_data *dn, unsigned int ofs)
804 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
805 struct address_space *mapping = sbi->node_inode->i_mapping;
806 struct node_info old_ni, new_ni;
810 if (is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC))
811 return ERR_PTR(-EPERM);
813 page = grab_cache_page(mapping, dn->nid);
815 return ERR_PTR(-ENOMEM);
817 get_node_info(sbi, dn->nid, &old_ni);
819 SetPageUptodate(page);
820 fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true);
822 /* Reinitialize old_ni with new node page */
823 BUG_ON(old_ni.blk_addr != NULL_ADDR);
825 new_ni.ino = dn->inode->i_ino;
827 if (!inc_valid_node_count(sbi, dn->inode, 1)) {
831 set_node_addr(sbi, &new_ni, NEW_ADDR);
832 set_cold_node(dn->inode, page);
834 dn->node_page = page;
836 set_page_dirty(page);
838 inc_valid_inode_count(sbi);
843 clear_node_page_dirty(page);
844 f2fs_put_page(page, 1);
848 static int read_node_page(struct page *page, int type)
850 struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb);
853 get_node_info(sbi, page->index, &ni);
855 if (ni.blk_addr == NULL_ADDR)
857 return f2fs_readpage(sbi, page, ni.blk_addr, type);
861 * Readahead a node page
863 void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid)
865 struct address_space *mapping = sbi->node_inode->i_mapping;
868 apage = find_get_page(mapping, nid);
869 if (apage && PageUptodate(apage))
871 f2fs_put_page(apage, 0);
873 apage = grab_cache_page(mapping, nid);
877 if (read_node_page(apage, READA))
881 f2fs_put_page(apage, 0);
885 struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid)
889 struct address_space *mapping = sbi->node_inode->i_mapping;
891 page = grab_cache_page(mapping, nid);
893 return ERR_PTR(-ENOMEM);
895 err = read_node_page(page, READ_SYNC);
897 f2fs_put_page(page, 1);
901 BUG_ON(nid != nid_of_node(page));
902 mark_page_accessed(page);
907 * Return a locked page for the desired node page.
908 * And, readahead MAX_RA_NODE number of node pages.
910 struct page *get_node_page_ra(struct page *parent, int start)
912 struct f2fs_sb_info *sbi = F2FS_SB(parent->mapping->host->i_sb);
913 struct address_space *mapping = sbi->node_inode->i_mapping;
919 /* First, try getting the desired direct node. */
920 nid = get_nid(parent, start, false);
922 return ERR_PTR(-ENOENT);
924 page = find_get_page(mapping, nid);
925 if (page && PageUptodate(page))
927 f2fs_put_page(page, 0);
930 page = grab_cache_page(mapping, nid);
932 return ERR_PTR(-ENOMEM);
934 err = read_node_page(page, READ_SYNC);
936 f2fs_put_page(page, 1);
940 /* Then, try readahead for siblings of the desired node */
941 end = start + MAX_RA_NODE;
942 end = min(end, NIDS_PER_BLOCK);
943 for (i = start + 1; i < end; i++) {
944 nid = get_nid(parent, i, false);
947 ra_node_page(sbi, nid);
952 if (PageError(page)) {
953 f2fs_put_page(page, 1);
954 return ERR_PTR(-EIO);
957 /* Has the page been truncated? */
958 if (page->mapping != mapping) {
959 f2fs_put_page(page, 1);
965 void sync_inode_page(struct dnode_of_data *dn)
967 if (IS_INODE(dn->node_page) || dn->inode_page == dn->node_page) {
968 update_inode(dn->inode, dn->node_page);
969 } else if (dn->inode_page) {
970 if (!dn->inode_page_locked)
971 lock_page(dn->inode_page);
972 update_inode(dn->inode, dn->inode_page);
973 if (!dn->inode_page_locked)
974 unlock_page(dn->inode_page);
976 f2fs_write_inode(dn->inode, NULL);
980 int sync_node_pages(struct f2fs_sb_info *sbi, nid_t ino,
981 struct writeback_control *wbc)
983 struct address_space *mapping = sbi->node_inode->i_mapping;
986 int step = ino ? 2 : 0;
987 int nwritten = 0, wrote = 0;
989 pagevec_init(&pvec, 0);
995 while (index <= end) {
997 nr_pages = pagevec_lookup_tag(&pvec, mapping, &index,
999 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
1003 for (i = 0; i < nr_pages; i++) {
1004 struct page *page = pvec.pages[i];
1007 * flushing sequence with step:
1012 if (step == 0 && IS_DNODE(page))
1014 if (step == 1 && (!IS_DNODE(page) ||
1015 is_cold_node(page)))
1017 if (step == 2 && (!IS_DNODE(page) ||
1018 !is_cold_node(page)))
1023 * we should not skip writing node pages.
1025 if (ino && ino_of_node(page) == ino)
1027 else if (!trylock_page(page))
1030 if (unlikely(page->mapping != mapping)) {
1035 if (ino && ino_of_node(page) != ino)
1036 goto continue_unlock;
1038 if (!PageDirty(page)) {
1039 /* someone wrote it for us */
1040 goto continue_unlock;
1043 if (!clear_page_dirty_for_io(page))
1044 goto continue_unlock;
1046 /* called by fsync() */
1047 if (ino && IS_DNODE(page)) {
1048 int mark = !is_checkpointed_node(sbi, ino);
1049 set_fsync_mark(page, 1);
1051 set_dentry_mark(page, mark);
1054 set_fsync_mark(page, 0);
1055 set_dentry_mark(page, 0);
1057 mapping->a_ops->writepage(page, wbc);
1060 if (--wbc->nr_to_write == 0)
1063 pagevec_release(&pvec);
1066 if (wbc->nr_to_write == 0) {
1078 f2fs_submit_bio(sbi, NODE, wbc->sync_mode == WB_SYNC_ALL);
1083 static int f2fs_write_node_page(struct page *page,
1084 struct writeback_control *wbc)
1086 struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb);
1089 struct node_info ni;
1091 if (wbc->for_reclaim) {
1092 dec_page_count(sbi, F2FS_DIRTY_NODES);
1093 wbc->pages_skipped++;
1094 set_page_dirty(page);
1095 return AOP_WRITEPAGE_ACTIVATE;
1098 wait_on_page_writeback(page);
1100 mutex_lock_op(sbi, NODE_WRITE);
1102 /* get old block addr of this node page */
1103 nid = nid_of_node(page);
1104 BUG_ON(page->index != nid);
1106 get_node_info(sbi, nid, &ni);
1108 /* This page is already truncated */
1109 if (ni.blk_addr == NULL_ADDR)
1112 set_page_writeback(page);
1114 /* insert node offset */
1115 write_node_page(sbi, page, nid, ni.blk_addr, &new_addr);
1116 set_node_addr(sbi, &ni, new_addr);
1118 dec_page_count(sbi, F2FS_DIRTY_NODES);
1119 mutex_unlock_op(sbi, NODE_WRITE);
1125 * It is very important to gather dirty pages and write at once, so that we can
1126 * submit a big bio without interfering other data writes.
1127 * Be default, 512 pages (2MB), a segment size, is quite reasonable.
1129 #define COLLECT_DIRTY_NODES 512
1130 static int f2fs_write_node_pages(struct address_space *mapping,
1131 struct writeback_control *wbc)
1133 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
1134 struct block_device *bdev = sbi->sb->s_bdev;
1135 long nr_to_write = wbc->nr_to_write;
1137 /* First check balancing cached NAT entries */
1138 if (try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK)) {
1139 write_checkpoint(sbi, false);
1143 /* collect a number of dirty node pages and write together */
1144 if (get_pages(sbi, F2FS_DIRTY_NODES) < COLLECT_DIRTY_NODES)
1147 /* if mounting is failed, skip writing node pages */
1148 wbc->nr_to_write = bio_get_nr_vecs(bdev);
1149 sync_node_pages(sbi, 0, wbc);
1150 wbc->nr_to_write = nr_to_write -
1151 (bio_get_nr_vecs(bdev) - wbc->nr_to_write);
1155 static int f2fs_set_node_page_dirty(struct page *page)
1157 struct address_space *mapping = page->mapping;
1158 struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb);
1160 SetPageUptodate(page);
1161 if (!PageDirty(page)) {
1162 __set_page_dirty_nobuffers(page);
1163 inc_page_count(sbi, F2FS_DIRTY_NODES);
1164 SetPagePrivate(page);
1170 static void f2fs_invalidate_node_page(struct page *page, unsigned long offset)
1172 struct inode *inode = page->mapping->host;
1173 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
1174 if (PageDirty(page))
1175 dec_page_count(sbi, F2FS_DIRTY_NODES);
1176 ClearPagePrivate(page);
1179 static int f2fs_release_node_page(struct page *page, gfp_t wait)
1181 ClearPagePrivate(page);
1186 * Structure of the f2fs node operations
1188 const struct address_space_operations f2fs_node_aops = {
1189 .writepage = f2fs_write_node_page,
1190 .writepages = f2fs_write_node_pages,
1191 .set_page_dirty = f2fs_set_node_page_dirty,
1192 .invalidatepage = f2fs_invalidate_node_page,
1193 .releasepage = f2fs_release_node_page,
1196 static struct free_nid *__lookup_free_nid_list(nid_t n, struct list_head *head)
1198 struct list_head *this;
1199 struct free_nid *i = NULL;
1200 list_for_each(this, head) {
1201 i = list_entry(this, struct free_nid, list);
1209 static void __del_from_free_nid_list(struct free_nid *i)
1212 kmem_cache_free(free_nid_slab, i);
1215 static int add_free_nid(struct f2fs_nm_info *nm_i, nid_t nid)
1219 if (nm_i->fcnt > 2 * MAX_FREE_NIDS)
1222 i = kmem_cache_alloc(free_nid_slab, GFP_NOFS);
1230 spin_lock(&nm_i->free_nid_list_lock);
1231 if (__lookup_free_nid_list(nid, &nm_i->free_nid_list)) {
1232 spin_unlock(&nm_i->free_nid_list_lock);
1233 kmem_cache_free(free_nid_slab, i);
1236 list_add_tail(&i->list, &nm_i->free_nid_list);
1238 spin_unlock(&nm_i->free_nid_list_lock);
1242 static void remove_free_nid(struct f2fs_nm_info *nm_i, nid_t nid)
1245 spin_lock(&nm_i->free_nid_list_lock);
1246 i = __lookup_free_nid_list(nid, &nm_i->free_nid_list);
1247 if (i && i->state == NID_NEW) {
1248 __del_from_free_nid_list(i);
1251 spin_unlock(&nm_i->free_nid_list_lock);
1254 static int scan_nat_page(struct f2fs_nm_info *nm_i,
1255 struct page *nat_page, nid_t start_nid)
1257 struct f2fs_nat_block *nat_blk = page_address(nat_page);
1262 /* 0 nid should not be used */
1266 i = start_nid % NAT_ENTRY_PER_BLOCK;
1268 for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) {
1269 blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr);
1270 BUG_ON(blk_addr == NEW_ADDR);
1271 if (blk_addr == NULL_ADDR)
1272 fcnt += add_free_nid(nm_i, start_nid);
1277 static void build_free_nids(struct f2fs_sb_info *sbi)
1279 struct free_nid *fnid, *next_fnid;
1280 struct f2fs_nm_info *nm_i = NM_I(sbi);
1281 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
1282 struct f2fs_summary_block *sum = curseg->sum_blk;
1284 bool is_cycled = false;
1288 nid = nm_i->next_scan_nid;
1289 nm_i->init_scan_nid = nid;
1291 ra_nat_pages(sbi, nid);
1294 struct page *page = get_current_nat_page(sbi, nid);
1296 fcnt += scan_nat_page(nm_i, page, nid);
1297 f2fs_put_page(page, 1);
1299 nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK));
1301 if (nid >= nm_i->max_nid) {
1305 if (fcnt > MAX_FREE_NIDS)
1307 if (is_cycled && nm_i->init_scan_nid <= nid)
1311 nm_i->next_scan_nid = nid;
1313 /* find free nids from current sum_pages */
1314 mutex_lock(&curseg->curseg_mutex);
1315 for (i = 0; i < nats_in_cursum(sum); i++) {
1316 block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr);
1317 nid = le32_to_cpu(nid_in_journal(sum, i));
1318 if (addr == NULL_ADDR)
1319 add_free_nid(nm_i, nid);
1321 remove_free_nid(nm_i, nid);
1323 mutex_unlock(&curseg->curseg_mutex);
1325 /* remove the free nids from current allocated nids */
1326 list_for_each_entry_safe(fnid, next_fnid, &nm_i->free_nid_list, list) {
1327 struct nat_entry *ne;
1329 read_lock(&nm_i->nat_tree_lock);
1330 ne = __lookup_nat_cache(nm_i, fnid->nid);
1331 if (ne && nat_get_blkaddr(ne) != NULL_ADDR)
1332 remove_free_nid(nm_i, fnid->nid);
1333 read_unlock(&nm_i->nat_tree_lock);
1338 * If this function returns success, caller can obtain a new nid
1339 * from second parameter of this function.
1340 * The returned nid could be used ino as well as nid when inode is created.
1342 bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid)
1344 struct f2fs_nm_info *nm_i = NM_I(sbi);
1345 struct free_nid *i = NULL;
1346 struct list_head *this;
1348 mutex_lock(&nm_i->build_lock);
1350 /* scan NAT in order to build free nid list */
1351 build_free_nids(sbi);
1353 mutex_unlock(&nm_i->build_lock);
1357 mutex_unlock(&nm_i->build_lock);
1360 * We check fcnt again since previous check is racy as
1361 * we didn't hold free_nid_list_lock. So other thread
1362 * could consume all of free nids.
1364 spin_lock(&nm_i->free_nid_list_lock);
1366 spin_unlock(&nm_i->free_nid_list_lock);
1370 BUG_ON(list_empty(&nm_i->free_nid_list));
1371 list_for_each(this, &nm_i->free_nid_list) {
1372 i = list_entry(this, struct free_nid, list);
1373 if (i->state == NID_NEW)
1377 BUG_ON(i->state != NID_NEW);
1379 i->state = NID_ALLOC;
1381 spin_unlock(&nm_i->free_nid_list_lock);
1386 * alloc_nid() should be called prior to this function.
1388 void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid)
1390 struct f2fs_nm_info *nm_i = NM_I(sbi);
1393 spin_lock(&nm_i->free_nid_list_lock);
1394 i = __lookup_free_nid_list(nid, &nm_i->free_nid_list);
1396 BUG_ON(i->state != NID_ALLOC);
1397 __del_from_free_nid_list(i);
1399 spin_unlock(&nm_i->free_nid_list_lock);
1403 * alloc_nid() should be called prior to this function.
1405 void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid)
1407 alloc_nid_done(sbi, nid);
1408 add_free_nid(NM_I(sbi), nid);
1411 void recover_node_page(struct f2fs_sb_info *sbi, struct page *page,
1412 struct f2fs_summary *sum, struct node_info *ni,
1413 block_t new_blkaddr)
1415 rewrite_node_page(sbi, page, sum, ni->blk_addr, new_blkaddr);
1416 set_node_addr(sbi, ni, new_blkaddr);
1417 clear_node_page_dirty(page);
1420 int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page)
1422 struct address_space *mapping = sbi->node_inode->i_mapping;
1423 struct f2fs_node *src, *dst;
1424 nid_t ino = ino_of_node(page);
1425 struct node_info old_ni, new_ni;
1428 ipage = grab_cache_page(mapping, ino);
1432 /* Should not use this inode from free nid list */
1433 remove_free_nid(NM_I(sbi), ino);
1435 get_node_info(sbi, ino, &old_ni);
1436 SetPageUptodate(ipage);
1437 fill_node_footer(ipage, ino, ino, 0, true);
1439 src = (struct f2fs_node *)page_address(page);
1440 dst = (struct f2fs_node *)page_address(ipage);
1442 memcpy(dst, src, (unsigned long)&src->i.i_ext - (unsigned long)&src->i);
1444 dst->i.i_blocks = cpu_to_le64(1);
1445 dst->i.i_links = cpu_to_le32(1);
1446 dst->i.i_xattr_nid = 0;
1451 set_node_addr(sbi, &new_ni, NEW_ADDR);
1452 inc_valid_inode_count(sbi);
1454 f2fs_put_page(ipage, 1);
1458 int restore_node_summary(struct f2fs_sb_info *sbi,
1459 unsigned int segno, struct f2fs_summary_block *sum)
1461 struct f2fs_node *rn;
1462 struct f2fs_summary *sum_entry;
1467 /* alloc temporal page for read node */
1468 page = alloc_page(GFP_NOFS | __GFP_ZERO);
1470 return PTR_ERR(page);
1473 /* scan the node segment */
1474 last_offset = sbi->blocks_per_seg;
1475 addr = START_BLOCK(sbi, segno);
1476 sum_entry = &sum->entries[0];
1478 for (i = 0; i < last_offset; i++, sum_entry++) {
1479 if (f2fs_readpage(sbi, page, addr, READ_SYNC))
1482 rn = (struct f2fs_node *)page_address(page);
1483 sum_entry->nid = rn->footer.nid;
1484 sum_entry->version = 0;
1485 sum_entry->ofs_in_node = 0;
1489 * In order to read next node page,
1490 * we must clear PageUptodate flag.
1492 ClearPageUptodate(page);
1496 __free_pages(page, 0);
1500 static bool flush_nats_in_journal(struct f2fs_sb_info *sbi)
1502 struct f2fs_nm_info *nm_i = NM_I(sbi);
1503 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
1504 struct f2fs_summary_block *sum = curseg->sum_blk;
1507 mutex_lock(&curseg->curseg_mutex);
1509 if (nats_in_cursum(sum) < NAT_JOURNAL_ENTRIES) {
1510 mutex_unlock(&curseg->curseg_mutex);
1514 for (i = 0; i < nats_in_cursum(sum); i++) {
1515 struct nat_entry *ne;
1516 struct f2fs_nat_entry raw_ne;
1517 nid_t nid = le32_to_cpu(nid_in_journal(sum, i));
1519 raw_ne = nat_in_journal(sum, i);
1521 write_lock(&nm_i->nat_tree_lock);
1522 ne = __lookup_nat_cache(nm_i, nid);
1524 __set_nat_cache_dirty(nm_i, ne);
1525 write_unlock(&nm_i->nat_tree_lock);
1528 ne = grab_nat_entry(nm_i, nid);
1530 write_unlock(&nm_i->nat_tree_lock);
1533 nat_set_blkaddr(ne, le32_to_cpu(raw_ne.block_addr));
1534 nat_set_ino(ne, le32_to_cpu(raw_ne.ino));
1535 nat_set_version(ne, raw_ne.version);
1536 __set_nat_cache_dirty(nm_i, ne);
1537 write_unlock(&nm_i->nat_tree_lock);
1539 update_nats_in_cursum(sum, -i);
1540 mutex_unlock(&curseg->curseg_mutex);
1545 * This function is called during the checkpointing process.
1547 void flush_nat_entries(struct f2fs_sb_info *sbi)
1549 struct f2fs_nm_info *nm_i = NM_I(sbi);
1550 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA);
1551 struct f2fs_summary_block *sum = curseg->sum_blk;
1552 struct list_head *cur, *n;
1553 struct page *page = NULL;
1554 struct f2fs_nat_block *nat_blk = NULL;
1555 nid_t start_nid = 0, end_nid = 0;
1558 flushed = flush_nats_in_journal(sbi);
1561 mutex_lock(&curseg->curseg_mutex);
1563 /* 1) flush dirty nat caches */
1564 list_for_each_safe(cur, n, &nm_i->dirty_nat_entries) {
1565 struct nat_entry *ne;
1567 struct f2fs_nat_entry raw_ne;
1569 block_t new_blkaddr;
1571 ne = list_entry(cur, struct nat_entry, list);
1572 nid = nat_get_nid(ne);
1574 if (nat_get_blkaddr(ne) == NEW_ADDR)
1579 /* if there is room for nat enries in curseg->sumpage */
1580 offset = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 1);
1582 raw_ne = nat_in_journal(sum, offset);
1586 if (!page || (start_nid > nid || nid > end_nid)) {
1588 f2fs_put_page(page, 1);
1591 start_nid = START_NID(nid);
1592 end_nid = start_nid + NAT_ENTRY_PER_BLOCK - 1;
1595 * get nat block with dirty flag, increased reference
1596 * count, mapped and lock
1598 page = get_next_nat_page(sbi, start_nid);
1599 nat_blk = page_address(page);
1603 raw_ne = nat_blk->entries[nid - start_nid];
1605 new_blkaddr = nat_get_blkaddr(ne);
1607 raw_ne.ino = cpu_to_le32(nat_get_ino(ne));
1608 raw_ne.block_addr = cpu_to_le32(new_blkaddr);
1609 raw_ne.version = nat_get_version(ne);
1612 nat_blk->entries[nid - start_nid] = raw_ne;
1614 nat_in_journal(sum, offset) = raw_ne;
1615 nid_in_journal(sum, offset) = cpu_to_le32(nid);
1618 if (nat_get_blkaddr(ne) == NULL_ADDR) {
1619 write_lock(&nm_i->nat_tree_lock);
1620 __del_from_nat_cache(nm_i, ne);
1621 write_unlock(&nm_i->nat_tree_lock);
1623 /* We can reuse this freed nid at this point */
1624 add_free_nid(NM_I(sbi), nid);
1626 write_lock(&nm_i->nat_tree_lock);
1627 __clear_nat_cache_dirty(nm_i, ne);
1628 ne->checkpointed = true;
1629 write_unlock(&nm_i->nat_tree_lock);
1633 mutex_unlock(&curseg->curseg_mutex);
1634 f2fs_put_page(page, 1);
1636 /* 2) shrink nat caches if necessary */
1637 try_to_free_nats(sbi, nm_i->nat_cnt - NM_WOUT_THRESHOLD);
1640 static int init_node_manager(struct f2fs_sb_info *sbi)
1642 struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi);
1643 struct f2fs_nm_info *nm_i = NM_I(sbi);
1644 unsigned char *version_bitmap;
1645 unsigned int nat_segs, nat_blocks;
1647 nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr);
1649 /* segment_count_nat includes pair segment so divide to 2. */
1650 nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1;
1651 nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg);
1652 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks;
1656 INIT_LIST_HEAD(&nm_i->free_nid_list);
1657 INIT_RADIX_TREE(&nm_i->nat_root, GFP_ATOMIC);
1658 INIT_LIST_HEAD(&nm_i->nat_entries);
1659 INIT_LIST_HEAD(&nm_i->dirty_nat_entries);
1661 mutex_init(&nm_i->build_lock);
1662 spin_lock_init(&nm_i->free_nid_list_lock);
1663 rwlock_init(&nm_i->nat_tree_lock);
1665 nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP);
1666 nm_i->init_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid);
1667 nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid);
1669 nm_i->nat_bitmap = kzalloc(nm_i->bitmap_size, GFP_KERNEL);
1670 if (!nm_i->nat_bitmap)
1672 version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP);
1673 if (!version_bitmap)
1676 /* copy version bitmap */
1677 memcpy(nm_i->nat_bitmap, version_bitmap, nm_i->bitmap_size);
1681 int build_node_manager(struct f2fs_sb_info *sbi)
1685 sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL);
1689 err = init_node_manager(sbi);
1693 build_free_nids(sbi);
1697 void destroy_node_manager(struct f2fs_sb_info *sbi)
1699 struct f2fs_nm_info *nm_i = NM_I(sbi);
1700 struct free_nid *i, *next_i;
1701 struct nat_entry *natvec[NATVEC_SIZE];
1708 /* destroy free nid list */
1709 spin_lock(&nm_i->free_nid_list_lock);
1710 list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) {
1711 BUG_ON(i->state == NID_ALLOC);
1712 __del_from_free_nid_list(i);
1716 spin_unlock(&nm_i->free_nid_list_lock);
1718 /* destroy nat cache */
1719 write_lock(&nm_i->nat_tree_lock);
1720 while ((found = __gang_lookup_nat_cache(nm_i,
1721 nid, NATVEC_SIZE, natvec))) {
1723 for (idx = 0; idx < found; idx++) {
1724 struct nat_entry *e = natvec[idx];
1725 nid = nat_get_nid(e) + 1;
1726 __del_from_nat_cache(nm_i, e);
1729 BUG_ON(nm_i->nat_cnt);
1730 write_unlock(&nm_i->nat_tree_lock);
1732 kfree(nm_i->nat_bitmap);
1733 sbi->nm_info = NULL;
1737 int __init create_node_manager_caches(void)
1739 nat_entry_slab = f2fs_kmem_cache_create("nat_entry",
1740 sizeof(struct nat_entry), NULL);
1741 if (!nat_entry_slab)
1744 free_nid_slab = f2fs_kmem_cache_create("free_nid",
1745 sizeof(struct free_nid), NULL);
1746 if (!free_nid_slab) {
1747 kmem_cache_destroy(nat_entry_slab);
1753 void destroy_node_manager_caches(void)
1755 kmem_cache_destroy(free_nid_slab);
1756 kmem_cache_destroy(nat_entry_slab);