X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=doc%2Ffilesys.texi;h=8b7bdb46f1d753032bd2892bcd19e35b2b2f0d3f;hb=43909869c5badf49423031847a8b19c1c0132ca2;hp=da5f1e2a7380c229daadac94801e5c5c70064cf0;hpb=c574297b7acbcbf04d128113cf91dbbcc1730f9c;p=pintos-anon diff --git a/doc/filesys.texi b/doc/filesys.texi index da5f1e2..8b7bdb4 100644 --- a/doc/filesys.texi +++ b/doc/filesys.texi @@ -91,7 +91,7 @@ Modify the file system to allow the maximum size of a file to be as large as the disk. You can assume that the disk will not be larger than 8 MB. In the basic file system, each file is limited to a file size of just under 64 kB. Each file has a header called an index node -or @dfn{inode} (represented by @code{struct inode}) that is a table of +or @dfn{inode} (represented by @struct{inode}) that is a table of direct pointers to the disk blocks for that file. Since the inode is stored in one disk sector, the maximum size of a file is limited by the number of pointers that will fit in one disk sector. Increasing @@ -150,7 +150,7 @@ per line. @end table Also write the @command{ls} and @command{mkdir} user programs. This -is straightforward once the above syscalls are implemented. If Unix, +is straightforward once the above syscalls are implemented. In Unix, these are programs rather than built-in shell commands, but @command{cd} is a shell command. (Why?) @@ -167,7 +167,7 @@ replacement algorithm. Experiment to see what combination of accessed, dirty, and other information results in the best performance, as measured by the number of disk accesses. (For example, metadata is generally more valuable to cache than data.) Document your -replacement algoritm in your design document. +replacement algorithm in your design document. In addition to the basic file caching scheme, your implementation should also include the following enhancements: @@ -191,7 +191,7 @@ to perform better than on the original file system implementation, and demonstrate the performance improvement. Note that write-behind makes your filesystem more fragile in the face -of crashes. Therefore, you should implement some manner to +of crashes. Therefore, you should periodically write all cached blocks to disk. If you have @func{timer_sleep} from the first project working, this is an excellent application for it. @@ -270,11 +270,10 @@ document. @b{What exec modes for running Pintos do I absolutely need to support?} -You also need to support the @option{-f}, @option{-ci}, and -@option{-ex} flags individually, and you need to handle them when +You also need to support the @option{-f}, @option{-ci}, @option{-co}, +and @option{-ex} flags individually, and you need to handle them when they're combined, like this: @samp{pintos -f -ci shell 12345 -ex -"shell"}. Thus, you should be able to treat the above as equivalent -to: +"shell"}. Thus, you should be able to treat the above as equivalent to: @example pintos -f @@ -286,6 +285,9 @@ If you don't change the filesystem interface, then this should already be implemented properly in @file{threads/init.c} and @file{filesys/fsutil.c}. +You must also implement the @option{-q} option and make sure that data +gets flushed out to disk properly when it is used. + @item @b{Will you test our file system with a different @code{DISK_SECTOR_SIZE}?} @@ -293,11 +295,16 @@ No, @code{DISK_SECTOR_SIZE} is fixed at 512. This is a fixed property of IDE disk hardware. @item -@b{Will the @code{struct inode} take up space on the disk too?} +@b{Will the @struct{inode} take up space on the disk too?} -Yes. Anything stored in @code{struct inode} takes up space on disk, +Yes. Anything stored in @struct{inode} takes up space on disk, so you must include this in your calculation of how many entires will fit in a single disk sector. + +@item +@b{What's the directory separator character?} + +Forward slash (@samp{/}). @end enumerate @menu @@ -315,7 +322,7 @@ fit in a single disk sector. The disk we create will be 8 MB or smaller. However, individual files will have to be smaller than the disk to accommodate the metadata. -You'll need to consider this when deciding your @code{struct inode} +You'll need to consider this when deciding your @struct{inode} organization. @end enumerate @@ -385,22 +392,22 @@ only be deleted if they are empty, as in Unix. @enumerate 1 @item @b{We're limited to a 64-block cache, but can we also keep a copy of -each @code{struct inode} for an open file inside @code{struct file}, +each @struct{inode} for an open file inside @struct{file}, the way the stub code does?} No, you shouldn't keep any disk sectors stored anywhere outside the cache. That means you'll have to change the way the file implementation accesses its corresponding inode right now, since it -currently just creates a new @code{struct inode} in its constructor +currently just creates a new @struct{inode} in its constructor and reads the corresponding sector in from disk when it's created. -There are two reasons for not storing inodes in @code{struct file}. +There are two reasons for not storing inodes in @struct{file}. First, keeping extra copies of inodes would be cheating the 64-block limitation that we place on your cache. Second, if two processes have the same file open, you will create a huge synchronization headache -for yourself if each @code{struct file} has its own copy of the inode. +for yourself if each @struct{file} has its own copy of the inode. -Note that you can store pointers to inodes in @code{struct file} if +Note that you can store pointers to inodes in @struct{file} if you want, and you can store some other small amount of information to help you find the inode when you need it. @@ -408,13 +415,13 @@ Similarly, if you want to store one block of data plus some small amount of metadata for each of your 64 cache entries, that's fine. @item -@b{But why can't we store copies of inodes in @code{struct file}? We +@b{But why can't we store copies of inodes in @struct{file}? We don't understand the answer to the previous question.} -The issue regarding storing @code{struct inode}s has to do with +The issue regarding storing @struct{inode}s has to do with implementation of the buffer cache. Basically, you can't store a -@code{struct inode *} in @code{struct inode}. Each time you need -to read a @code{struct inode}, you'll have to get it either from the +@code{struct inode *} in @struct{inode}. Each time you need +to read a @struct{inode}, you'll have to get it either from the buffer cache or from disk. If you look at @func{file_read_at}, it uses the inode directly