Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
Kernel
提交
d3e46fea
K
Kernel
项目概览
openeuler
/
Kernel
1 年多 前同步成功
通知
8
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
K
Kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
提交
d3e46fea
编写于
6月 15, 2014
作者:
D
David Sterba
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
btrfs: sink blocksize parameter to readahead_tree_block
All callers pass nodesize. Signed-off-by:
N
David Sterba
<
dsterba@suse.cz
>
上级
9627aeee
变更
5
隐藏空白更改
内联
并排
Showing
5 changed file
with
8 addition
and
11 deletion
+8
-11
fs/btrfs/ctree.c
fs/btrfs/ctree.c
+3
-5
fs/btrfs/disk-io.c
fs/btrfs/disk-io.c
+2
-2
fs/btrfs/disk-io.h
fs/btrfs/disk-io.h
+1
-1
fs/btrfs/extent-tree.c
fs/btrfs/extent-tree.c
+1
-1
fs/btrfs/relocation.c
fs/btrfs/relocation.c
+1
-2
未找到文件。
fs/btrfs/ctree.c
浏览文件 @
d3e46fea
...
...
@@ -2282,7 +2282,7 @@ static void reada_for_search(struct btrfs_root *root,
if
((
search
<=
target
&&
target
-
search
<=
65536
)
||
(
search
>
target
&&
search
-
target
<=
65536
))
{
gen
=
btrfs_node_ptr_generation
(
node
,
nr
);
readahead_tree_block
(
root
,
search
,
blocksize
);
readahead_tree_block
(
root
,
search
);
nread
+=
blocksize
;
}
nscan
++
;
...
...
@@ -2301,7 +2301,6 @@ static noinline void reada_for_balance(struct btrfs_root *root,
u64
gen
;
u64
block1
=
0
;
u64
block2
=
0
;
int
blocksize
;
parent
=
path
->
nodes
[
level
+
1
];
if
(
!
parent
)
...
...
@@ -2309,7 +2308,6 @@ static noinline void reada_for_balance(struct btrfs_root *root,
nritems
=
btrfs_header_nritems
(
parent
);
slot
=
path
->
slots
[
level
+
1
];
blocksize
=
root
->
nodesize
;
if
(
slot
>
0
)
{
block1
=
btrfs_node_blockptr
(
parent
,
slot
-
1
);
...
...
@@ -2334,9 +2332,9 @@ static noinline void reada_for_balance(struct btrfs_root *root,
}
if
(
block1
)
readahead_tree_block
(
root
,
block1
,
blocksize
);
readahead_tree_block
(
root
,
block1
);
if
(
block2
)
readahead_tree_block
(
root
,
block2
,
blocksize
);
readahead_tree_block
(
root
,
block2
);
}
...
...
fs/btrfs/disk-io.c
浏览文件 @
d3e46fea
...
...
@@ -1073,12 +1073,12 @@ static const struct address_space_operations btree_aops = {
.
set_page_dirty
=
btree_set_page_dirty
,
};
void
readahead_tree_block
(
struct
btrfs_root
*
root
,
u64
bytenr
,
u32
blocksize
)
void
readahead_tree_block
(
struct
btrfs_root
*
root
,
u64
bytenr
)
{
struct
extent_buffer
*
buf
=
NULL
;
struct
inode
*
btree_inode
=
root
->
fs_info
->
btree_inode
;
buf
=
btrfs_find_create_tree_block
(
root
,
bytenr
,
block
size
);
buf
=
btrfs_find_create_tree_block
(
root
,
bytenr
,
root
->
node
size
);
if
(
!
buf
)
return
;
read_extent_buffer_pages
(
&
BTRFS_I
(
btree_inode
)
->
io_tree
,
...
...
fs/btrfs/disk-io.h
浏览文件 @
d3e46fea
...
...
@@ -46,7 +46,7 @@ struct btrfs_fs_devices;
struct
extent_buffer
*
read_tree_block
(
struct
btrfs_root
*
root
,
u64
bytenr
,
u64
parent_transid
);
void
readahead_tree_block
(
struct
btrfs_root
*
root
,
u64
bytenr
,
u32
blocksize
);
void
readahead_tree_block
(
struct
btrfs_root
*
root
,
u64
bytenr
);
int
reada_tree_block_flagged
(
struct
btrfs_root
*
root
,
u64
bytenr
,
u32
blocksize
,
int
mirror_num
,
struct
extent_buffer
**
eb
);
struct
extent_buffer
*
btrfs_find_create_tree_block
(
struct
btrfs_root
*
root
,
...
...
fs/btrfs/extent-tree.c
浏览文件 @
d3e46fea
...
...
@@ -7485,7 +7485,7 @@ static noinline void reada_walk_down(struct btrfs_trans_handle *trans,
continue
;
}
reada:
readahead_tree_block
(
root
,
bytenr
,
blocksize
);
readahead_tree_block
(
root
,
bytenr
);
nread
++
;
}
wc
->
reada_slot
=
slot
;
...
...
fs/btrfs/relocation.c
浏览文件 @
d3e46fea
...
...
@@ -2965,8 +2965,7 @@ int relocate_tree_blocks(struct btrfs_trans_handle *trans,
while
(
rb_node
)
{
block
=
rb_entry
(
rb_node
,
struct
tree_block
,
rb_node
);
if
(
!
block
->
key_ready
)
readahead_tree_block
(
rc
->
extent_root
,
block
->
bytenr
,
block
->
key
.
objectid
);
readahead_tree_block
(
rc
->
extent_root
,
block
->
bytenr
);
rb_node
=
rb_next
(
rb_node
);
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录