Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
X
xv6-public
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
统计图
问题
0
问题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
银宸时代
OS Lab Group
奖励实验
xv6-public
提交
fc9785c7
提交
fc9785c7
2月 16, 2012
创建
作者:
Nickolai Zeldovich
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
c++ify
上级
1ba018f0
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
71 行增加
和
65 行删除
+71
-65
crange.cc
crange.cc
+5
-10
crange.hh
crange.hh
+8
-7
vm.cc
vm.cc
+53
-47
vm.hh
vm.hh
+5
-1
没有找到文件。
crange.cc
浏览文件 @
fc9785c7
...
...
@@ -99,19 +99,14 @@ range::~range()
kmfree
(
next
);
}
void
range
::
free_delayed
(
void
)
{
dprintf
(
"%d: free_delayed: 0x%lx 0x%lx-0x%lx(%lu) %lu
\n
"
,
myproc
()
->
pid
,
(
long
)
this
,
key
,
key
+
size
,
size
,
myproc
()
->
epoch
);
cr
->
check
(
this
);
assert
(
curlevel
==
-
1
);
gc_delayed
(
this
);
}
void
range
::
dec_ref
(
void
)
{
int
n
=
curlevel
--
;
if
(
n
==
0
)
{
// now removed from all levels.
free_delayed
();
dprintf
(
"%d: free_delayed: 0x%lx 0x%lx-0x%lx(%lu) %lu
\n
"
,
myproc
()
->
pid
,
(
long
)
this
,
key
,
key
+
size
,
size
,
myproc
()
->
epoch
);
cr
->
check
(
this
);
assert
(
curlevel
==
-
1
);
gc_delayed
(
this
);
}
}
...
...
@@ -283,7 +278,7 @@ crange::print(int full)
crange
::
crange
(
int
nl
)
{
assert
(
nl
>
=
0
);
assert
(
nl
>
0
);
nlevel
=
nl
;
crange_head
=
new
range
(
this
,
0
,
0
,
nullptr
,
nullptr
,
nlevel
);
dprintf
(
"crange::crange return 0x%lx
\n
"
,
(
u64
)
this
);
...
...
crange.hh
浏览文件 @
fc9785c7
...
...
@@ -92,13 +92,14 @@ struct range : public rcu_freed {
crange
*
cr
;
// the crange this range is part of
markptr
<
range
>*
next
;
// one next pointer per level
spinlock
*
lock
;
// on separate cache line?
range
(
crange
*
cr
,
u64
k
,
u64
sz
,
void
*
v
,
markptr
<
range
>
n
,
int
nlevel
=
0
);
~
range
();
virtual
void
do_gc
()
{
delete
this
;
}
void
print
(
int
l
);
void
free_delayed
();
void
dec_ref
(
void
);
int
lockif
(
markptr
<
range
>
e
);
}
__mpalign__
;
...
...
@@ -133,18 +134,18 @@ struct crange {
int
lock_range
(
u64
k
,
u64
sz
,
int
l
,
range
**
er
,
range
**
pr
,
range
**
fr
,
range
**
lr
,
range
**
sr
);
int
find_and_lock
(
u64
k
,
u64
sz
,
range
**
p0
,
range
**
f0
,
range
**
l0
,
range
**
s0
);
range_iterator
begin
()
{
return
range_iterator
(
crange_head
->
next
[
0
].
ptr
());
};
range_iterator
end
()
{
return
range_iterator
(
0
);
};
range_iterator
begin
()
const
{
return
range_iterator
(
crange_head
->
next
[
0
].
ptr
());
};
range_iterator
end
()
const
{
return
range_iterator
(
0
);
};
};
static
inline
range_iterator
begin
(
c
range
*
cr
)
begin
(
c
onst
crange
&
cr
)
{
return
cr
->
begin
();
return
cr
.
begin
();
}
static
inline
range_iterator
end
(
c
range
*
cr
)
end
(
c
onst
crange
&
cr
)
{
return
cr
->
end
();
return
cr
.
end
();
}
vm.cc
浏览文件 @
fc9785c7
...
...
@@ -16,8 +16,6 @@ extern "C" {
#include "gc.hh"
#include "crange.hh"
static
void
vmap_free
(
void
*
p
);
enum
{
vm_debug
=
0
};
static
void
...
...
@@ -86,38 +84,50 @@ void
vmap_decref
(
struct
vmap
*
m
)
{
if
(
--
m
->
ref
==
0
)
vmap_free
(
m
)
;
delete
m
;
}
struct
vmap
*
vmap_alloc
(
void
)
vmap
::
vmap
()
:
cr
(
10
)
{
s
truct
vmap
*
m
=
(
struct
vmap
*
)
kmalloc
(
sizeof
(
struct
vmap
)
);
i
f
(
m
==
0
)
return
0
;
memset
(
m
,
0
,
sizeof
(
struct
vmap
))
;
snprintf
(
m
->
lockname
,
sizeof
(
m
->
lockname
),
"vmap:%p"
,
m
)
;
initlock
(
&
m
->
lock
,
m
->
lockname
,
LOCKSTAT_VM
)
;
m
->
ref
=
1
;
m
->
pml4
=
setupkvm
();
if
(
m
->
pml4
==
0
)
{
s
nprintf
(
lockname
,
sizeof
(
lockname
),
"vmap:%p"
,
this
);
i
nitlock
(
&
lock
,
lockname
,
LOCKSTAT_VM
);
ref
=
1
;
alloc
=
0
;
kshared
=
0
;
pml4
=
setupkvm
();
if
(
pml4
==
0
)
{
cprintf
(
"vmap_alloc: setupkvm out of memory
\n
"
);
destroylock
(
&
m
->
lock
);
kmfree
(
m
);
return
0
;
goto
err0
;
}
m
->
kshared
=
(
char
*
)
ksalloc
(
slab_kshared
);
if
(
m
->
kshared
==
NULL
||
setupkshared
(
m
->
pml4
,
m
->
kshared
))
{
cprintf
(
"vmap_alloc: kshared out of memory
\n
"
);
freevm
(
m
->
pml4
);
destroylock
(
&
m
->
lock
);
kmfree
(
m
);
return
0
;
kshared
=
(
char
*
)
ksalloc
(
slab_kshared
);
if
(
kshared
==
NULL
)
{
cprintf
(
"vmap::vmap: kshared out of memory
\n
"
);
goto
err1
;
}
m
->
cr
=
new
crange
(
10
);
if
(
m
->
cr
==
0
)
return
0
;
return
m
;
if
(
setupkshared
(
pml4
,
kshared
))
{
cprintf
(
"vmap::vmap: setupkshared out of memory
\n
"
);
goto
err2
;
}
return
;
err2
:
ksfree
(
slab_kshared
,
kshared
);
err1
:
freevm
(
pml4
);
err0
:
destroylock
(
&
lock
);
}
vmap
*
vmap_alloc
()
{
return
new
vmap
();
}
static
int
...
...
@@ -304,23 +314,19 @@ vmn_alloc(u64 npg, enum vmntype type)
return
n
;
}
static
void
vmap_free
(
void
*
p
)
vmap
::~
vmap
()
{
struct
vmap
*
m
=
(
struct
vmap
*
)
p
;
for
(
range
*
r
:
m
->
cr
)
{
for
(
range
*
r
:
cr
)
{
delete
(
vma
*
)
r
->
value
;
r
->
cr
->
del
(
r
->
key
,
r
->
size
);
cr
.
del
(
r
->
key
,
r
->
size
);
}
delete
m
->
cr
;
ksfree
(
slab_kshared
,
m
->
kshared
);
freevm
(
m
->
pml4
);
m
->
pml4
=
0
;
m
->
alloc
=
0
;
destroylock
(
&
m
->
lock
);
kmfree
(
m
);
if
(
kshared
)
ksfree
(
slab_kshared
,
kshared
);
if
(
pml4
)
freevm
(
pml4
);
alloc
=
0
;
destroylock
(
&
lock
);
}
// Does any vma overlap start..start+len?
...
...
@@ -335,7 +341,7 @@ vmap_lookup(struct vmap *m, uptr start, uptr len)
if
(
start
+
len
<
start
)
panic
(
"vmap_lookup bad len"
);
range
*
r
=
m
->
cr
->
search
(
start
,
len
);
range
*
r
=
m
->
cr
.
search
(
start
,
len
);
if
(
r
!=
0
)
{
struct
vma
*
e
=
(
struct
vma
*
)
(
r
->
value
);
if
(
e
->
va_end
<=
e
->
va_start
)
...
...
@@ -369,7 +375,7 @@ vmap_insert(struct vmap *m, struct vmnode *n, uptr va_start)
e
->
va_end
=
va_start
+
len
;
e
->
n
=
n
;
n
->
ref
++
;
m
->
cr
->
add
(
e
->
va_start
,
len
,
(
void
*
)
e
);
m
->
cr
.
add
(
e
->
va_start
,
len
,
(
void
*
)
e
);
release
(
&
m
->
lock
);
return
0
;
}
...
...
@@ -406,7 +412,7 @@ vmap_copy(struct vmap *m, int share)
goto
err
;
ne
->
n
->
ref
++
;
nm
->
cr
->
add
(
ne
->
va_start
,
ne
->
va_end
-
ne
->
va_start
,
(
void
*
)
ne
);
nm
->
cr
.
add
(
ne
->
va_start
,
ne
->
va_end
-
ne
->
va_start
,
(
void
*
)
ne
);
}
if
(
share
)
...
...
@@ -416,7 +422,7 @@ vmap_copy(struct vmap *m, int share)
return
nm
;
err
:
vmap_free
(
nm
)
;
delete
nm
;
release
(
&
m
->
lock
);
return
0
;
}
...
...
@@ -426,7 +432,7 @@ vmap_remove(struct vmap *m, uptr va_start, u64 len)
{
acquire
(
&
m
->
lock
);
uptr
va_end
=
va_start
+
len
;
struct
range
*
r
=
m
->
cr
->
search
(
va_start
,
len
);
struct
range
*
r
=
m
->
cr
.
search
(
va_start
,
len
);
if
(
r
==
0
)
panic
(
"no vma?"
);
struct
vma
*
e
=
(
struct
vma
*
)
r
->
value
;
...
...
@@ -435,7 +441,7 @@ vmap_remove(struct vmap *m, uptr va_start, u64 len)
release
(
&
m
->
lock
);
return
-
1
;
}
m
->
cr
->
del
(
va_start
,
len
);
m
->
cr
.
del
(
va_start
,
len
);
gc_delayed
(
e
);
release
(
&
m
->
lock
);
return
0
;
...
...
vm.hh
浏览文件 @
fc9785c7
#include "gc.hh"
#include "atomic.hh"
#include "crange.hh"
using
std
::
atomic
;
...
...
@@ -38,11 +39,14 @@ struct vmnode {
// An address space: a set of vmas plus h/w page table.
// The elements of e[] are not ordered by address.
struct
vmap
{
struct
crange
*
cr
;
struct
crange
cr
;
struct
spinlock
lock
;
// serialize map/lookup/unmap
atomic
<
u64
>
ref
;
u64
alloc
;
pml4e_t
*
pml4
;
// Page table
char
*
kshared
;
char
lockname
[
16
];
vmap
();
~
vmap
();
};
编写
预览
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论