Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
raspberrypi-kernel
提交
3572324a
R
raspberrypi-kernel
项目概览
openeuler
/
raspberrypi-kernel
通知
13
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
raspberrypi-kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
3572324a
编写于
1月 10, 2014
作者:
K
Kent Overstreet
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
bcache: Minor fixes from kbuild robot
Signed-off-by:
N
Kent Overstreet
<
kmo@daterainc.com
>
上级
94717447
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
8 addition
and
5 deletion
+8
-5
drivers/md/bcache/bset.c
drivers/md/bcache/bset.c
+5
-2
drivers/md/bcache/btree.c
drivers/md/bcache/btree.c
+1
-1
drivers/md/bcache/extents.c
drivers/md/bcache/extents.c
+1
-1
drivers/md/bcache/sysfs.c
drivers/md/bcache/sysfs.c
+1
-1
未找到文件。
drivers/md/bcache/bset.c
浏览文件 @
3572324a
...
...
@@ -23,7 +23,7 @@ void bch_dump_bset(struct btree_keys *b, struct bset *i, unsigned set)
for
(
k
=
i
->
start
;
k
<
bset_bkey_last
(
i
);
k
=
next
)
{
next
=
bkey_next
(
k
);
printk
(
KERN_ERR
"block %u key %
z
i/%u: "
,
set
,
printk
(
KERN_ERR
"block %u key %
l
i/%u: "
,
set
,
(
uint64_t
*
)
k
-
i
->
d
,
i
->
keys
);
if
(
b
->
ops
->
key_dump
)
...
...
@@ -1185,9 +1185,12 @@ static void __btree_sort(struct btree_keys *b, struct btree_iter *iter,
struct
bset
*
out
=
(
void
*
)
__get_free_pages
(
__GFP_NOWARN
|
GFP_NOIO
,
order
);
if
(
!
out
)
{
struct
page
*
outp
;
BUG_ON
(
order
>
state
->
page_order
);
out
=
page_address
(
mempool_alloc
(
state
->
pool
,
GFP_NOIO
));
outp
=
mempool_alloc
(
state
->
pool
,
GFP_NOIO
);
out
=
page_address
(
outp
);
used_mempool
=
true
;
order
=
state
->
page_order
;
}
...
...
drivers/md/bcache/btree.c
浏览文件 @
3572324a
...
...
@@ -1805,7 +1805,7 @@ static bool btree_insert_key(struct btree *b, struct bkey *k,
static
size_t
insert_u64s_remaining
(
struct
btree
*
b
)
{
ssize_t
ret
=
bch_btree_keys_u64s_remaining
(
&
b
->
keys
);
long
ret
=
bch_btree_keys_u64s_remaining
(
&
b
->
keys
);
/*
* Might land in the middle of an existing extent and have to split it
...
...
drivers/md/bcache/extents.c
浏览文件 @
3572324a
...
...
@@ -194,7 +194,7 @@ static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k)
mutex_unlock
(
&
b
->
c
->
bucket_lock
);
bch_extent_to_text
(
buf
,
sizeof
(
buf
),
k
);
btree_bug
(
b
,
"inconsistent btree pointer %s: bucket %
l
i pin %i prio %i gen %i last_gc %i mark %llu gc_gen %i"
,
"inconsistent btree pointer %s: bucket %
z
i pin %i prio %i gen %i last_gc %i mark %llu gc_gen %i"
,
buf
,
PTR_BUCKET_NR
(
b
->
c
,
k
,
i
),
atomic_read
(
&
g
->
pin
),
g
->
prio
,
g
->
gen
,
g
->
last_gc
,
GC_MARK
(
g
),
g
->
gc_gen
);
return
true
;
...
...
drivers/md/bcache/sysfs.c
浏览文件 @
3572324a
...
...
@@ -416,7 +416,7 @@ static int btree_bset_stats(struct btree_op *b_op, struct btree *b)
return
MAP_CONTINUE
;
}
int
bch_bset_print_stats
(
struct
cache_set
*
c
,
char
*
buf
)
static
int
bch_bset_print_stats
(
struct
cache_set
*
c
,
char
*
buf
)
{
struct
bset_stats_op
op
;
int
ret
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录