Compare commits
32 Commits
vm/virtual
...
master
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
ad4eda5385 | ||
|
|
8d1b4c4994 | ||
|
|
07c0219058 | ||
|
|
5fbabdcec9 | ||
|
|
5e8bdc68e7 | ||
|
|
d039b59b7c | ||
|
|
29c0b93711 | ||
|
77fedd6666
|
|||
|
|
eba8c1ffa8 | ||
|
|
be696ec528 | ||
|
|
7611090253 | ||
|
|
7f058ffc90 | ||
|
c1bc70adad
|
|||
|
|
22f3b0950f | ||
|
f64b92bbfa
|
|||
|
|
3d6e30119b | ||
|
4104d2c852
|
|||
|
|
d389c15828 | ||
|
|
8ac34063d7 | ||
|
|
c68fea5249 | ||
|
|
65da1659e5 | ||
|
|
3897e83963 | ||
|
|
96b350d623 | ||
|
|
31403ac7cb | ||
|
1da0c7d48c
|
|||
|
|
8220b931a9 | ||
|
|
a34bbbed08 | ||
|
833c1b0520
|
|||
|
9aa9cdb91e
|
|||
|
dd46200256
|
|||
|
4dd6b6e928
|
|||
|
0f1f7b9a6f
|
@@ -38,4 +38,3 @@ test_vm:
|
||||
extends: .pintos_tests
|
||||
variables:
|
||||
DIR: vm
|
||||
IGNORE: (tests/vm/pt-grow-stack|tests/vm/pt-grow-pusha|tests/vm/pt-big-stk-obj|tests/vm/pt-overflowstk|tests/vm/pt-write-code2|tests/vm/pt-grow-stk-sc|tests/vm/page-linear|tests/vm/page-parallel|tests/vm/page-merge-seq|tests/vm/page-merge-par|tests/vm/page-merge-stk|tests/vm/page-merge-mm|tests/vm/mmap-over-stk)
|
||||
|
||||
@@ -33,6 +33,7 @@
|
||||
#endif
|
||||
#ifdef VM
|
||||
#include "vm/frame.h"
|
||||
#include "vm/page.h"
|
||||
#include "devices/swap.h"
|
||||
#endif
|
||||
#ifdef FILESYS
|
||||
@@ -104,6 +105,7 @@ main (void)
|
||||
paging_init ();
|
||||
#ifdef VM
|
||||
frame_init ();
|
||||
shared_file_pages_init ();
|
||||
#endif
|
||||
|
||||
/* Segmentation. */
|
||||
|
||||
@@ -265,11 +265,24 @@ thread_create (const char *name, int priority,
|
||||
#ifdef USERPROG
|
||||
/* Initialize the thread's file descriptor table. */
|
||||
t->fd_counter = MINIMUM_USER_FD;
|
||||
bool success = hash_init (&t->open_files, fd_hash, fd_less, NULL);
|
||||
if (success)
|
||||
{
|
||||
success = hash_init (&t->child_results, process_result_hash,
|
||||
process_result_less, t);
|
||||
if (!success)
|
||||
hash_destroy (&t->open_files, NULL);
|
||||
#ifdef VM
|
||||
else
|
||||
{
|
||||
success = init_pages (&t->pages);
|
||||
if (!success)
|
||||
hash_destroy (&t->child_results, NULL);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
if (!hash_init (&t->open_files, fd_hash, fd_less, NULL)
|
||||
|| !hash_init (&t->child_results, process_result_hash,
|
||||
process_result_less, t)
|
||||
|| !hash_init (&t->pages, page_hash, page_less, NULL))
|
||||
if (!success)
|
||||
{
|
||||
palloc_free_page (t);
|
||||
free (t->result);
|
||||
@@ -723,6 +736,8 @@ init_thread (struct thread *t, const char *name, int nice, int priority,
|
||||
t->recent_cpu = recent_cpu;
|
||||
t->priority = t->base_priority;
|
||||
|
||||
lock_init (&t->pages_lock);
|
||||
|
||||
old_level = intr_disable ();
|
||||
list_push_back (&all_list, &t->allelem);
|
||||
intr_set_level (old_level);
|
||||
|
||||
@@ -136,6 +136,7 @@ struct thread
|
||||
struct list_elem elem; /* List element. */
|
||||
|
||||
struct hash pages; /* Table of open user pages. */
|
||||
struct lock pages_lock; /* Lock for the supplementary page table. */
|
||||
|
||||
/* Memory mapped files for user virtual memory. */
|
||||
struct hash mmap_files; /* List of memory mapped files. */
|
||||
|
||||
@@ -2,21 +2,20 @@
|
||||
#include <inttypes.h>
|
||||
#include <stdio.h>
|
||||
#include "stdbool.h"
|
||||
#include "threads/synch.h"
|
||||
#include "userprog/gdt.h"
|
||||
#include "userprog/pagedir.h"
|
||||
#include "userprog/process.h"
|
||||
#include "threads/interrupt.h"
|
||||
#include "threads/palloc.h"
|
||||
#include "threads/thread.h"
|
||||
#include "threads/vaddr.h"
|
||||
#ifdef VM
|
||||
#include "vm/frame.h"
|
||||
#include "vm/page.h"
|
||||
#include "devices/swap.h"
|
||||
#include "threads/vaddr.h"
|
||||
#include "userprog/pagedir.h"
|
||||
#endif
|
||||
|
||||
#define MAX_STACK_SIZE (8 * 1024 * 1024) // 8MB
|
||||
#define MAX_STACK_OFFSET 32 // 32 bytes offset below stack pointer (ESP)
|
||||
|
||||
/* Number of page faults processed. */
|
||||
static long long page_fault_cnt;
|
||||
|
||||
@@ -182,11 +181,12 @@ page_fault (struct intr_frame *f)
|
||||
/* If the page fault occurred in kernel mode, then we intentionally indicate
|
||||
a fault (for get_user() etc). */
|
||||
if (!user)
|
||||
{
|
||||
f->eip = (void *)f->eax;
|
||||
f->eax = 0xffffffff;
|
||||
return;
|
||||
}
|
||||
{
|
||||
f->eip = (void *)f->eax;
|
||||
f->eax = 0xffffffff;
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
/* To implement virtual memory, delete the rest of the function
|
||||
body, and replace it with code that brings in the page to
|
||||
@@ -252,7 +252,7 @@ fetch_page (void *upage, bool write)
|
||||
{
|
||||
/* Check if the page is in the supplemental page table. That is, it is a page
|
||||
that is expected to be in memory. */
|
||||
struct page_entry *page = page_get (upage);
|
||||
struct page_entry *page = page_get (thread_current (), upage);
|
||||
if (page == NULL)
|
||||
return false;
|
||||
|
||||
@@ -262,24 +262,24 @@ fetch_page (void *upage, bool write)
|
||||
frame. */
|
||||
struct thread *t = thread_current ();
|
||||
if (page_in_swap (t, upage))
|
||||
{
|
||||
/* NOTE: This code should be refactored and moved into helper functions
|
||||
within 'page.c'.*/
|
||||
void *kpage = frame_alloc (0, upage, t);
|
||||
lock_acquire (&page->lock);
|
||||
{
|
||||
/* NOTE: This code should be refactored and moved into helper functions
|
||||
within 'page.c'.*/
|
||||
void *kpage = frame_alloc (0, upage, t);
|
||||
lock_acquire (&page->lock);
|
||||
|
||||
size_t swap_slot = page_get_swap (t, upage);
|
||||
swap_in (kpage, swap_slot);
|
||||
size_t swap_slot = page_get_swap (t, upage);
|
||||
swap_in (kpage, swap_slot);
|
||||
|
||||
lock_release (&page->lock);
|
||||
lock_release (&page->lock);
|
||||
|
||||
bool writeable = pagedir_is_writable (t->pagedir, upage);
|
||||
bool writeable = pagedir_is_writable (t->pagedir, upage);
|
||||
|
||||
/* TODO: When this returns false we should quit the page fault,
|
||||
but currently we continue and check the stack conditions in the
|
||||
page fault handler. */
|
||||
return pagedir_set_page (t->pagedir, upage, kpage, writeable);
|
||||
}
|
||||
/* TODO: When this returns false we should quit the page fault,
|
||||
but currently we continue and check the stack conditions in the
|
||||
page fault handler. */
|
||||
return pagedir_set_page (t->pagedir, upage, kpage, writeable);
|
||||
}
|
||||
|
||||
/* An attempt to write to a non-writeable should fail. */
|
||||
if (write && !page->writable)
|
||||
@@ -289,8 +289,9 @@ fetch_page (void *upage, bool write)
|
||||
bool success = false;
|
||||
switch (page->type) {
|
||||
case PAGE_MMAP:
|
||||
case PAGE_FILE:
|
||||
success = page_load_file (page, page->writable);
|
||||
case PAGE_EXECUTABLE:
|
||||
case PAGE_SHARED:
|
||||
success = page_load_file (page);
|
||||
break;
|
||||
default:
|
||||
return false;
|
||||
|
||||
@@ -2,9 +2,12 @@
|
||||
#include <stdbool.h>
|
||||
#include <stddef.h>
|
||||
#include <string.h>
|
||||
#include "devices/swap.h"
|
||||
#include "threads/init.h"
|
||||
#include "threads/pte.h"
|
||||
#include "threads/palloc.h"
|
||||
#include "vm/frame.h"
|
||||
#include "vm/page.h"
|
||||
|
||||
static uint32_t *active_pd (void);
|
||||
|
||||
@@ -39,8 +42,14 @@ pagedir_destroy (uint32_t *pd)
|
||||
uint32_t *pte;
|
||||
|
||||
for (pte = pt; pte < pt + PGSIZE / sizeof *pte; pte++)
|
||||
if (*pte & PTE_P)
|
||||
palloc_free_page (pte_get_page (*pte));
|
||||
{
|
||||
if (page_is_shared_pte (pte))
|
||||
continue;
|
||||
else if (page_in_swap_pte (pte))
|
||||
swap_drop (page_get_swap_pte (pte));
|
||||
else if (*pte & PTE_P)
|
||||
frame_free (pte_get_page (*pte));
|
||||
}
|
||||
palloc_free_page (pt);
|
||||
}
|
||||
palloc_free_page (pd);
|
||||
|
||||
@@ -371,7 +371,9 @@ process_exit (void)
|
||||
hash_destroy (&cur->open_files, fd_cleanup);
|
||||
|
||||
/* Clean up the thread's supplemental page table. */
|
||||
lock_acquire (&cur->pages_lock);
|
||||
hash_destroy (&cur->pages, page_cleanup);
|
||||
lock_release (&cur->pages_lock);
|
||||
|
||||
/* Close the executable file, implicitly allowing it to be written to. */
|
||||
if (cur->exec_file != NULL)
|
||||
@@ -715,7 +717,7 @@ load_segment (struct file *file, off_t ofs, uint8_t *upage,
|
||||
|
||||
/* Add the page metadata to the SPT to be lazy loaded later on */
|
||||
if (page_insert_file (file, ofs, upage, page_read_bytes, page_zero_bytes,
|
||||
writable, PAGE_FILE) == NULL)
|
||||
writable, PAGE_EXECUTABLE) == NULL)
|
||||
return false;
|
||||
|
||||
/* Advance. */
|
||||
|
||||
@@ -461,10 +461,9 @@ syscall_mmap (int fd, void *addr)
|
||||
/* Check and ensure that there is enough space in the user virtual memory to
|
||||
hold the entire file. */
|
||||
for (off_t ofs = 0; ofs < file_size; ofs += PGSIZE)
|
||||
{
|
||||
if (page_get (addr + ofs) != NULL)
|
||||
if (page_get (thread_current (), addr + ofs) != NULL)
|
||||
return MMAP_FAILURE;
|
||||
}
|
||||
|
||||
|
||||
/* Map the file data into the user virtual memory starting from addr. */
|
||||
for (off_t ofs = 0; ofs < file_size; ofs += PGSIZE)
|
||||
@@ -473,7 +472,7 @@ syscall_mmap (int fd, void *addr)
|
||||
off_t zero_bytes = PGSIZE - read_bytes;
|
||||
|
||||
if (page_insert_file (file, ofs, addr + ofs, read_bytes, zero_bytes, true,
|
||||
PAGE_FILE) == NULL)
|
||||
PAGE_MMAP) == NULL)
|
||||
return MMAP_FAILURE;
|
||||
}
|
||||
|
||||
@@ -482,7 +481,6 @@ syscall_mmap (int fd, void *addr)
|
||||
if (mmap == NULL)
|
||||
return MMAP_FAILURE;
|
||||
|
||||
|
||||
return mmap->mapping;
|
||||
}
|
||||
|
||||
|
||||
200
src/vm/frame.c
200
src/vm/frame.c
@@ -2,12 +2,13 @@
|
||||
#include <hash.h>
|
||||
#include <list.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "frame.h"
|
||||
#include "page.h"
|
||||
#include "filesys/file.h"
|
||||
#include "threads/malloc.h"
|
||||
#include "threads/vaddr.h"
|
||||
#include "userprog/pagedir.h"
|
||||
#include "userprog/syscall.h"
|
||||
#include "threads/synch.h"
|
||||
|
||||
/* Hash table that maps every active frame's kernel virtual address
|
||||
@@ -27,23 +28,20 @@ struct list lru_list;
|
||||
victim. Otherwise, the next element in the queue is similarly considered. */
|
||||
struct list_elem *next_victim = NULL;
|
||||
|
||||
/* Synchronisation variables. */
|
||||
/* Protects access to 'lru_list'. */
|
||||
struct lock lru_lock;
|
||||
|
||||
struct frame_metadata
|
||||
{
|
||||
void *frame; /* The kernel virtual address holding the frame. */
|
||||
void *upage; /* The user virtual address pointing to the frame. */
|
||||
struct thread *owner; /* Pointer to the thread that owns the frame. */
|
||||
bool pinned;
|
||||
|
||||
struct list owners; /* List of threads that own the frame. */
|
||||
bool pinned; /* Indicates wheter the frame should be
|
||||
considered as an eviction candidate.*/
|
||||
struct hash_elem hash_elem; /* Tracks the position of the frame metadata
|
||||
within 'frame_table', whose key is the
|
||||
kernel virtual address of the frame. */
|
||||
struct list_elem list_elem; /* Tracks the position of the frame metadata
|
||||
in either the 'active' or 'inactive' list,
|
||||
so a victim can be chosen for eviction. */
|
||||
within 'lru_list', so a victim can be
|
||||
chosen for eviction. */
|
||||
};
|
||||
|
||||
hash_hash_func frame_metadata_hash;
|
||||
@@ -53,6 +51,8 @@ static struct list_elem *lru_next (struct list_elem *e);
|
||||
static struct list_elem *lru_prev (struct list_elem *e);
|
||||
static struct frame_metadata *frame_metadata_get (void *frame);
|
||||
static struct frame_metadata *get_victim (void);
|
||||
static void free_owners (struct list *owners);
|
||||
static struct frame_metadata *frame_metadata_find (void *frame);
|
||||
|
||||
/* Initialize the frame system by initializing the frame (hash) table with
|
||||
the frame_metadata hashing and comparison functions, as well as initializing
|
||||
@@ -63,7 +63,7 @@ frame_init (void)
|
||||
hash_init (&frame_table, frame_metadata_hash, frame_metadata_less, NULL);
|
||||
|
||||
list_init (&lru_list);
|
||||
lock_init (&lru_lock);
|
||||
lock_init (&ftable_lock);
|
||||
}
|
||||
|
||||
/* TODO: Consider synchronisation more closely (i.e. just for hash
|
||||
@@ -79,7 +79,7 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
||||
struct frame_metadata *frame_metadata;
|
||||
flags |= PAL_USER;
|
||||
|
||||
lock_acquire (&lru_lock);
|
||||
lock_acquire (&ftable_lock);
|
||||
void *frame = palloc_get_page (flags);
|
||||
|
||||
/* If a frame couldn't be allocated we must be out of main memory. Thus,
|
||||
@@ -94,15 +94,35 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
||||
struct frame_metadata *victim = get_victim ();
|
||||
ASSERT (victim != NULL); /* get_victim () should never return null. */
|
||||
|
||||
/* 2. Swap out victim into disk. */
|
||||
page_insert_swapped (victim->upage, victim->frame, victim->owner);
|
||||
/* 2. Handle victim page writing based on its type. */
|
||||
struct page_entry *victim_page = page_get (thread_current (), victim->upage);
|
||||
if (victim_page != NULL && victim_page->type == PAGE_MMAP)
|
||||
{
|
||||
/* If it was a memory-mapped file page, we just write it back
|
||||
to the file if it was dirty. */
|
||||
if (pagedir_is_dirty(owner->pagedir, victim->upage))
|
||||
{
|
||||
lock_acquire (&filesys_lock);
|
||||
file_write_at (victim_page->file, victim->upage,
|
||||
victim_page->read_bytes, victim_page->offset);
|
||||
lock_release (&filesys_lock);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
/* Otherwise, insert the page into swap. */
|
||||
page_insert_swapped (victim->upage, victim->frame, &victim->owners);
|
||||
}
|
||||
|
||||
/* Free victim's owners. */
|
||||
free_owners (&victim->owners);
|
||||
|
||||
/* If zero flag is set, zero out the victim page. */
|
||||
if (flags & PAL_ZERO)
|
||||
memset (victim->frame, 0, PGSIZE);
|
||||
|
||||
/* 3. Indicate that the new frame's metadata will be stored
|
||||
inside the same structure that stored the victim's metadata.
|
||||
inside the same structure that stored the victim's metadata.frame.c
|
||||
As both the new frame and the victim frame share the same kernel
|
||||
virtual address, the hash map need not be updated, and neither
|
||||
the list_elem value as both share the same lru_list position. */
|
||||
@@ -113,9 +133,11 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
||||
we must update the frame table with a new entry, and grow lru_list. */
|
||||
else
|
||||
{
|
||||
/* Must own lru_lock here, as otherwise there is a race condition
|
||||
/* Must own ftable_lock here, as otherwise there is a race condition
|
||||
with next_victim either being NULL or uninitialized. */
|
||||
frame_metadata = malloc (sizeof (struct frame_metadata));
|
||||
if (frame_metadata == NULL)
|
||||
PANIC ("Couldn't allocate memory for frame metadata!\n");
|
||||
frame_metadata->frame = frame;
|
||||
|
||||
/* Newly allocated frames are pushed to the back of the circular queue
|
||||
@@ -135,34 +157,44 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
||||
hash_insert (&frame_table, &frame_metadata->hash_elem);
|
||||
}
|
||||
|
||||
struct frame_owner *frame_owner = malloc (sizeof (struct frame_owner));
|
||||
if (frame_owner == NULL)
|
||||
PANIC ("Couldn't allocate memory for frame owner!\n");
|
||||
frame_owner->owner = owner;
|
||||
list_init (&frame_metadata->owners);
|
||||
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
||||
frame_metadata->upage = upage;
|
||||
frame_metadata->owner = owner;
|
||||
frame_metadata->pinned = false;
|
||||
lock_release (&lru_lock);
|
||||
|
||||
lock_release (&ftable_lock);
|
||||
return frame_metadata->frame;
|
||||
}
|
||||
|
||||
void
|
||||
frame_pin (void *frame)
|
||||
{
|
||||
ASSERT (frame != NULL);
|
||||
lock_acquire (&ftable_lock);
|
||||
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
||||
if (frame_metadata == NULL)
|
||||
PANIC ("Attempted to pin a frame at an unallocated kernel address '%p'\n",
|
||||
frame);
|
||||
|
||||
frame_metadata->pinned = true;
|
||||
lock_release (&ftable_lock);
|
||||
}
|
||||
|
||||
void
|
||||
frame_unpin (void *frame)
|
||||
{
|
||||
ASSERT (frame != NULL);
|
||||
lock_acquire (&ftable_lock);
|
||||
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
||||
if (frame_metadata == NULL)
|
||||
PANIC ("Attempted to unpin a frame at an unallocated kernel address '%p'\n",
|
||||
frame);
|
||||
|
||||
frame_metadata->pinned = false;
|
||||
lock_release (&ftable_lock);
|
||||
}
|
||||
|
||||
/* Attempt to deallocate a frame for a user process by removing it from the
|
||||
@@ -171,18 +203,15 @@ frame_unpin (void *frame)
|
||||
void
|
||||
frame_free (void *frame)
|
||||
{
|
||||
struct frame_metadata key_metadata;
|
||||
key_metadata.frame = frame;
|
||||
struct frame_metadata *frame_metadata = frame_metadata_find (frame);
|
||||
if (frame_metadata == NULL)
|
||||
PANIC ("Attempted to free a frame at kernel address %p, "
|
||||
"but this address is not allocated!\n",
|
||||
frame);
|
||||
|
||||
struct hash_elem *e =
|
||||
hash_delete (&frame_table, &key_metadata.hash_elem);
|
||||
if (e == NULL) PANIC ("Attempted to free a frame at kernel address %p, "
|
||||
"but this address is not allocated!\n", frame);
|
||||
|
||||
struct frame_metadata *frame_metadata =
|
||||
hash_entry (e, struct frame_metadata, hash_elem);
|
||||
|
||||
lock_acquire (&lru_lock);
|
||||
free_owners (&frame_metadata->owners);
|
||||
lock_acquire (&ftable_lock);
|
||||
hash_delete (&frame_table, &frame_metadata->hash_elem);
|
||||
list_remove (&frame_metadata->list_elem);
|
||||
|
||||
/* If we're freeing the frame marked as the next victim, update
|
||||
@@ -195,43 +224,125 @@ frame_free (void *frame)
|
||||
else
|
||||
next_victim = lru_next (next_victim);
|
||||
}
|
||||
lock_release (&lru_lock);
|
||||
lock_release (&ftable_lock);
|
||||
|
||||
free (frame_metadata);
|
||||
palloc_free_page (frame);
|
||||
}
|
||||
|
||||
/* TODO: Account for page aliases when checking accessed bit. */
|
||||
/* Add a thread to a frame's frame_metadata owners list. */
|
||||
bool
|
||||
frame_owner_insert (void *frame, struct thread *owner)
|
||||
{
|
||||
struct frame_metadata *frame_metadata = frame_metadata_find (frame);
|
||||
if (frame_metadata == NULL)
|
||||
return false;
|
||||
|
||||
struct frame_owner *frame_owner = malloc (sizeof (struct frame_owner));
|
||||
if (frame_owner == NULL)
|
||||
return false;
|
||||
|
||||
frame_owner->owner = owner;
|
||||
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
||||
return true;
|
||||
}
|
||||
|
||||
/* Remove and deallocate a frame owner from the frame_metadata owners list.
|
||||
*/
|
||||
void
|
||||
frame_owner_remove (void *frame, struct thread *owner)
|
||||
{
|
||||
struct frame_metadata *frame_metadata = frame_metadata_find (frame);
|
||||
if (frame_metadata == NULL)
|
||||
PANIC ("Attempted to remove an owner from a frame at kernel "
|
||||
"address %p, but this address is not allocated!\n",
|
||||
frame);
|
||||
|
||||
struct list_elem *oe;
|
||||
for (oe = list_begin (&frame_metadata->owners);
|
||||
oe != list_end (&frame_metadata->owners);)
|
||||
{
|
||||
struct frame_owner *frame_owner
|
||||
= list_entry (oe, struct frame_owner, elem);
|
||||
|
||||
oe = list_next (oe);
|
||||
if (frame_owner->owner == owner)
|
||||
{
|
||||
list_remove (&frame_owner->elem);
|
||||
free (frame_owner);
|
||||
return;
|
||||
}
|
||||
}
|
||||
NOT_REACHED ();
|
||||
}
|
||||
|
||||
/* Find a frame_metadata entry in the frame table. */
|
||||
static struct frame_metadata *
|
||||
frame_metadata_find (void *frame)
|
||||
{
|
||||
struct frame_metadata key_metadata;
|
||||
key_metadata.frame = frame;
|
||||
|
||||
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
||||
if (e == NULL)
|
||||
return NULL;
|
||||
|
||||
return hash_entry (e, struct frame_metadata, hash_elem);
|
||||
}
|
||||
|
||||
/* A pre-condition for calling this function is that the calling thread
|
||||
owns lru_lock and that lru_list is non-empty. */
|
||||
owns ftable_lock and that lru_list is non-empty. */
|
||||
static struct frame_metadata *
|
||||
get_victim (void)
|
||||
{
|
||||
struct list_elem *e = next_victim;
|
||||
struct list_elem *ve = next_victim;
|
||||
struct frame_metadata *frame_metadata;
|
||||
uint32_t *pd;
|
||||
void *upage;
|
||||
for (;;)
|
||||
bool found = false;
|
||||
while (!found)
|
||||
{
|
||||
frame_metadata = list_entry (e, struct frame_metadata, list_elem);
|
||||
pd = frame_metadata->owner->pagedir;
|
||||
upage = frame_metadata->upage;
|
||||
e = lru_next (e);
|
||||
frame_metadata = list_entry (ve, struct frame_metadata, list_elem);
|
||||
ve = lru_next (ve);
|
||||
struct list_elem *oe;
|
||||
|
||||
/* Skip pinned frames */
|
||||
if (frame_metadata->pinned)
|
||||
continue;
|
||||
|
||||
if (!pagedir_is_accessed (pd, upage))
|
||||
break;
|
||||
/* Returns once a frame that was not accessed by any owner is found. */
|
||||
found = true;
|
||||
for (oe = list_begin (&frame_metadata->owners);
|
||||
oe != list_end (&frame_metadata->owners); oe = list_next (oe))
|
||||
{
|
||||
struct frame_owner *frame_owner
|
||||
= list_entry (oe, struct frame_owner, elem);
|
||||
uint32_t *pd = frame_owner->owner->pagedir;
|
||||
void *upage = frame_metadata->upage;
|
||||
|
||||
pagedir_set_accessed (pd, upage, false);
|
||||
if (pagedir_is_accessed (pd, upage))
|
||||
{
|
||||
found = false;
|
||||
pagedir_set_accessed (pd, upage, false);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
next_victim = e;
|
||||
next_victim = ve;
|
||||
return frame_metadata;
|
||||
}
|
||||
|
||||
static void
|
||||
free_owners (struct list *owners)
|
||||
{
|
||||
struct list_elem *oe;
|
||||
for (oe = list_begin (owners); oe != list_end (owners);)
|
||||
{
|
||||
struct frame_owner *frame_owner
|
||||
= list_entry (oe, struct frame_owner, elem);
|
||||
oe = list_remove (oe);
|
||||
free (frame_owner);
|
||||
}
|
||||
}
|
||||
|
||||
/* Hash function for frame metadata, used for storing entries in the
|
||||
frame table. */
|
||||
unsigned
|
||||
@@ -266,7 +377,6 @@ frame_metadata_get (void *frame)
|
||||
|
||||
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
||||
if (e == NULL) return NULL;
|
||||
|
||||
return hash_entry (e, struct frame_metadata, hash_elem);
|
||||
}
|
||||
|
||||
|
||||
@@ -4,10 +4,24 @@
|
||||
#include "threads/thread.h"
|
||||
#include "threads/palloc.h"
|
||||
|
||||
struct frame_owner
|
||||
{
|
||||
struct thread *owner; /* The thread that owns the frame. */
|
||||
struct list_elem elem; /* List element for the list of owners. */
|
||||
};
|
||||
|
||||
/* Synchronisation variables. */
|
||||
/* Protects access to the frame table and its related components. */
|
||||
struct lock ftable_lock;
|
||||
|
||||
void frame_init (void);
|
||||
|
||||
void *frame_alloc (enum palloc_flags, void *, struct thread *);
|
||||
void frame_pin (void *frame);
|
||||
void frame_unpin (void *frame);
|
||||
void frame_free (void *frame);
|
||||
|
||||
bool frame_owner_insert (void *frame, struct thread *owner);
|
||||
void frame_owner_remove (void *frame, struct thread *owner);
|
||||
|
||||
#endif /* vm/frame.h */
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
#include "mmap.h"
|
||||
#include "page.h"
|
||||
#include "threads/thread.h"
|
||||
#include "threads/vaddr.h"
|
||||
#include "threads/malloc.h"
|
||||
#include "userprog/syscall.h"
|
||||
@@ -66,26 +67,27 @@ mmap_unmap (struct mmap_entry *mmap)
|
||||
if necessary. */
|
||||
off_t length = file_length (mmap->file);
|
||||
for (off_t ofs = 0; ofs < length; ofs += PGSIZE)
|
||||
{
|
||||
void *upage = mmap->upage + ofs;
|
||||
|
||||
/* Get the SPT page entry for this page. */
|
||||
struct page_entry *page = page_get(upage);
|
||||
if (page == NULL)
|
||||
continue;
|
||||
|
||||
/* Write the page back to the file if it is dirty. */
|
||||
if (pagedir_is_dirty (thread_current ()->pagedir, upage))
|
||||
{
|
||||
lock_acquire (&filesys_lock);
|
||||
file_write_at (mmap->file, upage, page->read_bytes, ofs);
|
||||
lock_release (&filesys_lock);
|
||||
void *upage = mmap->upage + ofs;
|
||||
|
||||
/* Get the SPT page entry for this page. */
|
||||
struct page_entry *page = page_get(thread_current (), upage);
|
||||
if (page == NULL)
|
||||
continue;
|
||||
|
||||
/* Write the page back to the file if it is dirty. */
|
||||
if (pagedir_is_dirty (thread_current ()->pagedir, upage))
|
||||
{
|
||||
lock_acquire (&filesys_lock);
|
||||
file_write_at (mmap->file, upage, page->read_bytes, ofs);
|
||||
lock_release (&filesys_lock);
|
||||
}
|
||||
|
||||
/* Remove the page from the supplemental page table. */
|
||||
hash_delete (&thread_current ()->pages, &page->elem);
|
||||
}
|
||||
|
||||
/* Remove the page from the supplemental page table. */
|
||||
hash_delete (&thread_current ()->pages, &page->elem);
|
||||
}
|
||||
|
||||
/* Close the file and free the mmap entry. */
|
||||
file_close (mmap->file);
|
||||
free (mmap);
|
||||
}
|
||||
|
||||
333
src/vm/page.c
333
src/vm/page.c
@@ -6,18 +6,44 @@
|
||||
#include "threads/pte.h"
|
||||
#include "threads/malloc.h"
|
||||
#include "threads/palloc.h"
|
||||
#include "threads/synch.h"
|
||||
#include "devices/swap.h"
|
||||
#include "userprog/process.h"
|
||||
#include "userprog/pagedir.h"
|
||||
#include "vm/frame.h"
|
||||
|
||||
#define SWAP_FLAG_BIT 9
|
||||
#define SHARED_FLAG_BIT 10
|
||||
#define ADDR_START_BIT 12
|
||||
|
||||
struct hash shared_file_pages;
|
||||
struct lock shared_file_pages_lock;
|
||||
|
||||
static unsigned page_hash (const struct hash_elem *e, void *aux UNUSED);
|
||||
static bool page_less (const struct hash_elem *a_, const struct hash_elem *b_,
|
||||
void *aux UNUSED);
|
||||
|
||||
static void page_flag_shared (struct thread *owner, void *upage, bool shared);
|
||||
static unsigned shared_file_page_hash (const struct hash_elem *e,
|
||||
void *aux UNUSED);
|
||||
static bool shared_file_page_less (const struct hash_elem *a_,
|
||||
const struct hash_elem *b_,
|
||||
void *aux UNUSED);
|
||||
static struct shared_file_page *shared_file_page_get (struct file *file,
|
||||
void *upage);
|
||||
|
||||
/* Initialise a supplementary page table. */
|
||||
bool
|
||||
init_pages (struct hash *pages)
|
||||
{
|
||||
ASSERT (pages != NULL);
|
||||
return hash_init (pages, page_hash, page_less, NULL);
|
||||
}
|
||||
|
||||
/* Hashing function needed for the SPT table. Returns a hash for an entry,
|
||||
based on its upage. */
|
||||
unsigned
|
||||
page_hash (const struct hash_elem *e, UNUSED void *aux)
|
||||
static unsigned
|
||||
page_hash (const struct hash_elem *e, void *aux UNUSED)
|
||||
{
|
||||
struct page_entry *page = hash_entry (e, struct page_entry, elem);
|
||||
return hash_ptr (page->upage);
|
||||
@@ -25,7 +51,7 @@ page_hash (const struct hash_elem *e, UNUSED void *aux)
|
||||
|
||||
/* Comparator function for the SPT table. Compares two entries based on their
|
||||
upages. */
|
||||
bool
|
||||
static bool
|
||||
page_less (const struct hash_elem *a_, const struct hash_elem *b_,
|
||||
void *aux UNUSED)
|
||||
{
|
||||
@@ -43,37 +69,62 @@ static void page_set_swap (struct thread *owner, uint32_t *pte,
|
||||
/* Swap out 'owner' process's 'upage' stored at 'kpage'. Then, allocate and
|
||||
insert a new page entry into the user process thread's SPT representing
|
||||
this swapped out page. */
|
||||
struct page_entry *
|
||||
page_insert_swapped (void *upage, void *kpage, struct thread *owner)
|
||||
bool
|
||||
page_insert_swapped (void *upage, void *kpage, struct list *owners)
|
||||
{
|
||||
/* 1. Initialize swapped page entry. */
|
||||
struct page_entry *page = page_get (upage);
|
||||
if (page == NULL)
|
||||
struct file *exec_file = NULL;
|
||||
struct list_elem *e;
|
||||
for (e = list_begin (owners); e != list_end (owners); e = list_next (e))
|
||||
{
|
||||
page = malloc (sizeof (struct page_entry));
|
||||
struct thread *owner = list_entry (e, struct frame_owner, elem)->owner;
|
||||
uint32_t *pte = lookup_page (owner->pagedir, upage, false);
|
||||
if (exec_file != NULL || page_is_shared_pte (pte))
|
||||
{
|
||||
ASSERT (page_is_shared_pte (pte));
|
||||
pagedir_clear_page (owner->pagedir, upage);
|
||||
exec_file = owner->exec_file;
|
||||
ASSERT (exec_file != NULL);
|
||||
continue;
|
||||
}
|
||||
ASSERT (list_size (owners) == 1);
|
||||
|
||||
/* 1. Initialize swapped page entry. */
|
||||
struct page_entry *page = page_get (owner, upage);
|
||||
lock_acquire (&owner->pages_lock);
|
||||
if (page == NULL)
|
||||
return NULL;
|
||||
page->upage = upage;
|
||||
lock_init (&page->lock);
|
||||
hash_insert (&owner->pages, &page->elem);
|
||||
{
|
||||
page = malloc (sizeof (struct page_entry));
|
||||
if (page == NULL)
|
||||
return NULL;
|
||||
page->upage = upage;
|
||||
lock_init (&page->lock);
|
||||
hash_insert (&owner->pages, &page->elem);
|
||||
}
|
||||
|
||||
/* Mark page as 'swapped' and flag the page directory as having
|
||||
been modified *before* eviction begins to prevent the owner of the
|
||||
victim page from accessing/modifying it mid-eviction. */
|
||||
/* TODO: We need to stop the process from destroying pagedir mid-eviction,
|
||||
as this could render the page table entry invalid. */
|
||||
page_flag_swap (pte, true);
|
||||
lock_acquire (&page->lock);
|
||||
pagedir_clear_page (owner->pagedir, upage);
|
||||
|
||||
size_t swap_slot = swap_out (kpage);
|
||||
page_set_swap (owner, pte, swap_slot);
|
||||
|
||||
lock_release (&page->lock);
|
||||
lock_release (&owner->pages_lock);
|
||||
}
|
||||
|
||||
/* Mark page as 'swapped' and flag the page directory as having
|
||||
been modified *before* eviction begins to prevent the owner of the
|
||||
victim page from accessing/modifying it mid-eviction. */
|
||||
/* TODO: We need to stop the process from destroying pagedir mid-eviction,
|
||||
as this could render the page table entry invalid. */
|
||||
uint32_t *pte = lookup_page (owner->pagedir, upage, false);
|
||||
|
||||
page_flag_swap (pte, true);
|
||||
lock_acquire (&page->lock);
|
||||
pagedir_clear_page (owner->pagedir, upage);
|
||||
|
||||
size_t swap_slot = swap_out (kpage);
|
||||
page_set_swap (owner, pte, swap_slot);
|
||||
|
||||
lock_release (&page->lock);
|
||||
return page;
|
||||
if (exec_file != NULL)
|
||||
{
|
||||
lock_acquire (&shared_file_pages_lock);
|
||||
struct shared_file_page *sfp = shared_file_page_get (exec_file, upage);
|
||||
sfp->frame = NULL;
|
||||
sfp->swap_slot = swap_out (kpage);
|
||||
lock_release (&shared_file_pages_lock);
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
/* Allocate and insert a new page entry into the user process thread's
|
||||
@@ -83,6 +134,16 @@ page_insert_file (struct file *file, off_t ofs, void *upage,
|
||||
uint32_t read_bytes, uint32_t zero_bytes, bool writable,
|
||||
enum page_type type)
|
||||
{
|
||||
/* If page exists, just update it. */
|
||||
struct page_entry *existing = page_get (thread_current (), upage);
|
||||
if (existing != NULL)
|
||||
{
|
||||
ASSERT (existing->read_bytes == read_bytes);
|
||||
ASSERT (existing->zero_bytes == zero_bytes);
|
||||
existing->writable = existing->writable || writable;
|
||||
return existing;
|
||||
}
|
||||
|
||||
struct page_entry *page = malloc(sizeof (struct page_entry));
|
||||
if (page == NULL)
|
||||
return NULL;
|
||||
@@ -96,20 +157,25 @@ page_insert_file (struct file *file, off_t ofs, void *upage,
|
||||
page->writable = writable;
|
||||
lock_init (&page->lock);
|
||||
|
||||
hash_insert (&thread_current ()->pages, &page->elem);
|
||||
struct thread *t = thread_current ();
|
||||
lock_acquire (&t->pages_lock);
|
||||
hash_insert (&t->pages, &page->elem);
|
||||
lock_release (&t->pages_lock);
|
||||
return page;
|
||||
}
|
||||
|
||||
/* Gets a page_entry from the starting address of the page. Returns NULL if no
|
||||
such page_entry exists in the hash map.*/
|
||||
struct page_entry *
|
||||
page_get (void *upage)
|
||||
page_get (struct thread *thread, void *upage)
|
||||
{
|
||||
struct page_entry fake_page_entry;
|
||||
fake_page_entry.upage = upage;
|
||||
|
||||
lock_acquire (&thread->pages_lock);
|
||||
struct hash_elem *e
|
||||
= hash_find (&thread_current ()->pages, &fake_page_entry.elem);
|
||||
= hash_find (&thread->pages, &fake_page_entry.elem);
|
||||
lock_release (&thread->pages_lock);
|
||||
if (e == NULL)
|
||||
return NULL;
|
||||
|
||||
@@ -117,20 +183,70 @@ page_get (void *upage)
|
||||
}
|
||||
|
||||
bool
|
||||
page_load_file (struct page_entry *page, bool writable)
|
||||
page_load_file (struct page_entry *page)
|
||||
{
|
||||
/* Allocate a frame for the page. If a frame allocation fails, then
|
||||
frame_alloc should try to evict a page. If it is still NULL, the OS
|
||||
panics as this should not happen if eviction is working correctly. */
|
||||
struct thread *t = thread_current ();
|
||||
bool shareable = !page->writable && file_compare (page->file, t->exec_file);
|
||||
if (shareable)
|
||||
{
|
||||
lock_acquire (&shared_file_pages_lock);
|
||||
struct shared_file_page *sfp
|
||||
= shared_file_page_get (page->file, page->upage);
|
||||
|
||||
if (sfp != NULL)
|
||||
{
|
||||
/* Frame exists, just install it. */
|
||||
if (sfp->frame != NULL)
|
||||
{
|
||||
if (!install_page (page->upage, sfp->frame, page->writable))
|
||||
{
|
||||
lock_release (&shared_file_pages_lock);
|
||||
return false;
|
||||
}
|
||||
frame_owner_insert (sfp->frame, t);
|
||||
}
|
||||
|
||||
/* Otherwise, shared page is in swap. Load it. */
|
||||
else
|
||||
{
|
||||
void *frame = frame_alloc (PAL_USER, page->upage, t);
|
||||
if (frame == NULL)
|
||||
PANIC (
|
||||
"Could not allocate a frame to load page into memory.");
|
||||
swap_in (frame, sfp->swap_slot);
|
||||
|
||||
if (!install_page (page->upage, frame, false))
|
||||
{
|
||||
frame_free (frame);
|
||||
lock_release (&shared_file_pages_lock);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
page_flag_shared (t, page->upage, true);
|
||||
if (page->type != PAGE_SHARED)
|
||||
{
|
||||
sfp->ref_count++;
|
||||
page->type = PAGE_SHARED;
|
||||
}
|
||||
lock_release (&shared_file_pages_lock);
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
void *frame = frame_alloc (PAL_USER, page->upage, t);
|
||||
pagedir_set_accessed (t->pagedir, page->upage, true);
|
||||
if (frame == NULL)
|
||||
PANIC ("Could not allocate a frame to load page into memory.");
|
||||
|
||||
/* Map the page to the frame. */
|
||||
if (!install_page (page->upage, frame, writable))
|
||||
if (!install_page (page->upage, frame, page->writable))
|
||||
{
|
||||
if (shareable)
|
||||
lock_release (&shared_file_pages_lock);
|
||||
frame_free (frame);
|
||||
return false;
|
||||
}
|
||||
@@ -141,6 +257,8 @@ page_load_file (struct page_entry *page, bool writable)
|
||||
file_seek (page->file, page->offset);
|
||||
if (file_read (page->file, frame, page->read_bytes) != (int) page->read_bytes)
|
||||
{
|
||||
if (shareable)
|
||||
lock_release (&shared_file_pages_lock);
|
||||
frame_free (frame);
|
||||
return false;
|
||||
}
|
||||
@@ -148,6 +266,27 @@ page_load_file (struct page_entry *page, bool writable)
|
||||
/* Zero out the remaining bytes in the frame. */
|
||||
memset (frame + page->read_bytes, 0, page->zero_bytes);
|
||||
|
||||
/* If file page is read-only, make it shared. */
|
||||
if (shareable)
|
||||
{
|
||||
struct shared_file_page *sfp = malloc (sizeof (struct shared_file_page));
|
||||
if (sfp == NULL)
|
||||
{
|
||||
lock_release (&shared_file_pages_lock);
|
||||
frame_free (frame);
|
||||
return false;
|
||||
}
|
||||
sfp->file = page->file;
|
||||
sfp->upage = page->upage;
|
||||
sfp->frame = frame;
|
||||
sfp->swap_slot = 0;
|
||||
sfp->ref_count = 1;
|
||||
hash_insert (&shared_file_pages, &sfp->elem);
|
||||
page_flag_shared (t, page->upage, true);
|
||||
page->type = PAGE_SHARED;
|
||||
lock_release (&shared_file_pages_lock);
|
||||
}
|
||||
|
||||
/* Mark the page as loaded successfully. */
|
||||
return true;
|
||||
}
|
||||
@@ -157,18 +296,39 @@ page_load_file (struct page_entry *page, bool writable)
|
||||
void
|
||||
page_cleanup (struct hash_elem *e, void *aux UNUSED)
|
||||
{
|
||||
free (hash_entry (e, struct page_entry, elem));
|
||||
struct page_entry *page = hash_entry (e, struct page_entry, elem);
|
||||
if (page->type == PAGE_SHARED)
|
||||
{
|
||||
lock_acquire (&shared_file_pages_lock);
|
||||
struct shared_file_page *sfp
|
||||
= shared_file_page_get (page->file, page->upage);
|
||||
ASSERT (sfp != NULL);
|
||||
if (sfp->frame != NULL)
|
||||
frame_owner_remove (sfp->frame, thread_current ());
|
||||
sfp->ref_count--;
|
||||
if (sfp->ref_count == 0)
|
||||
{
|
||||
hash_delete (&shared_file_pages, &sfp->elem);
|
||||
if (sfp->frame != NULL)
|
||||
frame_free (sfp->frame);
|
||||
else
|
||||
swap_drop (sfp->swap_slot);
|
||||
free (sfp);
|
||||
}
|
||||
lock_release (&shared_file_pages_lock);
|
||||
}
|
||||
free (page);
|
||||
}
|
||||
|
||||
/* Flags the provided page table entry as representing a swapped out page. */
|
||||
void
|
||||
page_flag_swap (uint32_t *pte, bool set)
|
||||
{
|
||||
if (set)
|
||||
*pte |= (1 << SWAP_FLAG_BIT);
|
||||
else
|
||||
*pte &= ~(1 << SWAP_FLAG_BIT);
|
||||
}
|
||||
{
|
||||
if (set)
|
||||
*pte |= (1 << SWAP_FLAG_BIT);
|
||||
else
|
||||
*pte &= ~(1 << SWAP_FLAG_BIT);
|
||||
}
|
||||
|
||||
/* Sets the address bits of the page table entry to the provided swap slot
|
||||
value. To be used for later retrieval of the swap slot when page faulting. */
|
||||
@@ -190,8 +350,14 @@ bool
|
||||
page_in_swap (struct thread *owner, void *upage)
|
||||
{
|
||||
uint32_t *pte = lookup_page (owner->pagedir, upage, false);
|
||||
return pte != NULL &&
|
||||
(*pte & (1 << SWAP_FLAG_BIT)) != 0;
|
||||
return page_in_swap_pte (pte);
|
||||
}
|
||||
|
||||
/* Returns true iff the page table entry is marked to be in the swap disk. */
|
||||
bool
|
||||
page_in_swap_pte (uint32_t *pte)
|
||||
{
|
||||
return pte != NULL && (*pte & (1 << SWAP_FLAG_BIT)) != 0;
|
||||
}
|
||||
|
||||
/* Given that the page with user address 'upage' owned by 'owner' is flagged
|
||||
@@ -209,3 +375,82 @@ page_get_swap (struct thread *owner, void *upage)
|
||||
page_flag_swap (pte, false);
|
||||
return ((*pte & PTE_ADDR) >> ADDR_START_BIT);
|
||||
}
|
||||
|
||||
/* Returns the swap slot stored in a PTE. */
|
||||
size_t
|
||||
page_get_swap_pte (uint32_t *pte)
|
||||
{
|
||||
ASSERT (pte != NULL);
|
||||
ASSERT ((*pte & PTE_P) == 0);
|
||||
return ((*pte & PTE_ADDR) >> ADDR_START_BIT);
|
||||
}
|
||||
|
||||
/* Flags the provided page table entry as representing a shared page. */
|
||||
static void
|
||||
page_flag_shared (struct thread *owner, void *upage, bool shared)
|
||||
{
|
||||
uint32_t *pte = lookup_page (owner->pagedir, upage, false);
|
||||
ASSERT (pte != NULL);
|
||||
|
||||
if (shared)
|
||||
*pte |= (1 << SHARED_FLAG_BIT);
|
||||
else
|
||||
*pte &= ~(1 << SHARED_FLAG_BIT);
|
||||
}
|
||||
|
||||
/* Returns true iff the page table entry is marked to be shared. */
|
||||
bool
|
||||
page_is_shared_pte (uint32_t *pte)
|
||||
{
|
||||
return pte != NULL && (*pte & (1 << SHARED_FLAG_BIT)) != 0;
|
||||
}
|
||||
|
||||
/* Initializes the shared file pages hash table. */
|
||||
void
|
||||
shared_file_pages_init ()
|
||||
{
|
||||
if (!hash_init (&shared_file_pages, shared_file_page_hash,
|
||||
shared_file_page_less, NULL))
|
||||
PANIC ("Failed to initialize shared file pages hash table.");
|
||||
lock_init (&shared_file_pages_lock);
|
||||
}
|
||||
|
||||
/* Hash function for shared file pages, used for storing entries in the
|
||||
shared file pages table. */
|
||||
static unsigned
|
||||
shared_file_page_hash (const struct hash_elem *e, void *aux UNUSED)
|
||||
{
|
||||
struct shared_file_page *sfp = hash_entry (e, struct shared_file_page, elem);
|
||||
void *inode = file_get_inode (sfp->file);
|
||||
void *upage = sfp->upage;
|
||||
void *bytes[2] = { inode, upage };
|
||||
return hash_bytes (bytes, sizeof (bytes));
|
||||
}
|
||||
|
||||
/* 'less_func' comparison function for shared file pages, used for comparing
|
||||
the keys of the shared file pages table. */
|
||||
static bool
|
||||
shared_file_page_less (const struct hash_elem *a_, const struct hash_elem *b_,
|
||||
void *aux UNUSED)
|
||||
{
|
||||
const struct shared_file_page *a
|
||||
= hash_entry (a_, struct shared_file_page, elem);
|
||||
const struct shared_file_page *b
|
||||
= hash_entry (b_, struct shared_file_page, elem);
|
||||
|
||||
return !file_compare (a->file, b->file) || a->upage < b->upage;
|
||||
}
|
||||
|
||||
static struct shared_file_page *
|
||||
shared_file_page_get (struct file *file, void *upage)
|
||||
{
|
||||
struct shared_file_page fake_sfp;
|
||||
fake_sfp.file = file;
|
||||
fake_sfp.upage = upage;
|
||||
|
||||
struct hash_elem *e = hash_find (&shared_file_pages, &fake_sfp.elem);
|
||||
if (e == NULL)
|
||||
return NULL;
|
||||
|
||||
return hash_entry (e, struct shared_file_page, elem);
|
||||
}
|
||||
|
||||
@@ -5,12 +5,15 @@
|
||||
#include "threads/synch.h"
|
||||
#include "filesys/off_t.h"
|
||||
|
||||
enum page_type {
|
||||
PAGE_FILE,
|
||||
PAGE_MMAP
|
||||
enum page_type
|
||||
{
|
||||
PAGE_EXECUTABLE,
|
||||
PAGE_MMAP,
|
||||
PAGE_SHARED
|
||||
};
|
||||
|
||||
struct page_entry {
|
||||
struct page_entry
|
||||
{
|
||||
enum page_type type; /* Type of Data that should go into the page */
|
||||
void *upage; /* Start Address of the User Page (Key of hash table). */
|
||||
|
||||
@@ -29,19 +32,37 @@ struct page_entry {
|
||||
struct hash_elem elem; /* An elem for the hash table. */
|
||||
};
|
||||
|
||||
unsigned page_hash (const struct hash_elem *e, void *aux);
|
||||
bool page_less (const struct hash_elem *a_, const struct hash_elem *b_,
|
||||
void *aux);
|
||||
struct page_entry *page_insert_swapped (void *upage, void* kpage,
|
||||
struct thread *owner);
|
||||
struct shared_file_page
|
||||
{
|
||||
struct file *file; /* The shared file page's source file, used for indexing
|
||||
the table. */
|
||||
void *upage; /* The shared page's upage which is the same across all process
|
||||
using it. Used for indexing the table. */
|
||||
void *frame; /* Set to the frame address of the page when it is in memory.
|
||||
Set to NULL when the page is in swap. */
|
||||
size_t swap_slot; /* Set to the swap_slot of the shared paged if it is
|
||||
currently in swap. Should not be used when frame is not
|
||||
NULL.*/
|
||||
int ref_count; /* Number of processes that are using this shared page. */
|
||||
|
||||
struct hash_elem elem; /* AN elem for the hash table. */
|
||||
};
|
||||
|
||||
bool init_pages (struct hash *pages);
|
||||
bool page_insert_swapped (void *upage, void *kpage, struct list *owners);
|
||||
struct page_entry *page_insert_file (struct file *file, off_t ofs, void *upage,
|
||||
uint32_t read_bytes, uint32_t zero_bytes,
|
||||
bool writable, enum page_type);
|
||||
struct page_entry *page_get (void *upage);
|
||||
bool page_load_file (struct page_entry *page, bool writable);
|
||||
struct page_entry *page_get (struct thread *thread, void *upage);
|
||||
bool page_load_file (struct page_entry *page);
|
||||
void page_cleanup (struct hash_elem *e, void *aux);
|
||||
|
||||
bool page_in_swap (struct thread *, void *);
|
||||
bool page_in_swap_pte (uint32_t *pte);
|
||||
size_t page_get_swap (struct thread *owner, void *upage);
|
||||
size_t page_get_swap_pte (uint32_t *pte);
|
||||
|
||||
#endif /* vm/frame.h */
|
||||
bool page_is_shared_pte (uint32_t *pte);
|
||||
void shared_file_pages_init (void);
|
||||
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user