Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
X
xv6-public
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
统计图
问题
0
问题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
银宸时代
OS Lab Group
奖励实验
xv6-public
提交
2adb7c21
提交
2adb7c21
9月 11, 2016
创建
作者:
Frans Kaashoek
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Move retry loop/sleep/wakeup in bio.c into sleeping locks
上级
6670d3b5
显示空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
22 行增加
和
19 行删除
+22
-19
bio.c
bio.c
+21
-19
buf.h
buf.h
+1
-0
defs.h
defs.h
+0
-0
没有找到文件。
bio.c
浏览文件 @
2adb7c21
...
@@ -49,7 +49,6 @@ binit(void)
...
@@ -49,7 +49,6 @@ binit(void)
for
(
b
=
bcache
.
buf
;
b
<
bcache
.
buf
+
NBUF
;
b
++
){
for
(
b
=
bcache
.
buf
;
b
<
bcache
.
buf
+
NBUF
;
b
++
){
b
->
next
=
bcache
.
head
.
next
;
b
->
next
=
bcache
.
head
.
next
;
b
->
prev
=
&
bcache
.
head
;
b
->
prev
=
&
bcache
.
head
;
b
->
dev
=
-
1
;
initsleeplock
(
&
b
->
lock
,
"buffer"
);
initsleeplock
(
&
b
->
lock
,
"buffer"
);
bcache
.
head
.
next
->
prev
=
b
;
bcache
.
head
.
next
->
prev
=
b
;
bcache
.
head
.
next
=
b
;
bcache
.
head
.
next
=
b
;
...
@@ -66,33 +65,33 @@ bget(uint dev, uint blockno)
...
@@ -66,33 +65,33 @@ bget(uint dev, uint blockno)
acquire
(
&
bcache
.
lock
);
acquire
(
&
bcache
.
lock
);
//cprintf("bget %d\n", blockno);
//
cprintf("bget %d\n", blockno);
loop:
// Is the block already cached?
// Is the block already cached?
for
(
b
=
bcache
.
head
.
next
;
b
!=
&
bcache
.
head
;
b
=
b
->
next
){
for
(
b
=
bcache
.
head
.
next
;
b
!=
&
bcache
.
head
;
b
=
b
->
next
){
if
(
b
->
dev
==
dev
&&
b
->
blockno
==
blockno
){
if
(
b
->
dev
==
dev
&&
b
->
blockno
==
blockno
){
if
(
!
holdingsleep
(
&
b
->
lock
))
{
//cprintf("bget %d; get sleep lock for buffer %p\n", blockno, b - bcache.buf);
acquiresleep
(
&
b
->
lock
);
b
->
refcnt
++
;
//cprintf("return buffer %p for blk %d\n", b - bcache.buf, blockno);
release
(
&
bcache
.
lock
);
release
(
&
bcache
.
lock
);
acquiresleep
(
&
b
->
lock
);
//cprintf("bget: return buffer %p for blk %d\n", b - bcache.buf, blockno);
return
b
;
return
b
;
}
}
sleep
(
b
,
&
bcache
.
lock
);
goto
loop
;
}
}
}
// Not cached; recycle some
non-locked and clean buffer.
// Not cached; recycle some
unused buffer and clean buffer
// "clean" because B_DIRTY and not locked means log.c
// "clean" because B_DIRTY and not locked means log.c
// hasn't yet committed the changes to the buffer.
// hasn't yet committed the changes to the buffer.
for
(
b
=
bcache
.
head
.
prev
;
b
!=
&
bcache
.
head
;
b
=
b
->
prev
){
for
(
b
=
bcache
.
head
.
prev
;
b
!=
&
bcache
.
head
;
b
=
b
->
prev
){
if
(
!
holdingsleep
(
&
b
->
lock
)
&&
(
b
->
flags
&
B_DIRTY
)
==
0
){
if
(
b
->
refcnt
==
0
&&
(
b
->
flags
&
B_DIRTY
)
==
0
)
{
// cprintf("bget %d; use %p for %d\n", b - bcache.buf, blockno);
b
->
dev
=
dev
;
b
->
dev
=
dev
;
b
->
blockno
=
blockno
;
b
->
blockno
=
blockno
;
b
->
flags
=
0
;
// XXX
b
->
flags
=
0
;
acquiresleep
(
&
b
->
lock
);
b
->
refcnt
=
1
;
//cprintf("return buffer %p for blk %d\n", b - bcache.buf, blockno);
release
(
&
bcache
.
lock
);
release
(
&
bcache
.
lock
);
acquiresleep
(
&
b
->
lock
);
// cprintf("bget: return buffer %p for blk %d\n", b - bcache.buf, blockno);
return
b
;
return
b
;
}
}
}
}
...
@@ -116,7 +115,7 @@ bread(uint dev, uint blockno)
...
@@ -116,7 +115,7 @@ bread(uint dev, uint blockno)
void
void
bwrite
(
struct
buf
*
b
)
bwrite
(
struct
buf
*
b
)
{
{
if
(
b
->
lock
.
locked
==
0
)
if
(
!
holdingsleep
(
&
b
->
lock
)
)
panic
(
"bwrite"
);
panic
(
"bwrite"
);
b
->
flags
|=
B_DIRTY
;
b
->
flags
|=
B_DIRTY
;
iderw
(
b
);
iderw
(
b
);
...
@@ -127,19 +126,22 @@ bwrite(struct buf *b)
...
@@ -127,19 +126,22 @@ bwrite(struct buf *b)
void
void
brelse
(
struct
buf
*
b
)
brelse
(
struct
buf
*
b
)
{
{
if
(
b
->
lock
.
locked
==
0
)
if
(
!
holdingsleep
(
&
b
->
lock
)
)
panic
(
"brelse"
);
panic
(
"brelse"
);
acquire
(
&
bcache
.
lock
);
releasesleep
(
&
b
->
lock
);
acquire
(
&
bcache
.
lock
);
b
->
refcnt
--
;
if
(
b
->
refcnt
==
0
)
{
// no one is waiting for it.
b
->
next
->
prev
=
b
->
prev
;
b
->
next
->
prev
=
b
->
prev
;
b
->
prev
->
next
=
b
->
next
;
b
->
prev
->
next
=
b
->
next
;
b
->
next
=
bcache
.
head
.
next
;
b
->
next
=
bcache
.
head
.
next
;
b
->
prev
=
&
bcache
.
head
;
b
->
prev
=
&
bcache
.
head
;
bcache
.
head
.
next
->
prev
=
b
;
bcache
.
head
.
next
->
prev
=
b
;
bcache
.
head
.
next
=
b
;
bcache
.
head
.
next
=
b
;
releasesleep
(
&
b
->
lock
);
}
wakeup
(
b
);
release
(
&
bcache
.
lock
);
release
(
&
bcache
.
lock
);
}
}
...
...
buf.h
浏览文件 @
2adb7c21
...
@@ -3,6 +3,7 @@ struct buf {
...
@@ -3,6 +3,7 @@ struct buf {
uint
dev
;
uint
dev
;
uint
blockno
;
uint
blockno
;
struct
sleeplock
lock
;
struct
sleeplock
lock
;
uint
refcnt
;
struct
buf
*
prev
;
// LRU cache list
struct
buf
*
prev
;
// LRU cache list
struct
buf
*
next
;
struct
buf
*
next
;
struct
buf
*
qnext
;
// disk queue
struct
buf
*
qnext
;
// disk queue
...
...
defs.h
浏览文件 @
2adb7c21
编写
预览
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论