Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
Kernel
提交
143823cf
K
Kernel
项目概览
openeuler
/
Kernel
大约 2 年 前同步成功
通知
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看板
提交
143823cf
编写于
5月 25, 2022
作者:
D
David Sterba
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
btrfs: fix typos in comments
Codespell has found a few typos. Signed-off-by:
N
David Sterba
<
dsterba@suse.com
>
上级
e0dccc3b
变更
10
隐藏空白更改
内联
并排
Showing
10 changed file
with
11 addition
and
11 deletion
+11
-11
fs/btrfs/ctree.h
fs/btrfs/ctree.h
+1
-1
fs/btrfs/disk-io.c
fs/btrfs/disk-io.c
+1
-1
fs/btrfs/inode.c
fs/btrfs/inode.c
+1
-1
fs/btrfs/ordered-data.c
fs/btrfs/ordered-data.c
+2
-2
fs/btrfs/raid56.c
fs/btrfs/raid56.c
+1
-1
fs/btrfs/space-info.c
fs/btrfs/space-info.c
+1
-1
fs/btrfs/subpage.c
fs/btrfs/subpage.c
+1
-1
fs/btrfs/super.c
fs/btrfs/super.c
+1
-1
fs/btrfs/sysfs.c
fs/btrfs/sysfs.c
+1
-1
fs/btrfs/tree-log.c
fs/btrfs/tree-log.c
+1
-1
未找到文件。
fs/btrfs/ctree.h
浏览文件 @
143823cf
...
...
@@ -2734,7 +2734,7 @@ int btrfs_get_extent_inline_ref_type(const struct extent_buffer *eb,
u64
hash_extent_data_ref
(
u64
root_objectid
,
u64
owner
,
u64
offset
);
/*
* Take the number of bytes to be checksumm
m
ed and figure out how many leaves
* Take the number of bytes to be checksummed and figure out how many leaves
* it would require to store the csums for that many bytes.
*/
static
inline
u64
btrfs_csum_bytes_to_leaves
(
...
...
fs/btrfs/disk-io.c
浏览文件 @
143823cf
...
...
@@ -1872,7 +1872,7 @@ static struct btrfs_root *btrfs_get_root_ref(struct btrfs_fs_info *fs_info,
fail:
/*
* If our caller provided us an anonymous device, then it's his
* respons
a
bility to free it in case we fail. So we have to set our
* respons
i
bility to free it in case we fail. So we have to set our
* root's anon_dev to 0 to avoid a double free, once by btrfs_put_root()
* and once again by our caller.
*/
...
...
fs/btrfs/inode.c
浏览文件 @
143823cf
...
...
@@ -4228,7 +4228,7 @@ static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
/*
* If we are in a rename context, we don't need to update anything in the
* log. That will be done later during the rename by btrfs_log_new_name().
* Besides that, doing it here would only cause extra unncessary btree
* Besides that, doing it here would only cause extra unn
e
cessary btree
* operations on the log tree, increasing latency for applications.
*/
if
(
!
rename_ctx
)
{
...
...
fs/btrfs/ordered-data.c
浏览文件 @
143823cf
...
...
@@ -275,7 +275,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry,
/*
* Mark all ordered extents io inside the specified range finished.
*
* @page: The invo
vled page for the opear
tion.
* @page: The invo
lved page for the opera
tion.
* For uncompressed buffered IO, the page status also needs to be
* updated to indicate whether the pending ordered io is finished.
* Can be NULL for direct IO and compressed write.
...
...
@@ -285,7 +285,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry,
* extent are finished.
*
* This function is called for endio, thus the range must have ordered
* extent(s) coveri it.
* extent(s) coveri
ng
it.
*/
void
btrfs_mark_ordered_io_finished
(
struct
btrfs_inode
*
inode
,
struct
page
*
page
,
u64
file_offset
,
...
...
fs/btrfs/raid56.c
浏览文件 @
143823cf
...
...
@@ -132,7 +132,7 @@ struct btrfs_raid_bio {
/* Number of data stripes (no p/q) */
u8
nr_data
;
/* Numer of all stripes (including P/Q) */
/* Num
b
er of all stripes (including P/Q) */
u8
real_stripes
;
/* How many pages there are for each stripe */
...
...
fs/btrfs/space-info.c
浏览文件 @
143823cf
...
...
@@ -1280,7 +1280,7 @@ static void priority_reclaim_metadata_space(struct btrfs_fs_info *fs_info,
to_reclaim
=
btrfs_calc_reclaim_metadata_size
(
fs_info
,
space_info
);
/*
* This is the priority reclaim path, so to_reclaim could be >0 still
* because we may have only satis
i
fied the priority tickets and still
* because we may have only satisfied the priority tickets and still
* left non priority tickets on the list. We would then have
* to_reclaim but ->bytes == 0.
*/
...
...
fs/btrfs/subpage.c
浏览文件 @
143823cf
...
...
@@ -123,7 +123,7 @@ int btrfs_attach_subpage(const struct btrfs_fs_info *fs_info,
struct
btrfs_subpage
*
subpage
;
/*
* We have cases like a dummy extent buffer page, which is not mapp
p
ed
* We have cases like a dummy extent buffer page, which is not mapped
* and doesn't need to be locked.
*/
if
(
page
->
mapping
)
...
...
fs/btrfs/super.c
浏览文件 @
143823cf
...
...
@@ -72,7 +72,7 @@ static int btrfs_remount(struct super_block *sb, int *flags, char *data);
#define STATE_STRING_BUF_LEN (sizeof(STATE_STRING_PREFACE) + BTRFS_FS_STATE_COUNT)
/*
* Characters to print to indicate error conditions or uncommon filesystem sate.
* Characters to print to indicate error conditions or uncommon filesystem s
t
ate.
* RO is not an error.
*/
static
const
char
fs_state_chars
[]
=
{
...
...
fs/btrfs/sysfs.c
浏览文件 @
143823cf
...
...
@@ -296,7 +296,7 @@ BTRFS_FEAT_ATTR_COMPAT_RO(verity, VERITY);
/*
* Features which depend on feature bits and may differ between each fs.
*
* /sys/fs/btrfs/features - all available features implemeted by this version
* /sys/fs/btrfs/features - all available features impleme
n
ted by this version
* /sys/fs/btrfs/UUID/features - features of the fs which are enabled or
* can be changed on a mounted filesystem.
*/
...
...
fs/btrfs/tree-log.c
浏览文件 @
143823cf
...
...
@@ -2287,7 +2287,7 @@ static noinline int check_item_in_log(struct btrfs_trans_handle *trans,
struct
btrfs_key
location
;
/*
* Currenly we only log dir index keys. Even if we replay a log created
* Curren
t
ly we only log dir index keys. Even if we replay a log created
* by an older kernel that logged both dir index and dir item keys, all
* we need to do is process the dir index keys, we (and our caller) can
* safely ignore dir item keys (key type BTRFS_DIR_ITEM_KEY).
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录