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 page_cache_release(page
);
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
;
271 /* Check nat cache */
272 read_lock(&nm_i
->nat_tree_lock
);
273 e
= __lookup_nat_cache(nm_i
, nid
);
275 ni
->ino
= nat_get_ino(e
);
276 ni
->blk_addr
= nat_get_blkaddr(e
);
277 ni
->version
= nat_get_version(e
);
279 read_unlock(&nm_i
->nat_tree_lock
);
283 /* Check current segment summary */
284 mutex_lock(&curseg
->curseg_mutex
);
285 i
= lookup_journal_in_cursum(sum
, NAT_JOURNAL
, nid
, 0);
287 ne
= nat_in_journal(sum
, i
);
288 node_info_from_raw_nat(ni
, &ne
);
290 mutex_unlock(&curseg
->curseg_mutex
);
294 /* Fill node_info from nat page */
295 page
= get_current_nat_page(sbi
, start_nid
);
296 nat_blk
= (struct f2fs_nat_block
*)page_address(page
);
297 ne
= nat_blk
->entries
[nid
- start_nid
];
298 node_info_from_raw_nat(ni
, &ne
);
299 f2fs_put_page(page
, 1);
301 /* cache nat entry */
302 cache_nat_entry(NM_I(sbi
), nid
, &ne
);
306 * The maximum depth is four.
307 * Offset[0] will have raw inode offset.
309 static int get_node_path(long block
, int offset
[4], unsigned int noffset
[4])
311 const long direct_index
= ADDRS_PER_INODE
;
312 const long direct_blks
= ADDRS_PER_BLOCK
;
313 const long dptrs_per_blk
= NIDS_PER_BLOCK
;
314 const long indirect_blks
= ADDRS_PER_BLOCK
* NIDS_PER_BLOCK
;
315 const long dindirect_blks
= indirect_blks
* NIDS_PER_BLOCK
;
321 if (block
< direct_index
) {
326 block
-= direct_index
;
327 if (block
< direct_blks
) {
328 offset
[n
++] = NODE_DIR1_BLOCK
;
334 block
-= direct_blks
;
335 if (block
< direct_blks
) {
336 offset
[n
++] = NODE_DIR2_BLOCK
;
342 block
-= direct_blks
;
343 if (block
< indirect_blks
) {
344 offset
[n
++] = NODE_IND1_BLOCK
;
346 offset
[n
++] = block
/ direct_blks
;
347 noffset
[n
] = 4 + offset
[n
- 1];
348 offset
[n
++] = block
% direct_blks
;
352 block
-= indirect_blks
;
353 if (block
< indirect_blks
) {
354 offset
[n
++] = NODE_IND2_BLOCK
;
355 noffset
[n
] = 4 + dptrs_per_blk
;
356 offset
[n
++] = block
/ direct_blks
;
357 noffset
[n
] = 5 + dptrs_per_blk
+ offset
[n
- 1];
358 offset
[n
++] = block
% direct_blks
;
362 block
-= indirect_blks
;
363 if (block
< dindirect_blks
) {
364 offset
[n
++] = NODE_DIND_BLOCK
;
365 noffset
[n
] = 5 + (dptrs_per_blk
* 2);
366 offset
[n
++] = block
/ indirect_blks
;
367 noffset
[n
] = 6 + (dptrs_per_blk
* 2) +
368 offset
[n
- 1] * (dptrs_per_blk
+ 1);
369 offset
[n
++] = (block
/ direct_blks
) % dptrs_per_blk
;
370 noffset
[n
] = 7 + (dptrs_per_blk
* 2) +
371 offset
[n
- 2] * (dptrs_per_blk
+ 1) +
373 offset
[n
++] = block
% direct_blks
;
384 * Caller should call f2fs_put_dnode(dn).
386 int get_dnode_of_data(struct dnode_of_data
*dn
, pgoff_t index
, int ro
)
388 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
389 struct page
*npage
[4];
392 unsigned int noffset
[4];
397 level
= get_node_path(index
, offset
, noffset
);
399 nids
[0] = dn
->inode
->i_ino
;
400 npage
[0] = get_node_page(sbi
, nids
[0]);
401 if (IS_ERR(npage
[0]))
402 return PTR_ERR(npage
[0]);
405 nids
[1] = get_nid(parent
, offset
[0], true);
406 dn
->inode_page
= npage
[0];
407 dn
->inode_page_locked
= true;
409 /* get indirect or direct nodes */
410 for (i
= 1; i
<= level
; i
++) {
413 if (!nids
[i
] && !ro
) {
414 mutex_lock_op(sbi
, NODE_NEW
);
417 if (!alloc_nid(sbi
, &(nids
[i
]))) {
418 mutex_unlock_op(sbi
, NODE_NEW
);
424 npage
[i
] = new_node_page(dn
, noffset
[i
]);
425 if (IS_ERR(npage
[i
])) {
426 alloc_nid_failed(sbi
, nids
[i
]);
427 mutex_unlock_op(sbi
, NODE_NEW
);
428 err
= PTR_ERR(npage
[i
]);
432 set_nid(parent
, offset
[i
- 1], nids
[i
], i
== 1);
433 alloc_nid_done(sbi
, nids
[i
]);
434 mutex_unlock_op(sbi
, NODE_NEW
);
436 } else if (ro
&& i
== level
&& level
> 1) {
437 npage
[i
] = get_node_page_ra(parent
, offset
[i
- 1]);
438 if (IS_ERR(npage
[i
])) {
439 err
= PTR_ERR(npage
[i
]);
445 dn
->inode_page_locked
= false;
448 f2fs_put_page(parent
, 1);
452 npage
[i
] = get_node_page(sbi
, nids
[i
]);
453 if (IS_ERR(npage
[i
])) {
454 err
= PTR_ERR(npage
[i
]);
455 f2fs_put_page(npage
[0], 0);
461 nids
[i
+ 1] = get_nid(parent
, offset
[i
], false);
464 dn
->nid
= nids
[level
];
465 dn
->ofs_in_node
= offset
[level
];
466 dn
->node_page
= npage
[level
];
467 dn
->data_blkaddr
= datablock_addr(dn
->node_page
, dn
->ofs_in_node
);
471 f2fs_put_page(parent
, 1);
473 f2fs_put_page(npage
[0], 0);
475 dn
->inode_page
= NULL
;
476 dn
->node_page
= NULL
;
480 static void truncate_node(struct dnode_of_data
*dn
)
482 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
485 get_node_info(sbi
, dn
->nid
, &ni
);
486 BUG_ON(ni
.blk_addr
== NULL_ADDR
);
488 if (ni
.blk_addr
!= NULL_ADDR
)
489 invalidate_blocks(sbi
, ni
.blk_addr
);
491 /* Deallocate node address */
492 dec_valid_node_count(sbi
, dn
->inode
, 1);
493 set_node_addr(sbi
, &ni
, NULL_ADDR
);
495 if (dn
->nid
== dn
->inode
->i_ino
) {
496 remove_orphan_inode(sbi
, dn
->nid
);
497 dec_valid_inode_count(sbi
);
502 clear_node_page_dirty(dn
->node_page
);
503 F2FS_SET_SB_DIRT(sbi
);
505 f2fs_put_page(dn
->node_page
, 1);
506 dn
->node_page
= NULL
;
509 static int truncate_dnode(struct dnode_of_data
*dn
)
511 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
517 /* get direct node */
518 page
= get_node_page(sbi
, dn
->nid
);
519 if (IS_ERR(page
) && PTR_ERR(page
) == -ENOENT
)
521 else if (IS_ERR(page
))
522 return PTR_ERR(page
);
524 /* Make dnode_of_data for parameter */
525 dn
->node_page
= page
;
527 truncate_data_blocks(dn
);
532 static int truncate_nodes(struct dnode_of_data
*dn
, unsigned int nofs
,
535 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
536 struct dnode_of_data rdn
= *dn
;
538 struct f2fs_node
*rn
;
540 unsigned int child_nofs
;
545 return NIDS_PER_BLOCK
+ 1;
547 page
= get_node_page(sbi
, dn
->nid
);
549 return PTR_ERR(page
);
551 rn
= (struct f2fs_node
*)page_address(page
);
553 for (i
= ofs
; i
< NIDS_PER_BLOCK
; i
++, freed
++) {
554 child_nid
= le32_to_cpu(rn
->in
.nid
[i
]);
558 ret
= truncate_dnode(&rdn
);
561 set_nid(page
, i
, 0, false);
564 child_nofs
= nofs
+ ofs
* (NIDS_PER_BLOCK
+ 1) + 1;
565 for (i
= ofs
; i
< NIDS_PER_BLOCK
; i
++) {
566 child_nid
= le32_to_cpu(rn
->in
.nid
[i
]);
567 if (child_nid
== 0) {
568 child_nofs
+= NIDS_PER_BLOCK
+ 1;
572 ret
= truncate_nodes(&rdn
, child_nofs
, 0, depth
- 1);
573 if (ret
== (NIDS_PER_BLOCK
+ 1)) {
574 set_nid(page
, i
, 0, false);
576 } else if (ret
< 0 && ret
!= -ENOENT
) {
584 /* remove current indirect node */
585 dn
->node_page
= page
;
589 f2fs_put_page(page
, 1);
594 f2fs_put_page(page
, 1);
598 static int truncate_partial_nodes(struct dnode_of_data
*dn
,
599 struct f2fs_inode
*ri
, int *offset
, int depth
)
601 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
602 struct page
*pages
[2];
609 nid
[0] = le32_to_cpu(ri
->i_nid
[offset
[0] - NODE_DIR1_BLOCK
]);
613 /* get indirect nodes in the path */
614 for (i
= 0; i
< depth
- 1; i
++) {
615 /* refernece count'll be increased */
616 pages
[i
] = get_node_page(sbi
, nid
[i
]);
617 if (IS_ERR(pages
[i
])) {
619 err
= PTR_ERR(pages
[i
]);
622 nid
[i
+ 1] = get_nid(pages
[i
], offset
[i
+ 1], false);
625 /* free direct nodes linked to a partial indirect node */
626 for (i
= offset
[depth
- 1]; i
< NIDS_PER_BLOCK
; i
++) {
627 child_nid
= get_nid(pages
[idx
], i
, false);
631 err
= truncate_dnode(dn
);
634 set_nid(pages
[idx
], i
, 0, false);
637 if (offset
[depth
- 1] == 0) {
638 dn
->node_page
= pages
[idx
];
642 f2fs_put_page(pages
[idx
], 1);
645 offset
[depth
- 1] = 0;
647 for (i
= depth
- 3; i
>= 0; i
--)
648 f2fs_put_page(pages
[i
], 1);
653 * All the block addresses of data and nodes should be nullified.
655 int truncate_inode_blocks(struct inode
*inode
, pgoff_t from
)
657 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
658 int err
= 0, cont
= 1;
659 int level
, offset
[4], noffset
[4];
661 struct f2fs_node
*rn
;
662 struct dnode_of_data dn
;
665 level
= get_node_path(from
, offset
, noffset
);
667 page
= get_node_page(sbi
, inode
->i_ino
);
669 return PTR_ERR(page
);
671 set_new_dnode(&dn
, inode
, page
, NULL
, 0);
674 rn
= page_address(page
);
682 if (!offset
[level
- 1])
684 err
= truncate_partial_nodes(&dn
, &rn
->i
, offset
, level
);
685 if (err
< 0 && err
!= -ENOENT
)
687 nofs
+= 1 + NIDS_PER_BLOCK
;
690 nofs
= 5 + 2 * NIDS_PER_BLOCK
;
691 if (!offset
[level
- 1])
693 err
= truncate_partial_nodes(&dn
, &rn
->i
, offset
, level
);
694 if (err
< 0 && err
!= -ENOENT
)
703 dn
.nid
= le32_to_cpu(rn
->i
.i_nid
[offset
[0] - NODE_DIR1_BLOCK
]);
705 case NODE_DIR1_BLOCK
:
706 case NODE_DIR2_BLOCK
:
707 err
= truncate_dnode(&dn
);
710 case NODE_IND1_BLOCK
:
711 case NODE_IND2_BLOCK
:
712 err
= truncate_nodes(&dn
, nofs
, offset
[1], 2);
715 case NODE_DIND_BLOCK
:
716 err
= truncate_nodes(&dn
, nofs
, offset
[1], 3);
723 if (err
< 0 && err
!= -ENOENT
)
725 if (offset
[1] == 0 &&
726 rn
->i
.i_nid
[offset
[0] - NODE_DIR1_BLOCK
]) {
728 wait_on_page_writeback(page
);
729 rn
->i
.i_nid
[offset
[0] - NODE_DIR1_BLOCK
] = 0;
730 set_page_dirty(page
);
738 f2fs_put_page(page
, 0);
739 return err
> 0 ? 0 : err
;
742 int remove_inode_page(struct inode
*inode
)
744 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
746 nid_t ino
= inode
->i_ino
;
747 struct dnode_of_data dn
;
749 mutex_lock_op(sbi
, NODE_TRUNC
);
750 page
= get_node_page(sbi
, ino
);
752 mutex_unlock_op(sbi
, NODE_TRUNC
);
753 return PTR_ERR(page
);
756 if (F2FS_I(inode
)->i_xattr_nid
) {
757 nid_t nid
= F2FS_I(inode
)->i_xattr_nid
;
758 struct page
*npage
= get_node_page(sbi
, nid
);
761 mutex_unlock_op(sbi
, NODE_TRUNC
);
762 return PTR_ERR(npage
);
765 F2FS_I(inode
)->i_xattr_nid
= 0;
766 set_new_dnode(&dn
, inode
, page
, npage
, nid
);
767 dn
.inode_page_locked
= 1;
770 if (inode
->i_blocks
== 1) {
771 /* inernally call f2fs_put_page() */
772 set_new_dnode(&dn
, inode
, page
, page
, ino
);
774 } else if (inode
->i_blocks
== 0) {
776 get_node_info(sbi
, inode
->i_ino
, &ni
);
778 /* called after f2fs_new_inode() is failed */
779 BUG_ON(ni
.blk_addr
!= NULL_ADDR
);
780 f2fs_put_page(page
, 1);
784 mutex_unlock_op(sbi
, NODE_TRUNC
);
788 int new_inode_page(struct inode
*inode
, struct dentry
*dentry
)
790 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
792 struct dnode_of_data dn
;
794 /* allocate inode page for new inode */
795 set_new_dnode(&dn
, inode
, NULL
, NULL
, inode
->i_ino
);
796 mutex_lock_op(sbi
, NODE_NEW
);
797 page
= new_node_page(&dn
, 0);
798 init_dent_inode(dentry
, page
);
799 mutex_unlock_op(sbi
, NODE_NEW
);
801 return PTR_ERR(page
);
802 f2fs_put_page(page
, 1);
806 struct page
*new_node_page(struct dnode_of_data
*dn
, unsigned int ofs
)
808 struct f2fs_sb_info
*sbi
= F2FS_SB(dn
->inode
->i_sb
);
809 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
810 struct node_info old_ni
, new_ni
;
814 if (is_inode_flag_set(F2FS_I(dn
->inode
), FI_NO_ALLOC
))
815 return ERR_PTR(-EPERM
);
817 page
= grab_cache_page(mapping
, dn
->nid
);
819 return ERR_PTR(-ENOMEM
);
821 get_node_info(sbi
, dn
->nid
, &old_ni
);
823 SetPageUptodate(page
);
824 fill_node_footer(page
, dn
->nid
, dn
->inode
->i_ino
, ofs
, true);
826 /* Reinitialize old_ni with new node page */
827 BUG_ON(old_ni
.blk_addr
!= NULL_ADDR
);
829 new_ni
.ino
= dn
->inode
->i_ino
;
831 if (!inc_valid_node_count(sbi
, dn
->inode
, 1)) {
835 set_node_addr(sbi
, &new_ni
, NEW_ADDR
);
837 dn
->node_page
= page
;
839 set_page_dirty(page
);
840 set_cold_node(dn
->inode
, page
);
842 inc_valid_inode_count(sbi
);
847 f2fs_put_page(page
, 1);
851 static int read_node_page(struct page
*page
, int type
)
853 struct f2fs_sb_info
*sbi
= F2FS_SB(page
->mapping
->host
->i_sb
);
856 get_node_info(sbi
, page
->index
, &ni
);
858 if (ni
.blk_addr
== NULL_ADDR
)
860 return f2fs_readpage(sbi
, page
, ni
.blk_addr
, type
);
864 * Readahead a node page
866 void ra_node_page(struct f2fs_sb_info
*sbi
, nid_t nid
)
868 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
871 apage
= find_get_page(mapping
, nid
);
872 if (apage
&& PageUptodate(apage
))
874 f2fs_put_page(apage
, 0);
876 apage
= grab_cache_page(mapping
, nid
);
880 if (read_node_page(apage
, READA
))
883 page_cache_release(apage
);
889 page_cache_release(apage
);
892 struct page
*get_node_page(struct f2fs_sb_info
*sbi
, pgoff_t nid
)
896 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
898 page
= grab_cache_page(mapping
, nid
);
900 return ERR_PTR(-ENOMEM
);
902 err
= read_node_page(page
, READ_SYNC
);
904 f2fs_put_page(page
, 1);
908 BUG_ON(nid
!= nid_of_node(page
));
909 mark_page_accessed(page
);
914 * Return a locked page for the desired node page.
915 * And, readahead MAX_RA_NODE number of node pages.
917 struct page
*get_node_page_ra(struct page
*parent
, int start
)
919 struct f2fs_sb_info
*sbi
= F2FS_SB(parent
->mapping
->host
->i_sb
);
920 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
926 /* First, try getting the desired direct node. */
927 nid
= get_nid(parent
, start
, false);
929 return ERR_PTR(-ENOENT
);
931 page
= find_get_page(mapping
, nid
);
932 if (page
&& PageUptodate(page
))
934 f2fs_put_page(page
, 0);
937 page
= grab_cache_page(mapping
, nid
);
939 return ERR_PTR(-ENOMEM
);
941 err
= read_node_page(page
, READA
);
943 f2fs_put_page(page
, 1);
947 /* Then, try readahead for siblings of the desired node */
948 end
= start
+ MAX_RA_NODE
;
949 end
= min(end
, NIDS_PER_BLOCK
);
950 for (i
= start
+ 1; i
< end
; i
++) {
951 nid
= get_nid(parent
, i
, false);
954 ra_node_page(sbi
, nid
);
959 if (PageError(page
)) {
960 f2fs_put_page(page
, 1);
961 return ERR_PTR(-EIO
);
964 /* Has the page been truncated? */
965 if (page
->mapping
!= mapping
) {
966 f2fs_put_page(page
, 1);
972 void sync_inode_page(struct dnode_of_data
*dn
)
974 if (IS_INODE(dn
->node_page
) || dn
->inode_page
== dn
->node_page
) {
975 update_inode(dn
->inode
, dn
->node_page
);
976 } else if (dn
->inode_page
) {
977 if (!dn
->inode_page_locked
)
978 lock_page(dn
->inode_page
);
979 update_inode(dn
->inode
, dn
->inode_page
);
980 if (!dn
->inode_page_locked
)
981 unlock_page(dn
->inode_page
);
983 f2fs_write_inode(dn
->inode
, NULL
);
987 int sync_node_pages(struct f2fs_sb_info
*sbi
, nid_t ino
,
988 struct writeback_control
*wbc
)
990 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
993 int step
= ino
? 2 : 0;
994 int nwritten
= 0, wrote
= 0;
996 pagevec_init(&pvec
, 0);
1002 while (index
<= end
) {
1004 nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
,
1005 PAGECACHE_TAG_DIRTY
,
1006 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1);
1010 for (i
= 0; i
< nr_pages
; i
++) {
1011 struct page
*page
= pvec
.pages
[i
];
1014 * flushing sequence with step:
1019 if (step
== 0 && IS_DNODE(page
))
1021 if (step
== 1 && (!IS_DNODE(page
) ||
1022 is_cold_node(page
)))
1024 if (step
== 2 && (!IS_DNODE(page
) ||
1025 !is_cold_node(page
)))
1030 * we should not skip writing node pages.
1032 if (ino
&& ino_of_node(page
) == ino
)
1034 else if (!trylock_page(page
))
1037 if (unlikely(page
->mapping
!= mapping
)) {
1042 if (ino
&& ino_of_node(page
) != ino
)
1043 goto continue_unlock
;
1045 if (!PageDirty(page
)) {
1046 /* someone wrote it for us */
1047 goto continue_unlock
;
1050 if (!clear_page_dirty_for_io(page
))
1051 goto continue_unlock
;
1053 /* called by fsync() */
1054 if (ino
&& IS_DNODE(page
)) {
1055 int mark
= !is_checkpointed_node(sbi
, ino
);
1056 set_fsync_mark(page
, 1);
1058 set_dentry_mark(page
, mark
);
1061 set_fsync_mark(page
, 0);
1062 set_dentry_mark(page
, 0);
1064 mapping
->a_ops
->writepage(page
, wbc
);
1067 if (--wbc
->nr_to_write
== 0)
1070 pagevec_release(&pvec
);
1073 if (wbc
->nr_to_write
== 0) {
1085 f2fs_submit_bio(sbi
, NODE
, wbc
->sync_mode
== WB_SYNC_ALL
);
1090 static int f2fs_write_node_page(struct page
*page
,
1091 struct writeback_control
*wbc
)
1093 struct f2fs_sb_info
*sbi
= F2FS_SB(page
->mapping
->host
->i_sb
);
1097 struct node_info ni
;
1099 if (wbc
->for_reclaim
) {
1100 dec_page_count(sbi
, F2FS_DIRTY_NODES
);
1101 wbc
->pages_skipped
++;
1102 set_page_dirty(page
);
1103 return AOP_WRITEPAGE_ACTIVATE
;
1106 wait_on_page_writeback(page
);
1108 mutex_lock_op(sbi
, NODE_WRITE
);
1110 /* get old block addr of this node page */
1111 nid
= nid_of_node(page
);
1112 nofs
= ofs_of_node(page
);
1113 BUG_ON(page
->index
!= nid
);
1115 get_node_info(sbi
, nid
, &ni
);
1117 /* This page is already truncated */
1118 if (ni
.blk_addr
== NULL_ADDR
)
1121 set_page_writeback(page
);
1123 /* insert node offset */
1124 write_node_page(sbi
, page
, nid
, ni
.blk_addr
, &new_addr
);
1125 set_node_addr(sbi
, &ni
, new_addr
);
1126 dec_page_count(sbi
, F2FS_DIRTY_NODES
);
1128 mutex_unlock_op(sbi
, NODE_WRITE
);
1133 static int f2fs_write_node_pages(struct address_space
*mapping
,
1134 struct writeback_control
*wbc
)
1136 struct f2fs_sb_info
*sbi
= F2FS_SB(mapping
->host
->i_sb
);
1137 struct block_device
*bdev
= sbi
->sb
->s_bdev
;
1138 long nr_to_write
= wbc
->nr_to_write
;
1140 if (wbc
->for_kupdate
)
1143 if (get_pages(sbi
, F2FS_DIRTY_NODES
) == 0)
1146 if (try_to_free_nats(sbi
, NAT_ENTRY_PER_BLOCK
)) {
1147 write_checkpoint(sbi
, false, false);
1151 /* if mounting is failed, skip writing node pages */
1152 wbc
->nr_to_write
= bio_get_nr_vecs(bdev
);
1153 sync_node_pages(sbi
, 0, wbc
);
1154 wbc
->nr_to_write
= nr_to_write
-
1155 (bio_get_nr_vecs(bdev
) - wbc
->nr_to_write
);
1159 static int f2fs_set_node_page_dirty(struct page
*page
)
1161 struct address_space
*mapping
= page
->mapping
;
1162 struct f2fs_sb_info
*sbi
= F2FS_SB(mapping
->host
->i_sb
);
1164 SetPageUptodate(page
);
1165 if (!PageDirty(page
)) {
1166 __set_page_dirty_nobuffers(page
);
1167 inc_page_count(sbi
, F2FS_DIRTY_NODES
);
1168 SetPagePrivate(page
);
1174 static void f2fs_invalidate_node_page(struct page
*page
, unsigned long offset
)
1176 struct inode
*inode
= page
->mapping
->host
;
1177 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
1178 if (PageDirty(page
))
1179 dec_page_count(sbi
, F2FS_DIRTY_NODES
);
1180 ClearPagePrivate(page
);
1183 static int f2fs_release_node_page(struct page
*page
, gfp_t wait
)
1185 ClearPagePrivate(page
);
1190 * Structure of the f2fs node operations
1192 const struct address_space_operations f2fs_node_aops
= {
1193 .writepage
= f2fs_write_node_page
,
1194 .writepages
= f2fs_write_node_pages
,
1195 .set_page_dirty
= f2fs_set_node_page_dirty
,
1196 .invalidatepage
= f2fs_invalidate_node_page
,
1197 .releasepage
= f2fs_release_node_page
,
1200 static struct free_nid
*__lookup_free_nid_list(nid_t n
, struct list_head
*head
)
1202 struct list_head
*this;
1203 struct free_nid
*i
= NULL
;
1204 list_for_each(this, head
) {
1205 i
= list_entry(this, struct free_nid
, list
);
1213 static void __del_from_free_nid_list(struct free_nid
*i
)
1216 kmem_cache_free(free_nid_slab
, i
);
1219 static int add_free_nid(struct f2fs_nm_info
*nm_i
, nid_t nid
)
1223 if (nm_i
->fcnt
> 2 * MAX_FREE_NIDS
)
1226 i
= kmem_cache_alloc(free_nid_slab
, GFP_NOFS
);
1234 spin_lock(&nm_i
->free_nid_list_lock
);
1235 if (__lookup_free_nid_list(nid
, &nm_i
->free_nid_list
)) {
1236 spin_unlock(&nm_i
->free_nid_list_lock
);
1237 kmem_cache_free(free_nid_slab
, i
);
1240 list_add_tail(&i
->list
, &nm_i
->free_nid_list
);
1242 spin_unlock(&nm_i
->free_nid_list_lock
);
1246 static void remove_free_nid(struct f2fs_nm_info
*nm_i
, nid_t nid
)
1249 spin_lock(&nm_i
->free_nid_list_lock
);
1250 i
= __lookup_free_nid_list(nid
, &nm_i
->free_nid_list
);
1251 if (i
&& i
->state
== NID_NEW
) {
1252 __del_from_free_nid_list(i
);
1255 spin_unlock(&nm_i
->free_nid_list_lock
);
1258 static int scan_nat_page(struct f2fs_nm_info
*nm_i
,
1259 struct page
*nat_page
, nid_t start_nid
)
1261 struct f2fs_nat_block
*nat_blk
= page_address(nat_page
);
1266 /* 0 nid should not be used */
1270 i
= start_nid
% NAT_ENTRY_PER_BLOCK
;
1272 for (; i
< NAT_ENTRY_PER_BLOCK
; i
++, start_nid
++) {
1273 blk_addr
= le32_to_cpu(nat_blk
->entries
[i
].block_addr
);
1274 BUG_ON(blk_addr
== NEW_ADDR
);
1275 if (blk_addr
== NULL_ADDR
)
1276 fcnt
+= add_free_nid(nm_i
, start_nid
);
1281 static void build_free_nids(struct f2fs_sb_info
*sbi
)
1283 struct free_nid
*fnid
, *next_fnid
;
1284 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1285 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_HOT_DATA
);
1286 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1288 bool is_cycled
= false;
1292 nid
= nm_i
->next_scan_nid
;
1293 nm_i
->init_scan_nid
= nid
;
1295 ra_nat_pages(sbi
, nid
);
1298 struct page
*page
= get_current_nat_page(sbi
, nid
);
1300 fcnt
+= scan_nat_page(nm_i
, page
, nid
);
1301 f2fs_put_page(page
, 1);
1303 nid
+= (NAT_ENTRY_PER_BLOCK
- (nid
% NAT_ENTRY_PER_BLOCK
));
1305 if (nid
>= nm_i
->max_nid
) {
1309 if (fcnt
> MAX_FREE_NIDS
)
1311 if (is_cycled
&& nm_i
->init_scan_nid
<= nid
)
1315 nm_i
->next_scan_nid
= nid
;
1317 /* find free nids from current sum_pages */
1318 mutex_lock(&curseg
->curseg_mutex
);
1319 for (i
= 0; i
< nats_in_cursum(sum
); i
++) {
1320 block_t addr
= le32_to_cpu(nat_in_journal(sum
, i
).block_addr
);
1321 nid
= le32_to_cpu(nid_in_journal(sum
, i
));
1322 if (addr
== NULL_ADDR
)
1323 add_free_nid(nm_i
, nid
);
1325 remove_free_nid(nm_i
, nid
);
1327 mutex_unlock(&curseg
->curseg_mutex
);
1329 /* remove the free nids from current allocated nids */
1330 list_for_each_entry_safe(fnid
, next_fnid
, &nm_i
->free_nid_list
, list
) {
1331 struct nat_entry
*ne
;
1333 read_lock(&nm_i
->nat_tree_lock
);
1334 ne
= __lookup_nat_cache(nm_i
, fnid
->nid
);
1335 if (ne
&& nat_get_blkaddr(ne
) != NULL_ADDR
)
1336 remove_free_nid(nm_i
, fnid
->nid
);
1337 read_unlock(&nm_i
->nat_tree_lock
);
1342 * If this function returns success, caller can obtain a new nid
1343 * from second parameter of this function.
1344 * The returned nid could be used ino as well as nid when inode is created.
1346 bool alloc_nid(struct f2fs_sb_info
*sbi
, nid_t
*nid
)
1348 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1349 struct free_nid
*i
= NULL
;
1350 struct list_head
*this;
1352 mutex_lock(&nm_i
->build_lock
);
1354 /* scan NAT in order to build free nid list */
1355 build_free_nids(sbi
);
1357 mutex_unlock(&nm_i
->build_lock
);
1361 mutex_unlock(&nm_i
->build_lock
);
1364 * We check fcnt again since previous check is racy as
1365 * we didn't hold free_nid_list_lock. So other thread
1366 * could consume all of free nids.
1368 spin_lock(&nm_i
->free_nid_list_lock
);
1370 spin_unlock(&nm_i
->free_nid_list_lock
);
1374 BUG_ON(list_empty(&nm_i
->free_nid_list
));
1375 list_for_each(this, &nm_i
->free_nid_list
) {
1376 i
= list_entry(this, struct free_nid
, list
);
1377 if (i
->state
== NID_NEW
)
1381 BUG_ON(i
->state
!= NID_NEW
);
1383 i
->state
= NID_ALLOC
;
1385 spin_unlock(&nm_i
->free_nid_list_lock
);
1390 * alloc_nid() should be called prior to this function.
1392 void alloc_nid_done(struct f2fs_sb_info
*sbi
, nid_t nid
)
1394 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1397 spin_lock(&nm_i
->free_nid_list_lock
);
1398 i
= __lookup_free_nid_list(nid
, &nm_i
->free_nid_list
);
1400 BUG_ON(i
->state
!= NID_ALLOC
);
1401 __del_from_free_nid_list(i
);
1403 spin_unlock(&nm_i
->free_nid_list_lock
);
1407 * alloc_nid() should be called prior to this function.
1409 void alloc_nid_failed(struct f2fs_sb_info
*sbi
, nid_t nid
)
1411 alloc_nid_done(sbi
, nid
);
1412 add_free_nid(NM_I(sbi
), nid
);
1415 void recover_node_page(struct f2fs_sb_info
*sbi
, struct page
*page
,
1416 struct f2fs_summary
*sum
, struct node_info
*ni
,
1417 block_t new_blkaddr
)
1419 rewrite_node_page(sbi
, page
, sum
, ni
->blk_addr
, new_blkaddr
);
1420 set_node_addr(sbi
, ni
, new_blkaddr
);
1421 clear_node_page_dirty(page
);
1424 int recover_inode_page(struct f2fs_sb_info
*sbi
, struct page
*page
)
1426 struct address_space
*mapping
= sbi
->node_inode
->i_mapping
;
1427 struct f2fs_node
*src
, *dst
;
1428 nid_t ino
= ino_of_node(page
);
1429 struct node_info old_ni
, new_ni
;
1432 ipage
= grab_cache_page(mapping
, ino
);
1436 /* Should not use this inode from free nid list */
1437 remove_free_nid(NM_I(sbi
), ino
);
1439 get_node_info(sbi
, ino
, &old_ni
);
1440 SetPageUptodate(ipage
);
1441 fill_node_footer(ipage
, ino
, ino
, 0, true);
1443 src
= (struct f2fs_node
*)page_address(page
);
1444 dst
= (struct f2fs_node
*)page_address(ipage
);
1446 memcpy(dst
, src
, (unsigned long)&src
->i
.i_ext
- (unsigned long)&src
->i
);
1448 dst
->i
.i_blocks
= 1;
1450 dst
->i
.i_xattr_nid
= 0;
1455 set_node_addr(sbi
, &new_ni
, NEW_ADDR
);
1456 inc_valid_inode_count(sbi
);
1458 f2fs_put_page(ipage
, 1);
1462 int restore_node_summary(struct f2fs_sb_info
*sbi
,
1463 unsigned int segno
, struct f2fs_summary_block
*sum
)
1465 struct f2fs_node
*rn
;
1466 struct f2fs_summary
*sum_entry
;
1471 /* alloc temporal page for read node */
1472 page
= alloc_page(GFP_NOFS
| __GFP_ZERO
);
1474 return PTR_ERR(page
);
1477 /* scan the node segment */
1478 last_offset
= sbi
->blocks_per_seg
;
1479 addr
= START_BLOCK(sbi
, segno
);
1480 sum_entry
= &sum
->entries
[0];
1482 for (i
= 0; i
< last_offset
; i
++, sum_entry
++) {
1483 if (f2fs_readpage(sbi
, page
, addr
, READ_SYNC
))
1486 rn
= (struct f2fs_node
*)page_address(page
);
1487 sum_entry
->nid
= rn
->footer
.nid
;
1488 sum_entry
->version
= 0;
1489 sum_entry
->ofs_in_node
= 0;
1493 * In order to read next node page,
1494 * we must clear PageUptodate flag.
1496 ClearPageUptodate(page
);
1500 __free_pages(page
, 0);
1504 static bool flush_nats_in_journal(struct f2fs_sb_info
*sbi
)
1506 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1507 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_HOT_DATA
);
1508 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1511 mutex_lock(&curseg
->curseg_mutex
);
1513 if (nats_in_cursum(sum
) < NAT_JOURNAL_ENTRIES
) {
1514 mutex_unlock(&curseg
->curseg_mutex
);
1518 for (i
= 0; i
< nats_in_cursum(sum
); i
++) {
1519 struct nat_entry
*ne
;
1520 struct f2fs_nat_entry raw_ne
;
1521 nid_t nid
= le32_to_cpu(nid_in_journal(sum
, i
));
1523 raw_ne
= nat_in_journal(sum
, i
);
1525 write_lock(&nm_i
->nat_tree_lock
);
1526 ne
= __lookup_nat_cache(nm_i
, nid
);
1528 __set_nat_cache_dirty(nm_i
, ne
);
1529 write_unlock(&nm_i
->nat_tree_lock
);
1532 ne
= grab_nat_entry(nm_i
, nid
);
1534 write_unlock(&nm_i
->nat_tree_lock
);
1537 nat_set_blkaddr(ne
, le32_to_cpu(raw_ne
.block_addr
));
1538 nat_set_ino(ne
, le32_to_cpu(raw_ne
.ino
));
1539 nat_set_version(ne
, raw_ne
.version
);
1540 __set_nat_cache_dirty(nm_i
, ne
);
1541 write_unlock(&nm_i
->nat_tree_lock
);
1543 update_nats_in_cursum(sum
, -i
);
1544 mutex_unlock(&curseg
->curseg_mutex
);
1549 * This function is called during the checkpointing process.
1551 void flush_nat_entries(struct f2fs_sb_info
*sbi
)
1553 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1554 struct curseg_info
*curseg
= CURSEG_I(sbi
, CURSEG_HOT_DATA
);
1555 struct f2fs_summary_block
*sum
= curseg
->sum_blk
;
1556 struct list_head
*cur
, *n
;
1557 struct page
*page
= NULL
;
1558 struct f2fs_nat_block
*nat_blk
= NULL
;
1559 nid_t start_nid
= 0, end_nid
= 0;
1562 flushed
= flush_nats_in_journal(sbi
);
1565 mutex_lock(&curseg
->curseg_mutex
);
1567 /* 1) flush dirty nat caches */
1568 list_for_each_safe(cur
, n
, &nm_i
->dirty_nat_entries
) {
1569 struct nat_entry
*ne
;
1571 struct f2fs_nat_entry raw_ne
;
1573 block_t old_blkaddr
, new_blkaddr
;
1575 ne
= list_entry(cur
, struct nat_entry
, list
);
1576 nid
= nat_get_nid(ne
);
1578 if (nat_get_blkaddr(ne
) == NEW_ADDR
)
1583 /* if there is room for nat enries in curseg->sumpage */
1584 offset
= lookup_journal_in_cursum(sum
, NAT_JOURNAL
, nid
, 1);
1586 raw_ne
= nat_in_journal(sum
, offset
);
1587 old_blkaddr
= le32_to_cpu(raw_ne
.block_addr
);
1591 if (!page
|| (start_nid
> nid
|| nid
> end_nid
)) {
1593 f2fs_put_page(page
, 1);
1596 start_nid
= START_NID(nid
);
1597 end_nid
= start_nid
+ NAT_ENTRY_PER_BLOCK
- 1;
1600 * get nat block with dirty flag, increased reference
1601 * count, mapped and lock
1603 page
= get_next_nat_page(sbi
, start_nid
);
1604 nat_blk
= page_address(page
);
1608 raw_ne
= nat_blk
->entries
[nid
- start_nid
];
1609 old_blkaddr
= le32_to_cpu(raw_ne
.block_addr
);
1611 new_blkaddr
= nat_get_blkaddr(ne
);
1613 raw_ne
.ino
= cpu_to_le32(nat_get_ino(ne
));
1614 raw_ne
.block_addr
= cpu_to_le32(new_blkaddr
);
1615 raw_ne
.version
= nat_get_version(ne
);
1618 nat_blk
->entries
[nid
- start_nid
] = raw_ne
;
1620 nat_in_journal(sum
, offset
) = raw_ne
;
1621 nid_in_journal(sum
, offset
) = cpu_to_le32(nid
);
1624 if (nat_get_blkaddr(ne
) == NULL_ADDR
) {
1625 write_lock(&nm_i
->nat_tree_lock
);
1626 __del_from_nat_cache(nm_i
, ne
);
1627 write_unlock(&nm_i
->nat_tree_lock
);
1629 /* We can reuse this freed nid at this point */
1630 add_free_nid(NM_I(sbi
), nid
);
1632 write_lock(&nm_i
->nat_tree_lock
);
1633 __clear_nat_cache_dirty(nm_i
, ne
);
1634 ne
->checkpointed
= true;
1635 write_unlock(&nm_i
->nat_tree_lock
);
1639 mutex_unlock(&curseg
->curseg_mutex
);
1640 f2fs_put_page(page
, 1);
1642 /* 2) shrink nat caches if necessary */
1643 try_to_free_nats(sbi
, nm_i
->nat_cnt
- NM_WOUT_THRESHOLD
);
1646 static int init_node_manager(struct f2fs_sb_info
*sbi
)
1648 struct f2fs_super_block
*sb_raw
= F2FS_RAW_SUPER(sbi
);
1649 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1650 unsigned char *version_bitmap
;
1651 unsigned int nat_segs
, nat_blocks
;
1653 nm_i
->nat_blkaddr
= le32_to_cpu(sb_raw
->nat_blkaddr
);
1655 /* segment_count_nat includes pair segment so divide to 2. */
1656 nat_segs
= le32_to_cpu(sb_raw
->segment_count_nat
) >> 1;
1657 nat_blocks
= nat_segs
<< le32_to_cpu(sb_raw
->log_blocks_per_seg
);
1658 nm_i
->max_nid
= NAT_ENTRY_PER_BLOCK
* nat_blocks
;
1662 INIT_LIST_HEAD(&nm_i
->free_nid_list
);
1663 INIT_RADIX_TREE(&nm_i
->nat_root
, GFP_ATOMIC
);
1664 INIT_LIST_HEAD(&nm_i
->nat_entries
);
1665 INIT_LIST_HEAD(&nm_i
->dirty_nat_entries
);
1667 mutex_init(&nm_i
->build_lock
);
1668 spin_lock_init(&nm_i
->free_nid_list_lock
);
1669 rwlock_init(&nm_i
->nat_tree_lock
);
1671 nm_i
->bitmap_size
= __bitmap_size(sbi
, NAT_BITMAP
);
1672 nm_i
->init_scan_nid
= le32_to_cpu(sbi
->ckpt
->next_free_nid
);
1673 nm_i
->next_scan_nid
= le32_to_cpu(sbi
->ckpt
->next_free_nid
);
1675 nm_i
->nat_bitmap
= kzalloc(nm_i
->bitmap_size
, GFP_KERNEL
);
1676 if (!nm_i
->nat_bitmap
)
1678 version_bitmap
= __bitmap_ptr(sbi
, NAT_BITMAP
);
1679 if (!version_bitmap
)
1682 /* copy version bitmap */
1683 memcpy(nm_i
->nat_bitmap
, version_bitmap
, nm_i
->bitmap_size
);
1687 int build_node_manager(struct f2fs_sb_info
*sbi
)
1691 sbi
->nm_info
= kzalloc(sizeof(struct f2fs_nm_info
), GFP_KERNEL
);
1695 err
= init_node_manager(sbi
);
1699 build_free_nids(sbi
);
1703 void destroy_node_manager(struct f2fs_sb_info
*sbi
)
1705 struct f2fs_nm_info
*nm_i
= NM_I(sbi
);
1706 struct free_nid
*i
, *next_i
;
1707 struct nat_entry
*natvec
[NATVEC_SIZE
];
1714 /* destroy free nid list */
1715 spin_lock(&nm_i
->free_nid_list_lock
);
1716 list_for_each_entry_safe(i
, next_i
, &nm_i
->free_nid_list
, list
) {
1717 BUG_ON(i
->state
== NID_ALLOC
);
1718 __del_from_free_nid_list(i
);
1722 spin_unlock(&nm_i
->free_nid_list_lock
);
1724 /* destroy nat cache */
1725 write_lock(&nm_i
->nat_tree_lock
);
1726 while ((found
= __gang_lookup_nat_cache(nm_i
,
1727 nid
, NATVEC_SIZE
, natvec
))) {
1729 for (idx
= 0; idx
< found
; idx
++) {
1730 struct nat_entry
*e
= natvec
[idx
];
1731 nid
= nat_get_nid(e
) + 1;
1732 __del_from_nat_cache(nm_i
, e
);
1735 BUG_ON(nm_i
->nat_cnt
);
1736 write_unlock(&nm_i
->nat_tree_lock
);
1738 kfree(nm_i
->nat_bitmap
);
1739 sbi
->nm_info
= NULL
;
1743 int create_node_manager_caches(void)
1745 nat_entry_slab
= f2fs_kmem_cache_create("nat_entry",
1746 sizeof(struct nat_entry
), NULL
);
1747 if (!nat_entry_slab
)
1750 free_nid_slab
= f2fs_kmem_cache_create("free_nid",
1751 sizeof(struct free_nid
), NULL
);
1752 if (!free_nid_slab
) {
1753 kmem_cache_destroy(nat_entry_slab
);
1759 void destroy_node_manager_caches(void)
1761 kmem_cache_destroy(free_nid_slab
);
1762 kmem_cache_destroy(nat_entry_slab
);