Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
cloud-kernel
提交
7d4e9ccb
cloud-kernel
项目概览
openanolis
/
cloud-kernel
大约 1 年 前同步成功
通知
158
Star
36
Fork
7
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
10
列表
看板
标记
里程碑
合并请求
2
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
cloud-kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
10
Issue
10
列表
看板
标记
里程碑
合并请求
2
合并请求
2
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
7d4e9ccb
编写于
3月 20, 2009
作者:
A
Artem Bityutskiy
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
UBIFS: fix commentaries
Signed-off-by:
N
Artem Bityutskiy
<
Artem.Bityutskiy@nokia.com
>
上级
fb1cd01a
变更
8
隐藏空白更改
内联
并排
Showing
8 changed file
with
9 addition
and
9 deletion
+9
-9
fs/ubifs/budget.c
fs/ubifs/budget.c
+2
-2
fs/ubifs/debug.c
fs/ubifs/debug.c
+1
-1
fs/ubifs/file.c
fs/ubifs/file.c
+1
-1
fs/ubifs/journal.c
fs/ubifs/journal.c
+1
-1
fs/ubifs/log.c
fs/ubifs/log.c
+1
-1
fs/ubifs/lpt_commit.c
fs/ubifs/lpt_commit.c
+1
-1
fs/ubifs/replay.c
fs/ubifs/replay.c
+1
-1
fs/ubifs/tnc.c
fs/ubifs/tnc.c
+1
-1
未找到文件。
fs/ubifs/budget.c
浏览文件 @
7d4e9ccb
...
@@ -322,8 +322,8 @@ static int can_use_rp(struct ubifs_info *c)
...
@@ -322,8 +322,8 @@ static int can_use_rp(struct ubifs_info *c)
* be large, because UBIFS does not do any index consolidation as long as
* be large, because UBIFS does not do any index consolidation as long as
* there is free space. IOW, the index may take a lot of LEBs, but the LEBs
* there is free space. IOW, the index may take a lot of LEBs, but the LEBs
* will contain a lot of dirt.
* will contain a lot of dirt.
* o @c->min_idx_lebs is the
the index presumably takes. IOW, the index may be
* o @c->min_idx_lebs is the
number of LEBS the index presumably takes. IOW,
* consolidated to take up to @c->min_idx_lebs LEBs.
*
the index may be
consolidated to take up to @c->min_idx_lebs LEBs.
*
*
* This function returns zero in case of success, and %-ENOSPC in case of
* This function returns zero in case of success, and %-ENOSPC in case of
* failure.
* failure.
...
...
fs/ubifs/debug.c
浏览文件 @
7d4e9ccb
...
@@ -1214,7 +1214,7 @@ static int dbg_check_znode(struct ubifs_info *c, struct ubifs_zbranch *zbr)
...
@@ -1214,7 +1214,7 @@ static int dbg_check_znode(struct ubifs_info *c, struct ubifs_zbranch *zbr)
/*
/*
* Make sure the last key in our znode is less or
* Make sure the last key in our znode is less or
* equivalent than the
the key in
zbranch which goes
* equivalent than the
key in the
zbranch which goes
* after our pointing zbranch.
* after our pointing zbranch.
*/
*/
cmp
=
keys_cmp
(
c
,
max
,
cmp
=
keys_cmp
(
c
,
max
,
...
...
fs/ubifs/file.c
浏览文件 @
7d4e9ccb
...
@@ -959,7 +959,7 @@ static int do_writepage(struct page *page, int len)
...
@@ -959,7 +959,7 @@ static int do_writepage(struct page *page, int len)
* whole index and correct all inode sizes, which is long an unacceptable.
* whole index and correct all inode sizes, which is long an unacceptable.
*
*
* To prevent situations like this, UBIFS writes pages back only if they are
* To prevent situations like this, UBIFS writes pages back only if they are
* within
last synchronized inode size, i.e. the
the size which has been
* within
the last synchronized inode size, i.e.
the size which has been
* written to the flash media last time. Otherwise, UBIFS forces inode
* written to the flash media last time. Otherwise, UBIFS forces inode
* write-back, thus making sure the on-flash inode contains current inode size,
* write-back, thus making sure the on-flash inode contains current inode size,
* and then keeps writing pages back.
* and then keeps writing pages back.
...
...
fs/ubifs/journal.c
浏览文件 @
7d4e9ccb
...
@@ -1365,7 +1365,7 @@ int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host,
...
@@ -1365,7 +1365,7 @@ int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host,
* @host: host inode
* @host: host inode
*
*
* This function writes the updated version of an extended attribute inode and
* This function writes the updated version of an extended attribute inode and
* the host inode t
h
o the journal (to the base head). The host inode is written
* the host inode to the journal (to the base head). The host inode is written
* after the extended attribute inode in order to guarantee that the extended
* after the extended attribute inode in order to guarantee that the extended
* attribute will be flushed when the inode is synchronized by 'fsync()' and
* attribute will be flushed when the inode is synchronized by 'fsync()' and
* consequently, the write-buffer is synchronized. This function returns zero
* consequently, the write-buffer is synchronized. This function returns zero
...
...
fs/ubifs/log.c
浏览文件 @
7d4e9ccb
...
@@ -239,7 +239,7 @@ int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs)
...
@@ -239,7 +239,7 @@ int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs)
}
}
/*
/*
* Make sure the
the amount of space in buds will not exceed
* Make sure the
amount of space in buds will not exceed the
* 'c->max_bud_bytes' limit, because we want to guarantee mount time
* 'c->max_bud_bytes' limit, because we want to guarantee mount time
* limits.
* limits.
*
*
...
...
fs/ubifs/lpt_commit.c
浏览文件 @
7d4e9ccb
/*
/*
* This file is part of UBIFS.
* This file is part of UBIFS.
*
*
* Copyright (C) 2006-2008 Nokia Corporation.
* Copyright (C) 2006-2008 Nokia Corporation.
...
...
fs/ubifs/replay.c
浏览文件 @
7d4e9ccb
...
@@ -143,7 +143,7 @@ static int set_bud_lprops(struct ubifs_info *c, struct replay_entry *r)
...
@@ -143,7 +143,7 @@ static int set_bud_lprops(struct ubifs_info *c, struct replay_entry *r)
dirty
-=
c
->
leb_size
-
lp
->
free
;
dirty
-=
c
->
leb_size
-
lp
->
free
;
/*
/*
* If the replay order was perfect the dirty space would now be
* If the replay order was perfect the dirty space would now be
* zero. The order is not perfect because the
the
journal heads
* zero. The order is not perfect because the journal heads
* race with each other. This is not a problem but is does mean
* race with each other. This is not a problem but is does mean
* that the dirty space may temporarily exceed c->leb_size
* that the dirty space may temporarily exceed c->leb_size
* during the replay.
* during the replay.
...
...
fs/ubifs/tnc.c
浏览文件 @
7d4e9ccb
...
@@ -1252,7 +1252,7 @@ int ubifs_lookup_level0(struct ubifs_info *c, const union ubifs_key *key,
...
@@ -1252,7 +1252,7 @@ int ubifs_lookup_level0(struct ubifs_info *c, const union ubifs_key *key,
* splitting in the middle of the colliding sequence. Also, when
* splitting in the middle of the colliding sequence. Also, when
* removing the leftmost key, we would have to correct the key of the
* removing the leftmost key, we would have to correct the key of the
* parent node, which would introduce additional complications. Namely,
* parent node, which would introduce additional complications. Namely,
* if we changed the
the
leftmost key of the parent znode, the garbage
* if we changed the leftmost key of the parent znode, the garbage
* collector would be unable to find it (GC is doing this when GC'ing
* collector would be unable to find it (GC is doing this when GC'ing
* indexing LEBs). Although we already have an additional RB-tree where
* indexing LEBs). Although we already have an additional RB-tree where
* we save such changed znodes (see 'ins_clr_old_idx_znode()') until
* we save such changed znodes (see 'ins_clr_old_idx_znode()') until
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录