1 @node Project 3--Virtual Memory, Project 4--File Systems, Project 2--User Programs, Top
2 @chapter Project 3: Virtual Memory
4 By now you should be familiar with the inner workings of Pintos.
5 You've already come a long way: your OS can properly handle multiple
6 threads of execution with proper synchronization, and can load
7 multiple user programs at once. However, when loading user programs,
8 your OS is limited by how much main memory the simulated machine has.
9 In this assignment, you will remove that limitation.
11 You will be using the @file{vm} directory for this project. The
12 @file{vm} directory contains only the @file{Makefile}s. The only
13 change from @file{userprog} is that this new @file{Makefile} turns on
14 the setting @option{-DVM}. All code you write will either be newly
15 generated files (e.g.@: if you choose to implement your paging code in
16 their own source files), or will be modifications to pre-existing code
17 (e.g.@: you will change the behavior of @file{process.c}
20 There are only a couple of source files you will probably be
21 encountering for the first time:
26 Provides access to the physical disk, abstracting away the rather
30 You will be building this assignment on the last one. It will benefit
31 you to get your project 2 in good working order before this assignment
32 so those bugs don't keep haunting you.
34 All the test programs from the previous project should also work with
35 this project. You should also write programs to test the new features
36 introduced in this project.
38 Your submission should define @code{THREAD_JOIN_IMPLEMENTED} in
39 @file{constants.h} (@pxref{Conditional Compilation}).
44 * Disk as Backing Store::
45 * Memory Mapped Files::
47 * Problem 3-1 Page Table Management::
48 * Problem 3-2 Paging To and From Disk::
49 * Problem 3-3 Memory Mapped Files::
50 * Virtual Memory FAQ::
54 @section A Word about Design
56 It is important for you to note that in addition to getting virtual
57 memory working, this assignment is also meant to be an open-ended
58 design problem. We will expect you to come up with a design that
59 makes sense. You will have the freedom to choose how to handle page
60 faults, how to organize the swap disk, how to implement paging, etc.
61 In each case, we will expect you to provide a defensible justification
62 in your design documentation as to why your choices are reasonable.
63 You should evaluate your design on all the available criteria: speed
64 of handling a page fault, space overhead in memory, minimizing the
65 number of page faults, simplicity, etc.
67 In keeping with this, you will find that we are going to say as little
68 as possible about how to do things. Instead we will focus on what end
69 functionality we require your OS to support.
74 For the last assignment, whenever a context switch occurred, the new
75 process would install its own page table into the machine. The page
76 table contained all the virtual-to-physical translations for the
77 process. Whenever the processor needed to look up a translation, it
78 consulted the page table. As long as the process only accessed
79 memory that it didn't own, all was well. If the process accessed
80 memory it didn't own, it ``page faulted'' and @func{page_fault}
81 terminated the process.
83 When we implement virtual memory, the rules have to change. A page
84 fault is no longer necessarily an error, since it might only indicate
85 that the page must be brought in from a disk file or from swap. You
86 will have to implement a more sophisticated page fault handler to
89 On the 80@var{x}86, the page table format is fixed by hardware. We
90 have provided code for managing page tables for you to use in
91 @file{userprog/pagedir.c}. The functions in there should provide an
92 abstract interface to all the page table functionality that you need
93 to complete the project. However, you may still find it worthwhile to
94 understand a little about the hardware page table format, so we'll go
95 into a little of detail about that in this section.
97 The top-level paging data structure is a 4 kB page called the ``page
98 directory'' (PD) arranged as an array of 1,024 32-bit page directory
99 entries (PDEs), each of which represents 4 MB of virtual memory. Each
100 PDE may point to the physical address of another 4 kB page called a
101 ``page table'' (PT) arranged in the same fashion as an array of 1,024
102 32-bit page table entries (PTEs), each of which translates a single 4
103 kB virtual page into physical memory.
105 Thus, translation of a virtual address into a physical address follows
106 the three-step process illustrated in the diagram
107 below:@footnote{Actually, virtual to physical translation on the
108 80@var{x}86 architecture happens via an intermediate ``linear
109 address,'' but Pintos (and most other 80@var{x}86 OSes) set up the CPU
110 so that linear and virtual addresses are one and the same, so that you
111 can effectively ignore this CPU feature.}
115 The top 10 bits of the virtual address (bits 22:32) are used to index
116 into the page directory. If the PDE is marked ``present,'' the
117 physical address of a page table is read from the PDE thus obtained.
118 If the PDE is marked ``not present'' then a page fault occurs.
121 The next 10 bits of the virtual address (bits 12:22) are used to index
122 into the page table. If the PTE is marked ``present,'' the physical
123 address of a data page is read from the PTE thus obtained. If the PTE
124 is marked ``not present'' then a page fault occurs.
128 The bottom 12 bits of the virtual address (bits 0:12) are added to the
129 data page's physical base address, producing the final physical
136 +--------------------------------------------------------------------+
137 | Page Directory Index | Page Table Index | Page Offset |
138 +--------------------------------------------------------------------+
140 _______/ _______/ _____/
142 / Page Directory / Page Table / Data Page
143 / .____________. / .____________. / .____________.
144 |1,023|____________| |1,023|____________| | |____________|
145 |1,022|____________| |1,022|____________| | |____________|
146 |1,021|____________| |1,021|____________| \__\|____________|
147 |1,020|____________| |1,020|____________| /|____________|
150 | | . | /| . | \ | . |
151 \____\| . |_ | . | | | . |
152 /| . | \ | . | | | . |
153 | . | | | . | | | . |
155 |____________| | |____________| | |____________|
156 4|____________| | 4|____________| | |____________|
157 3|____________| | 3|____________| | |____________|
158 2|____________| | 2|____________| | |____________|
159 1|____________| | 1|____________| | |____________|
160 0|____________| \__\0|____________| \____\|____________|
165 Header @file{threads/mmu.h} has useful functions for various
166 operations on virtual addresses. You should look over the header
167 yourself, but its most important functions include these:
170 @item pd_no(@var{va})
171 Returns the page directory index in virtual address @var{va}.
173 @item pt_no(@var{va})
174 Returns the page table index in virtual address @var{va}.
176 @item pg_ofs(@var{va})
177 Returns the page offset in virtual address @var{va}.
179 @item pg_round_down(@var{va})
180 Returns @var{va} rounded down to the nearest page boundary, that is,
181 @var{va} but with its page offset set to 0.
183 @item pg_round_up(@var{va})
184 Returns @var{va} rounded up to the nearest page boundary.
187 @node Disk as Backing Store
188 @section Disk as Backing Store
190 In VM systems, since memory is less plentiful than disk, you will
191 effectively use memory as a cache for disk. Looking at it from
192 another angle, you will use disk as a backing store for memory. This
193 provides the abstraction of an (almost) unlimited virtual memory size.
194 Part of your task in this project is to do this, with the additional
195 constraint that your performance should be close to that provided by
196 physical memory. You will use the page tables' ``dirty'' bits to
197 denote whether pages need to be written back to disk when they're
198 evicted from main memory and the ``accessed'' bit for page replacement
199 algorithms. Whenever the hardware writes memory, it sets the dirty
200 bit, and if it reads or writes to the page, it sets the accessed bit.
202 As with any caching system, performance depends on the policy used to
203 decide which things are kept in memory and which are only stored on
204 disk. On a page fault, the kernel must decide which page to replace.
205 Ideally, it will throw out a page that will not be referenced for a
206 long time, keeping in memory those pages that are soon to be
207 referenced. Another consideration is that if the replaced page has
208 been modified, the page must be first saved to disk before the needed
209 page can be brought in. Many virtual memory systems avoid this extra
210 overhead by writing modified pages to disk in advance, so that later
211 page faults can be completed more quickly.
213 @node Memory Mapped Files
214 @section Memory Mapped Files
216 The traditional way to access the file system is via @code{read} and
217 @code{write} system calls, but that requires an extra level of copying
218 between the kernel and the user level. A secondary interface is
219 simply to ``map'' the file into the virtual address space. The
220 program can then use load and store instructions directly on the file
221 data. (An alternative way of viewing the file system is as ``durable
222 memory.'' Files just store data structures. If you access data
223 structures in memory using load and store instructions, why not access
224 data structures in files the same way?)
226 Memory mapped files are typically implemented using system calls. One
227 system call maps the file to a particular part of the address space.
228 For example, one might conceptually map the file @file{foo}, which is
230 long, starting at address 5000. Assuming that nothing else is already
231 at virtual addresses 5000@dots{}6000, any memory accesses to these
232 locations will access the corresponding bytes of @file{foo}.
234 A consequence of memory mapped files is that address spaces are
235 sparsely populated with lots of segments, one for each memory mapped
236 file (plus one each for code, data, and stack). You will implement
237 memory mapped files in problem 3-3. You should
238 design your solutions to problems 3-1 and 3-2 to anticipate this.
243 In project 2, the stack was a single page at the top of the user
244 virtual address space. The stack's location does not change in this
245 project, but your kernel should allocate additional pages to the stack
246 on demand. That is, if the stack grows past its current bottom, the
247 system should allocate additional pages for the stack as necessary
248 (unless those pages are unavailable because they are in use by another
251 It is impossible to predict how large the stack will grow at compile
252 time, so we must allocate pages as necessary. You should only
253 allocate additional pages if they ``appear'' to be stack accesses.
254 You must devise a heuristic that attempts to distinguish stack
255 accesses from other accesses. Document and explain the heuristic in
256 your design documentation.
258 The first stack page need not be loaded lazily. You can initialize it
259 with the command line at load time, with no need to wait for it to be
260 faulted in. Even if you did wait, the very first instruction in the
261 user program is likely to be one that faults in the page.
263 @node Problem 3-1 Page Table Management
264 @section Problem 3-1: Page Table Management
266 Implement page directory and page table management to support virtual
267 memory. You will need data structures to accomplish the following
272 Some way of translating in software from virtual page frames to
273 physical page frames. Consider using a hash table (@pxref{Hash
276 It is possible to do this translation without adding a new data
277 structure, by modifying the code in @file{userprog/pagedir.c}. However,
278 if you do that you'll need to carefully study and understand section 3.7
279 in @bibref{IA32-v3}, and in practice it is probably easier to add a new
283 Some way of finding a page on disk if it is not in memory. You won't
284 need this data structure until problem 3-2, but planning ahead is a
287 You can generalize the virtual-to-physical page table, so that it allows
288 you to locate a page wherever it is in physical memory or on disk, or
289 you can make this a separate table.
292 Some way of translating from physical page frames back to virtual page
293 frames, so that when you evict a physical page from its frame, you can
294 invalidate its translation(s).
297 The page fault handler, @func{page_fault} in
298 @file{threads/exception.c}, needs to do roughly the following:
302 Locate the page backing the virtual
303 address that faulted. It might be in the file system, in swap,
304 or it might be an invalid virtual address.
305 If you implement sharing, it might even
306 already be in physical memory and just not set up in the page table,
308 If the virtual address is invalid, that is, if there's nothing
309 assigned to go there, or if the virtual address is above
310 @code{PHYS_BASE}, meaning that it belongs to the kernel instead of the
311 user, then the process's memory access must be disallowed. You should
312 terminate the process at this point, being sure to free all of its
316 If the page is not in physical memory, fetch it by appropriate means.
317 If necessary to make room, first evict some other page from memory.
318 (When you do that you need to first remove references to the page from
319 any page table that refers to it.)
322 Point the page table entry for the faulting virtual address to the
323 physical page. You can use the functions in @file{userprog/pagedir.c}.
326 You'll need to modify the ELF loader in @file{userprog/process.c} to
327 do page table management according to your new design. As supplied,
328 it reads all the process's pages from disk and initializes the page
329 tables for them at the same time. For testing purposes, you'll
330 probably want to leave the code that reads the pages from disk, but
331 use your new page table management code to construct the page tables
332 only as page faults occur for them.
334 You should use the @func{palloc_get_page} function to get the page
335 frames that you use for storing user virtual pages. Be sure to pass
336 the @code{PAL_USER} flag to this function when you do so, because that
337 allocates pages from a ``user pool'' separate from the ``kernel pool''
338 that other calls to @func{palloc_get_page} make.
340 There are many possible ways to implement virtual memory. The above
341 is simply an outline of our suggested implementation.
343 @node Problem 3-2 Paging To and From Disk
344 @section Problem 3-2: Paging To and From Disk
346 Implement paging to and from files and the swap disk. You may use the
347 disk on interface @code{hd1:1} as the swap disk, using the disk
348 interface prototyped in @code{devices/disk.h}.
350 You will need routines to move a page from memory to disk and from
351 disk to memory, where ``disk'' is either a file or the swap disk. If
352 you do everything correctly, your VM should still work when you
353 implement your own file system for the next assignment.
355 You will need a way to track pages which are used by a process but
356 which are not in physical memory, to fully handle page faults. Pages
357 that you write to swap should not be constrained to be in sequential
358 order. You will also need a way to track all of the physical memory
359 pages, to find an unused one when needed, or to evict a page
360 when memory is needed but no empty pages are available. The data
361 structures that you designed for problem 3-1 should do most of the work for
364 You will need a page replacement algorithm. The hardware sets the
365 accessed and dirty bits when it accesses memory. You can gain access
366 to this information using the functions prototyped in
367 @file{userprog/pagedir.h}. You should be able to take advantage of
368 this information to implement some algorithm which attempts to achieve
369 LRU-type behavior. We expect that your algorithm perform at least as
370 well as a reasonable implementation of the second-chance (clock)
371 algorithm. You will need to show in your test cases the value of your
372 page replacement algorithm by demonstrating for some workload that it
373 pages less frequently using your algorithm than using some inferior
374 page replacement policy. The canonical example of a poor page
375 replacement policy is random replacement.
377 Since you will already be paging from disk, you should implement a
378 ``lazy'' loading scheme for new processes. When a process is created,
379 it will not run immediately. Therefore, it doesn't make sense to load
380 all its code, data, and stack into memory when the process is created,
381 since it might incur additional disk accesses to do so (if it gets
382 paged out before it runs). When loading a new process, you should
383 leave most pages on disk, and bring them in as demanded when the
384 program begins running. Your VM system should also use the executable
385 file itself as backing store for read-only segments, since these
386 segments won't change.
388 There are a few special cases. Look at the loop in
389 @func{load_segment} in @file{userprog/process.c}. Each time
390 around the loop, @code{read_bytes} represents the number of bytes to
391 read from the executable file and @code{zero_bytes} represents the number
392 of bytes to initialize to zero following the bytes read. The two
393 always sum to @code{PGSIZE}. The page handling depends on these
398 If @code{read_bytes} equals @code{PGSIZE}, the page should be demand
399 paged from disk on its first access.
402 If @code{zero_bytes} equals @code{PGSIZE}, the page does not need to
403 be read from disk at all because it is all zeroes. You should handle
404 such pages by creating a new page consisting of all zeroes at the
408 If neither @code{read_bytes} nor @code{zero_bytes} equals
409 @code{PGSIZE}, then part of the page is to be read from disk and the
410 remainder zeroed. This is a special case. You are allowed to handle
411 it by reading the partial page from disk at executable load time and
412 zeroing the rest of the page. This is the only case in which we will
413 allow you to load a page in a non-``lazy'' fashion. Many real OSes
414 such as Linux do not load partial pages lazily.
417 Incidentally, if you have trouble handling the third case above, you
418 can eliminate it temporarily by linking the test programs with a
419 special ``linker script.'' Read @file{tests/userprog/Makefile} for
420 details. We will not test your submission with this special linker
421 script, so the code you turn in must properly handle all cases.
423 For extra credit, you may implement sharing: when multiple processes
424 are created that use the same executable file, share read-only pages
425 among those processes instead of creating separate copies of read-only
426 segments for each process. If you carefully designed your data
427 structures in problem 3-1, sharing of read-only pages should not make this
428 part significantly harder.
430 @node Problem 3-3 Memory Mapped Files
431 @section Problem 3-3: Memory Mapped Files
433 Implement memory mapped files.
435 You will need to implement the following system calls:
439 @itemx bool mmap (int @var{fd}, void *@var{addr}, unsigned @var{length})
441 Maps the file open as @var{fd} into the process's address space
442 starting at @var{addr} for @var{length} bytes. Returns true if
443 successful, false on failure. Failure cases include the following:
447 @var{addr} is not page-aligned.
450 @var{length} is not positive.
453 The range of pages mapped overlaps any existing set of mapped pages,
454 including the stack or pages mapped at executable load time.
457 @var{length} is treated as if it were rounded up to the nearest
458 multiple of the page size, that is, as if the first statement in the
459 system call's implementation were
461 length = ROUND_UP (length, PGSIZE);
463 (The @code{ROUND_UP} macro is defined in @file{<round.h>}.)
464 The remainder of this description assumes that this has been done.
466 If @var{length} is less than @var{fd}'s length, you should only map
467 the first @var{length} bytes of the file. If @var{length} is greater
468 than @var{fd}'s length, when the file's length is also rounded up to a
469 page multiple, the call should fail. Ideally it would extend the
470 file, but our file system does not yet support growing files.
472 If @var{length} is greater than @var{fd}'s (unrounded) length, then some
473 bytes in the final mapped page ``stick out'' beyond the end of the
474 file. Set these bytes to zero when the page is faulted in from
475 disk, and discard them when the page is written back to disk.
477 Your VM system should use the @code{mmap}'d file itself as
478 backing store for the mapped segment. That is, to evict a page mapped by
479 @code{mmap} must be evicted, write it to the file it was mapped from.
480 (In fact, you may choose to implement executable mappings as a special
481 case of file mappings.)
484 @itemx bool munmap (void *addr, unsigned length)
486 Unmaps @var{length} bytes starting at @var{addr}. Returns true on
487 success, false on failure. Failure cases include the following:
491 @var{addr} is not page-aligned.
494 @var{length} is not positive.
497 One or more pages within the range to be unmapped were not mapped
498 using the @code{mmap} system call.
501 As with @code{mmap}, @var{length} is treated as if it were rounded up
502 to the nearest multiple of the page size.
504 It is valid to unmap only some of the pages that were mapped in a
505 previous system call.
508 All mappings are implicitly unmapped when a process exits, whether via
509 @code{exit} or by any other means. When a file is unmapped, whether
510 implicitly or explicitly, all outstanding changes are written to the
511 file, and the pages are removed from the process's list of used
514 @node Virtual Memory FAQ
519 @b{Do we need a working HW 2 to implement HW 3?}
525 @b{How do I use the hash table provided in @file{lib/kernel/hash.c}?}
527 First, you need to embed a @code{hash_elem} object as a member of the
528 object that the hash table will contain. Each @code{hash_elem} allows
529 the object to a member of at most one hash table at a given time. All
530 the hash table functions that deal with hash table items actually use
531 the address of a @code{hash_elem}. You can convert a pointer to a
532 @code{hash_elem} member into a pointer to the structure in which
533 member is embedded using the @code{hash_entry} macro.
535 Second, you need to decide on a key type. The key should be something
536 that is unique for each object, because a given hash table may not
537 contain two objects with equal keys. Then you need to write two
538 functions. The first is a @dfn{hash function} that converts a key
539 into an integer. Some sample hash functions that you can use or just
540 examine are given in @file{lib/kernel/hash.c}. The second function
541 needed is a @dfn{comparison function} that compares a pair and returns
542 true if the first is less than the second. These two functions have
543 to be compatible with the prototypes for @code{hash_hash_func} and
544 @code{hash_less_func} in @file{lib/kernel/hash.h}.
546 Here's a quick example. Suppose you want to put @struct{thread}s
547 in a hash table. First, add a @code{hash_elem} to the thread
548 structure by adding a line to its definition:
551 hash_elem h_elem; /* Hash table element. */
554 We'll choose the @code{tid} member in @struct{thread} as the key,
555 and write a hash function and a comparison function:
558 /* Returns a hash for E. */
560 thread_hash (const hash_elem *e, void *aux UNUSED)
562 struct thread *t = hash_entry (e, struct thread, h_elem);
563 return hash_int (t->tid);
566 /* Returns true if A's tid is less than B's tid. */
568 thread_less (const hash_elem *a_, const hash_elem *b_,
571 struct thread *a = hash_entry (a_, struct thread, h_elem);
572 struct thread *b = hash_entry (b_, struct thread, h_elem);
573 return a->tid < b->tid;
577 Then we can create a hash table like this:
582 hash_init (&threads, thread_hash, thread_less, NULL);
585 Finally, if @code{@var{t}} is a pointer to a @struct{thread},
586 then we can insert it into the hash table with:
589 hash_insert (&threads, &@var{t}->h_elem);
592 If you have any other questions about hash tables, the CS109
593 and CS161 textbooks have good chapters on them, or you can come
594 to any of the TA's office hours for further clarification.
597 @b{What are the @var{aux} parameters to the hash table functions good
600 In simple cases you won't have any need for the @var{aux} parameters.
601 In these cases you can just pass a null pointer to @func{hash_init}
602 for @var{aux} and ignore the values passed to the hash function and
603 comparison functions. (You'll get a compiler warning if you don't use
604 the @var{aux} parameter, but you can turn that off with the
605 @code{UNUSED} macro, as shown above, or you can just ignore it.)
607 @var{aux} is useful when you have some property of the data in the
608 hash table that's both constant and needed for hashing or comparisons,
609 but which is not stored in the data items themselves. For example, if
610 the items in a hash table contain fixed-length strings, but the items
611 themselves don't indicate what that fixed length is, you could pass
612 the length as an @var{aux} parameter.
615 @b{The current implementation of the hash table does not do something
616 that we need it to do. What gives?}
618 You are welcome to modify it. It is not used by any of the code we
619 provided, so modifying it won't affect any code but yours. Do
620 whatever it takes to make it work the way you want.
623 @b{What controls the layout of user programs?}
625 The linker is responsible for the layout of a user program in
626 memory. The linker is directed by a ``linker script'' which tells it
627 the names and locations of the various program segments. You can
628 learn more about linker scripts by reading the ``Scripts'' chapter in
629 the linker manual, accessible via @samp{info ld}.
633 * Problem 3-1 and 3-2 FAQ::
634 * Problem 3-3 Memory Mapped File FAQ::
637 @node Problem 3-1 and 3-2 FAQ
638 @subsection Problem 3-1 and 3-2 FAQ
642 @b{Does the virtual memory system need to support growth of the data
645 No. The size of the data segment is determined by the linker. We
646 still have no dynamic allocation in Pintos (although it is possible to
647 ``fake'' it at the user level by using memory-mapped files). However,
648 implementing it would add little additional complexity to a
649 well-designed system.
652 @b{Why do I need to pass @code{PAL_USER} to @func{palloc_get_page}
653 when I allocate physical page frames?}@anchor{Why PAL_USER?}
655 You can layer some other allocator on top of @func{palloc_get_page}
656 if you like, but it should be the underlying mechanism, directly or
657 indirectly, for two reasons. First, running out of pages in the user
658 pool just causes user programs to page, but running out of pages in
659 the kernel pool will cause all kinds of problems, because many kernel
660 functions depend on being able to allocate memory. Second, you can
661 use the @option{-ul} option to @command{pintos} to limit the size of
662 the user pool, which makes it easy to test your VM implementation with
663 various user memory sizes.
666 @node Problem 3-3 Memory Mapped File FAQ
667 @subsection Problem 3-3: Memory Mapped File FAQ
671 @b{How do we interact with memory-mapped files?}
673 Let's say you want to map a file called @file{foo} into your address
674 space at address @t{0x10000000}. You open the file, determine its
675 length, and then use @code{mmap}:
683 void *addr = (void *) 0x10000000;
684 int fd = open ("foo");
685 int length = filesize (fd);
686 if (mmap (fd, addr, length))
687 printf ("success!\n");
691 Suppose @file{foo} is a text file and you want to print the first 64
692 bytes on the screen (assuming, of course, that the length of the file
693 is at least 64). Without @code{mmap}, you'd need to allocate a
694 buffer, use @code{read} to get the data from the file into the buffer,
695 and finally use @code{write} to put the buffer out to the display. But
696 with the file mapped into your address space, you can directly address
700 write (addr, 64, STDOUT_FILENO);
703 Similarly, if you wanted to replace the first byte of the file,
704 all you need to do is:
710 When you're done using the memory-mapped file, you simply unmap
714 munmap (addr, length);
718 @b{What if two processes memory-map the same file?}
720 There is no requirement in Pintos that the two processes see
721 consistent data. Unix handles this by making the processes share the
722 same physical page, but the @code{mmap} system call also has an
723 argument allowing the client to specify whether the page is shared or
724 private (i.e.@: copy-on-write).
727 @b{What happens if a user removes a @code{mmap}'d file?}
729 You should follow the Unix convention and the mapping should still be
730 valid. @xref{Removing an Open File}, for more information.
733 @b{What if a process writes to a page that is memory-mapped, but the
734 location written to in the memory-mapped page is past the end
735 of the memory-mapped file?}
737 Can't happen. @code{mmap} checks that the mapped region is within the
738 file's length and Pintos provides no way to shorten a file. (Until
739 project 4, there's no way to extend a file either.) You can remove a
740 file, but the mapping remains valid (see the previous question).
743 @b{Do we have to handle memory mapping @code{stdin} or @code{stdout}?}
745 No. Memory mapping implies that a file has a length and that a user
746 can seek to any location in the file. Since the console device has
747 neither of these properties, @code{mmap} should return false when the
748 user attempts to memory map a file descriptor for the console device.
751 @b{What happens when a process exits with mapped files?}
753 When a process finishes, each of its mapped files is implicitly
754 unmapped. When a process @code{mmap}s a file and then writes into the
755 area for the file it is making the assumption the changes will be
759 @b{If a user closes a mapped file, should it be automatically
762 No, once created the mapping is valid until @code{munmap} is called
763 or the process exits.