Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xiphi1978
linux
提交
d548ee51
L
linux
项目概览
xiphi1978
/
linux
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
L
linux
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
d548ee51
编写于
1月 03, 2008
作者:
Y
Yan
提交者:
Chris Mason
9月 25, 2008
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Btrfs: Add a helper that finds previous extent item
Signed-off-by:
N
Chris Mason
<
chris.mason@oracle.com
>
上级
5b92ee72
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
36 addition
and
44 deletion
+36
-44
fs/btrfs/extent-tree.c
fs/btrfs/extent-tree.c
+36
-44
未找到文件。
fs/btrfs/extent-tree.c
浏览文件 @
d548ee51
...
...
@@ -33,6 +33,28 @@ static int finish_current_insert(struct btrfs_trans_handle *trans, struct
btrfs_root
*
extent_root
);
static
int
del_pending_extents
(
struct
btrfs_trans_handle
*
trans
,
struct
btrfs_root
*
extent_root
);
static
int
find_previous_extent
(
struct
btrfs_root
*
root
,
struct
btrfs_path
*
path
)
{
struct
btrfs_key
found_key
;
struct
extent_buffer
*
leaf
;
int
ret
;
while
(
1
)
{
if
(
path
->
slots
[
0
]
==
0
)
{
ret
=
btrfs_prev_leaf
(
root
,
path
);
if
(
ret
!=
0
)
return
ret
;
}
else
{
path
->
slots
[
0
]
--
;
}
leaf
=
path
->
nodes
[
0
];
btrfs_item_key_to_cpu
(
leaf
,
&
found_key
,
path
->
slots
[
0
]);
if
(
found_key
.
type
==
BTRFS_EXTENT_ITEM_KEY
)
return
0
;
}
return
1
;
}
static
int
cache_block_group
(
struct
btrfs_root
*
root
,
struct
btrfs_block_group_cache
*
block_group
)
...
...
@@ -65,16 +87,19 @@ static int cache_block_group(struct btrfs_root *root,
first_free
=
block_group
->
key
.
objectid
;
key
.
objectid
=
block_group
->
key
.
objectid
;
key
.
offset
=
0
;
btrfs_set_key_type
(
&
key
,
BTRFS_EXTENT_ITEM_KEY
);
ret
=
btrfs_search_slot
(
NULL
,
root
,
&
key
,
path
,
0
,
0
);
if
(
ret
<
0
)
return
ret
;
if
(
ret
&&
path
->
slots
[
0
]
>
0
)
path
->
slots
[
0
]
--
;
ret
=
find_previous_extent
(
root
,
path
);
if
(
ret
<
0
)
return
ret
;
if
(
ret
==
0
)
{
leaf
=
path
->
nodes
[
0
];
btrfs_item_key_to_cpu
(
leaf
,
&
key
,
path
->
slots
[
0
]);
if
(
key
.
objectid
+
key
.
offset
>
first_free
)
first_free
=
key
.
objectid
+
key
.
offset
;
}
while
(
1
)
{
leaf
=
path
->
nodes
[
0
];
slot
=
path
->
slots
[
0
];
...
...
@@ -88,15 +113,10 @@ static int cache_block_group(struct btrfs_root *root,
break
;
}
}
btrfs_item_key_to_cpu
(
leaf
,
&
key
,
slot
);
if
(
key
.
objectid
<
block_group
->
key
.
objectid
)
{
if
(
btrfs_key_type
(
&
key
)
!=
BTRFS_EXTENT_REF_KEY
&&
key
.
objectid
+
key
.
offset
>
first_free
)
first_free
=
key
.
objectid
+
key
.
offset
;
goto
next
;
}
if
(
key
.
objectid
>=
block_group
->
key
.
objectid
+
block_group
->
key
.
offset
)
{
break
;
...
...
@@ -162,11 +182,9 @@ struct btrfs_block_group_cache *btrfs_lookup_block_group(struct
return
block_group
;
return
NULL
;
}
static
u64
noinline
find_search_start
(
struct
btrfs_root
*
root
,
struct
btrfs_block_group_cache
**
cache_ret
,
u64
search_start
,
int
num
,
int
data
,
int
full_scan
)
u64
search_start
,
int
num
,
int
data
)
{
int
ret
;
struct
btrfs_block_group_cache
*
cache
=
*
cache_ret
;
...
...
@@ -771,9 +789,7 @@ u32 btrfs_count_snapshots_in_path(struct btrfs_root *root,
out:
btrfs_free_path
(
path
);
return
total_count
;
}
int
btrfs_inc_root_ref
(
struct
btrfs_trans_handle
*
trans
,
struct
btrfs_root
*
root
,
u64
owner_objectid
)
{
...
...
@@ -1422,7 +1438,7 @@ static int noinline find_free_extent(struct btrfs_trans_handle *trans,
orig_search_start
);
}
search_start
=
find_search_start
(
root
,
&
block_group
,
search_start
,
total_needed
,
data
,
full_scan
);
total_needed
,
data
);
search_start
=
stripe_align
(
root
,
search_start
);
cached_start
=
search_start
;
btrfs_init_path
(
path
);
...
...
@@ -1434,35 +1450,11 @@ static int noinline find_free_extent(struct btrfs_trans_handle *trans,
ret
=
btrfs_search_slot
(
trans
,
root
,
ins
,
path
,
0
,
0
);
if
(
ret
<
0
)
goto
error
;
if
(
path
->
slots
[
0
]
>
0
)
{
path
->
slots
[
0
]
--
;
}
ret
=
find_previous_extent
(
root
,
path
);
if
(
ret
<
0
)
goto
error
;
l
=
path
->
nodes
[
0
];
btrfs_item_key_to_cpu
(
l
,
&
key
,
path
->
slots
[
0
]);
/*
* walk backwards to find the first extent item key
*/
while
(
btrfs_key_type
(
&
key
)
!=
BTRFS_EXTENT_ITEM_KEY
)
{
if
(
path
->
slots
[
0
]
==
0
)
{
ret
=
btrfs_prev_leaf
(
root
,
path
);
if
(
ret
!=
0
)
{
ret
=
btrfs_search_slot
(
trans
,
root
,
ins
,
path
,
0
,
0
);
if
(
ret
<
0
)
goto
error
;
if
(
path
->
slots
[
0
]
>
0
)
path
->
slots
[
0
]
--
;
break
;
}
}
else
{
path
->
slots
[
0
]
--
;
}
l
=
path
->
nodes
[
0
];
btrfs_item_key_to_cpu
(
l
,
&
key
,
path
->
slots
[
0
]);
}
while
(
1
)
{
l
=
path
->
nodes
[
0
];
slot
=
path
->
slots
[
0
];
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录