linux.git/fs/f2fs/extent_cache.c, branch v4.6

f2fs: introduce f2fs_update_data_blkaddr for cleanup

2016-02-26T19:52:01+00:00

Add a new help f2fs_update_data_blkaddr to clean up redundant codes.

Signed-off-by: Chao Yu 
Signed-off-by: Jaegeuk Kim

f2fs: remove unneeded pointer conversion

2016-02-23T00:07:23+00:00

There are redundant pointer conversion in following call stack:
 - at position a, inode was been converted to f2fs_file_info.
 - at position b, f2fs_file_info was been converted to inode again.

 - truncate_blocks(inode,..)
  - fi = F2FS_I(inode)		---a
  - ADDRS_PER_PAGE(node_page, fi)
   - addrs_per_inode(fi)
    - inode = &fi->vfs_inode	---b
    - f2fs_has_inline_xattr(inode)
     - fi = F2FS_I(inode)
     - is_inode_flag_set(fi,..)

In order to avoid unneeded conversion, alter ADDRS_PER_PAGE and
addrs_per_inode to acept parameter with type of inode pointer.

Signed-off-by: Chao Yu 
Signed-off-by: Jaegeuk Kim

f2fs: give scheduling point in shrinking path

2016-02-23T00:07:23+00:00

It needs to give a chance to be rescheduled while shrinking slab entries.

Signed-off-by: Jaegeuk Kim

f2fs: improve shrink performance of extent nodes

2016-02-23T00:07:23+00:00

On the worst case, we need to scan the whole radix tree and every rb-tree to
free the victimed extent_nodes when shrinking.

Pengyang initially introduced a victim_list to record the victimed extent_nodes,
and free these extent_nodes by just scanning a list.

Later, Chao Yu enhances the original patch to improve memory footprint by
removing victim list.

The policy of lru list shrinking becomes:
1) lock lru list's lock
2) trylock extent tree's lock
3) remove extent node from lru list
4) unlock lru list's lock
5) do shrink
6) repeat 1) to 5)

Signed-off-by: Hou Pengyang 
Signed-off-by: Chao Yu 
Signed-off-by: Jaegeuk Kim

f2fs: don't set cached_en if it will be freed

2016-02-23T00:07:23+00:00

If en has empty list pointer, it will be freed sooner, so we don't need to
set cached_en with it.

Signed-off-by: Jaegeuk Kim

f2fs: move extent_node list operations being coupled with rbtree operation

2016-02-23T00:07:23+00:00

This patch moves extent_node list operations to be handled together with
its rbtree operations.

Signed-off-by: Jaegeuk Kim

f2fs: reconstruct the code to free an extent_node

2016-02-23T00:07:23+00:00

There are three steps to free an extent node:
1) list_del_init, 2)__detach_extent_node, 3) kmem_cache_free

In path f2fs_destroy_extent_tree, 1->2->3 to free a node,
But in path f2fs_update_extent_tree_range, it is 2->1->3.

This patch makes all the order to be: 1->2->3
It makes sense, since in the next patch, we import a victim list in the
path shrink_extent_tree, we could check if the extent_node is in the victim
list by checking the list_empty(). So it is necessary to put 1) first.

Signed-off-by: Hou Pengyang 
Signed-off-by: Jaegeuk Kim

f2fs: skip releasing nodes in chindless extent tree

2016-01-08T19:57:18+00:00

If there are no nodes in extent tree, let's skip releasing step to avoid
any overhead of grabbing/releasing extent tree lock.

Signed-off-by: Chao Yu 
Signed-off-by: Jaegeuk Kim

f2fs: use atomic type for node count in extent tree

2016-01-08T19:57:11+00:00

1. rename field in struct extent_tree from count to node_cnt for
   readability.
2. alter to use atomic type for node_cnt.

Signed-off-by: Chao Yu 
Signed-off-by: Jaegeuk Kim

f2fs: introduce zombie list for fast shrinking extent trees

2015-12-31T23:39:22+00:00

This patch removes refcount, and instead, adds zombie_list to shrink directly
without radix tree traverse.

Signed-off-by: Jaegeuk Kim