Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
X
xv6-public
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
统计图
问题
0
问题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
银宸时代
OS Lab Group
奖励实验
xv6-public
提交
20365348
提交
20365348
8月 24, 2007
创建
作者:
rtm
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add missing iput() at end of _namei()
上级
b5551379
显示空白字符变更
内嵌
并排
正在显示
7 个修改的文件
包含
110 行增加
和
17 行删除
+110
-17
bootmain.c
bootmain.c
+1
-1
fs.c
fs.c
+6
-4
mkfs.c
mkfs.c
+2
-2
param.h
param.h
+1
-1
proc.h
proc.h
+4
-8
runoff
runoff
+1
-1
usertests.c
usertests.c
+95
-0
没有找到文件。
bootmain.c
浏览文件 @
20365348
...
@@ -12,7 +12,7 @@
...
@@ -12,7 +12,7 @@
// BOOT UP STEPS
// BOOT UP STEPS
// * when the CPU boots it loads the BIOS into memory and executes it
// * when the CPU boots it loads the BIOS into memory and executes it
//
//
// * the BIOS intializes devices, sets
of
the interrupt routines, and
// * the BIOS intializes devices, sets
up
the interrupt routines, and
// reads the first sector of the boot device(e.g., hard-drive)
// reads the first sector of the boot device(e.g., hard-drive)
// into memory and jumps to it.
// into memory and jumps to it.
//
//
...
...
fs.c
浏览文件 @
20365348
...
@@ -475,6 +475,7 @@ namecmp(const char *s, const char *t)
...
@@ -475,6 +475,7 @@ namecmp(const char *s, const char *t)
// Look for a directory entry in a directory.
// Look for a directory entry in a directory.
// If found, set *poff to byte offset of entry.
// If found, set *poff to byte offset of entry.
// Caller must have already locked dp.
struct
uinode
*
struct
uinode
*
dirlookup
(
struct
inode
*
dp
,
char
*
name
,
uint
*
poff
)
dirlookup
(
struct
inode
*
dp
,
char
*
name
,
uint
*
poff
)
{
{
...
@@ -483,7 +484,7 @@ dirlookup(struct inode *dp, char *name, uint *poff)
...
@@ -483,7 +484,7 @@ dirlookup(struct inode *dp, char *name, uint *poff)
struct
dirent
*
de
;
struct
dirent
*
de
;
if
(
dp
->
type
!=
T_DIR
)
if
(
dp
->
type
!=
T_DIR
)
return
0
;
panic
(
"dirlookup not DIR"
)
;
for
(
off
=
0
;
off
<
dp
->
size
;
off
+=
BSIZE
){
for
(
off
=
0
;
off
<
dp
->
size
;
off
+=
BSIZE
){
bp
=
bread
(
dp
->
dev
,
bmap
(
dp
,
off
/
BSIZE
,
0
));
bp
=
bread
(
dp
->
dev
,
bmap
(
dp
,
off
/
BSIZE
,
0
));
...
@@ -558,7 +559,7 @@ dirlink(struct inode *dp, char *name, uint ino)
...
@@ -558,7 +559,7 @@ dirlink(struct inode *dp, char *name, uint ino)
//
//
// Examples:
// Examples:
// skipelem("a/bb/c", name) = "bb/c", setting name = "a"
// skipelem("a/bb/c", name) = "bb/c", setting name = "a"
// skipelem("///a/bb", name) = "b", setting name="a"
// skipelem("///a/bb", name) = "b
b
", setting name="a"
// skipelem("", name) = skipelem("////", name) = 0
// skipelem("", name) = skipelem("////", name) = 0
//
//
static
char
*
static
char
*
...
@@ -617,14 +618,15 @@ _namei(char *path, int parent, char *name)
...
@@ -617,14 +618,15 @@ _namei(char *path, int parent, char *name)
if
((
ipu
=
dirlookup
(
dp
,
name
,
&
off
))
==
0
){
if
((
ipu
=
dirlookup
(
dp
,
name
,
&
off
))
==
0
){
iput
(
iunlock
(
dp
));
iput
(
iunlock
(
dp
));
iput
(
ipu
);
return
0
;
return
0
;
}
}
iput
(
iunlock
(
dp
));
iput
(
iunlock
(
dp
));
dpu
=
ipu
;
dpu
=
ipu
;
}
}
if
(
parent
)
if
(
parent
){
iput
(
dpu
);
return
0
;
return
0
;
}
return
dpu
;
return
dpu
;
}
}
...
...
mkfs.c
浏览文件 @
20365348
...
@@ -8,8 +8,8 @@
...
@@ -8,8 +8,8 @@
#include "param.h"
#include "param.h"
#include "fs.h"
#include "fs.h"
int
nblocks
=
1008
;
int
nblocks
=
995
;
int
ninodes
=
1
00
;
int
ninodes
=
2
00
;
int
size
=
1024
;
int
size
=
1024
;
int
fsfd
;
int
fsfd
;
...
...
param.h
浏览文件 @
20365348
...
@@ -6,6 +6,6 @@
...
@@ -6,6 +6,6 @@
#define NFILE 100 // open files per system
#define NFILE 100 // open files per system
#define NBUF 10 // size of disk block cache
#define NBUF 10 // size of disk block cache
#define NREQUEST NBUF // outstanding disk requests
#define NREQUEST NBUF // outstanding disk requests
#define NINODE
10
0 // maximum number of active i-nodes
#define NINODE
5
0 // maximum number of active i-nodes
#define NDEV 10 // maximum major device number
#define NDEV 10 // maximum major device number
#define ROOTDEV 1 // device number of file system root disk
#define ROOTDEV 1 // device number of file system root disk
proc.h
浏览文件 @
20365348
...
@@ -43,19 +43,15 @@ struct proc {
...
@@ -43,19 +43,15 @@ struct proc {
char
name
[
16
];
// Process name (debugging)
char
name
[
16
];
// Process name (debugging)
};
};
// Process memory is laid out contiguously:
// Process memory is laid out contiguously
, low addresses first
:
// text
// text
// original data and bss
// original data and bss
// fixed-size stack
// fixed-size stack
// expandable heap
// expandable heap
// If xv6 was only for uniprocessors, this could be
// Arrange that cp point to the struct proc that this
// struct proc *cp;
// CPU is currently running. Such preprocessor
// Instead we have an array curproc, one per
// subterfuge can be confusing, but saves a lot of typing.
// processor, and #define cp to the right element
// in the array. In general such preprocessor
// subterfuge is to be avoided, but cp is used
// so often that having the shorthand is worth the ugliness.
extern
struct
proc
*
curproc
[
NCPU
];
// Current (running) process per CPU
extern
struct
proc
*
curproc
[
NCPU
];
// Current (running) process per CPU
#define cp (curproc[cpu()]) // Current process on this CPU
#define cp (curproc[cpu()]) // Current process on this CPU
...
...
runoff
浏览文件 @
20365348
...
@@ -18,7 +18,7 @@ files=`grep -v '^#' runoff.list | awk '{print $1}'`
...
@@ -18,7 +18,7 @@ files=`grep -v '^#' runoff.list | awk '{print $1}'`
n
=
99
n
=
99
for
i
in
$files
for
i
in
$files
do
do
runoff1
-n
$n
$i
>
fmt
/
$i
./
runoff1
-n
$n
$i
>
fmt
/
$i
nn
=
`
tail
-1
fmt
/
$i
|
sed
's/ .*//; s/^0*//'
`
nn
=
`
tail
-1
fmt
/
$i
|
sed
's/ .*//; s/^0*//'
`
if
[
"x
$nn
"
!=
x
]
;
then
if
[
"x
$nn
"
!=
x
]
;
then
n
=
$nn
n
=
$nn
...
...
usertests.c
浏览文件 @
20365348
...
@@ -1096,6 +1096,99 @@ rmdot(void)
...
@@ -1096,6 +1096,99 @@ rmdot(void)
printf
(
1
,
"rmdot ok
\n
"
);
printf
(
1
,
"rmdot ok
\n
"
);
}
}
void
dirfile
(
void
)
{
int
fd
;
printf
(
1
,
"dir vs file
\n
"
);
fd
=
open
(
"dirfile"
,
O_CREATE
);
if
(
fd
<
0
){
printf
(
1
,
"create dirfile failed
\n
"
);
exit
();
}
close
(
fd
);
if
(
chdir
(
"dirfile"
)
==
0
){
printf
(
1
,
"chdir dirfile succeeded!
\n
"
);
exit
();
}
fd
=
open
(
"dirfile/xx"
,
0
);
if
(
fd
>=
0
){
printf
(
1
,
"create dirfile/xx succeeded!
\n
"
);
exit
();
}
fd
=
open
(
"dirfile/xx"
,
O_CREATE
);
if
(
fd
>=
0
){
printf
(
1
,
"create dirfile/xx succeeded!
\n
"
);
exit
();
}
if
(
mkdir
(
"dirfile/xx"
)
==
0
){
printf
(
1
,
"mkdir dirfile/xx succeeded!
\n
"
);
exit
();
}
if
(
unlink
(
"dirfile/xx"
)
==
0
){
printf
(
1
,
"unlink dirfile/xx succeeded!
\n
"
);
exit
();
}
if
(
link
(
"README"
,
"dirfile/xx"
)
==
0
){
printf
(
1
,
"link to dirfile/xx succeeded!
\n
"
);
exit
();
}
if
(
unlink
(
"dirfile"
)
!=
0
){
printf
(
1
,
"unlink dirfile failed!
\n
"
);
exit
();
}
fd
=
open
(
"."
,
O_RDWR
);
if
(
fd
>=
0
){
printf
(
1
,
"open . for writing succeeded!
\n
"
);
exit
();
}
fd
=
open
(
"."
,
0
);
if
(
write
(
fd
,
"x"
,
1
)
>
0
){
printf
(
1
,
"write . succeeded!
\n
"
);
exit
();
}
close
(
fd
);
printf
(
1
,
"dir vs file OK
\n
"
);
}
// test that iput() is called at the end of _namei()
void
iref
(
void
)
{
int
i
,
fd
;
printf
(
1
,
"empty file name
\n
"
);
// the 50 is NINODE
for
(
i
=
0
;
i
<
50
+
1
;
i
++
){
if
(
mkdir
(
"irefd"
)
!=
0
){
printf
(
1
,
"mkdir irefd failed
\n
"
);
exit
();
}
if
(
chdir
(
"irefd"
)
!=
0
){
printf
(
1
,
"chdir irefd failed
\n
"
);
exit
();
}
mkdir
(
""
);
link
(
"README"
,
""
);
fd
=
open
(
""
,
O_CREATE
);
if
(
fd
>=
0
)
close
(
fd
);
fd
=
open
(
"xx"
,
O_CREATE
);
if
(
fd
>=
0
)
close
(
fd
);
unlink
(
"xx"
);
}
chdir
(
"/"
);
printf
(
1
,
"empty file name OK
\n
"
);
}
int
int
main
(
int
argc
,
char
*
argv
[])
main
(
int
argc
,
char
*
argv
[])
{
{
...
@@ -1128,6 +1221,8 @@ main(int argc, char *argv[])
...
@@ -1128,6 +1221,8 @@ main(int argc, char *argv[])
createdelete
();
createdelete
();
twofiles
();
twofiles
();
sharedfd
();
sharedfd
();
dirfile
();
iref
();
exectest
();
exectest
();
...
...
编写
预览
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论