Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
kernel_linux
提交
3a13252c
K
kernel_linux
项目概览
OpenHarmony
/
kernel_linux
上一次同步 3 年多
通知
13
Star
8
Fork
2
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
K
kernel_linux
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
提交
3a13252c
编写于
7月 30, 2008
作者:
A
Adrian Hunter
提交者:
Artem Bityutskiy
8月 13, 2008
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
UBIFS: correct spelling of "thrice".
Signed-off-by:
N
Adrian Hunter
<
ext-adrian.hunter@nokia.com
>
上级
22bc7fa8
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
3 addition
and
3 deletion
+3
-3
fs/ubifs/budget.c
fs/ubifs/budget.c
+2
-2
fs/ubifs/find.c
fs/ubifs/find.c
+1
-1
未找到文件。
fs/ubifs/budget.c
浏览文件 @
3a13252c
...
...
@@ -263,7 +263,7 @@ int ubifs_calc_min_idx_lebs(struct ubifs_info *c)
idx_size
=
c
->
old_idx_sz
+
c
->
budg_idx_growth
+
c
->
budg_uncommitted_idx
;
/* And make sure we have trice the index size of space reserved */
/* And make sure we have t
h
rice the index size of space reserved */
idx_size
=
idx_size
+
(
idx_size
<<
1
);
/*
...
...
@@ -388,7 +388,7 @@ static int can_use_rp(struct ubifs_info *c)
* This function makes sure UBIFS has enough free eraseblocks for index growth
* and data.
*
* When budgeting index space, UBIFS reserves t
rice as more
LEBs as the index
* When budgeting index space, UBIFS reserves t
hrice as many
LEBs as the index
* would take if it was consolidated and written to the flash. This guarantees
* that the "in-the-gaps" commit method always succeeds and UBIFS will always
* be able to commit dirty index. So this function basically adds amount of
...
...
fs/ubifs/find.c
浏览文件 @
3a13252c
...
...
@@ -290,7 +290,7 @@ int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp,
idx_lp
=
idx_heap
->
arr
[
0
];
sum
=
idx_lp
->
free
+
idx_lp
->
dirty
;
/*
* Since we reserve t
rice as more
space for the index than it
* Since we reserve t
hrice as much
space for the index than it
* actually takes, it does not make sense to pick indexing LEBs
* with less than, say, half LEB of dirty space. May be half is
* not the optimal boundary - this should be tested and
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录