Compare commits
20 Commits
vm/merged/
...
master
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
ad4eda5385 | ||
|
|
8d1b4c4994 | ||
|
|
07c0219058 | ||
|
|
5fbabdcec9 | ||
|
|
5e8bdc68e7 | ||
|
|
d039b59b7c | ||
|
|
29c0b93711 | ||
|
77fedd6666
|
|||
|
|
eba8c1ffa8 | ||
|
|
be696ec528 | ||
|
|
7611090253 | ||
|
|
7f058ffc90 | ||
|
c1bc70adad
|
|||
|
|
22f3b0950f | ||
|
f64b92bbfa
|
|||
|
|
3d6e30119b | ||
|
4104d2c852
|
|||
|
|
d389c15828 | ||
|
|
8ac34063d7 | ||
|
|
c68fea5249 |
@@ -38,4 +38,3 @@ test_vm:
|
|||||||
extends: .pintos_tests
|
extends: .pintos_tests
|
||||||
variables:
|
variables:
|
||||||
DIR: vm
|
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)
|
|
||||||
|
|||||||
@@ -736,6 +736,8 @@ init_thread (struct thread *t, const char *name, int nice, int priority,
|
|||||||
t->recent_cpu = recent_cpu;
|
t->recent_cpu = recent_cpu;
|
||||||
t->priority = t->base_priority;
|
t->priority = t->base_priority;
|
||||||
|
|
||||||
|
lock_init (&t->pages_lock);
|
||||||
|
|
||||||
old_level = intr_disable ();
|
old_level = intr_disable ();
|
||||||
list_push_back (&all_list, &t->allelem);
|
list_push_back (&all_list, &t->allelem);
|
||||||
intr_set_level (old_level);
|
intr_set_level (old_level);
|
||||||
|
|||||||
@@ -136,6 +136,7 @@ struct thread
|
|||||||
struct list_elem elem; /* List element. */
|
struct list_elem elem; /* List element. */
|
||||||
|
|
||||||
struct hash pages; /* Table of open user pages. */
|
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. */
|
/* Memory mapped files for user virtual memory. */
|
||||||
struct hash mmap_files; /* List of memory mapped files. */
|
struct hash mmap_files; /* List of memory mapped files. */
|
||||||
|
|||||||
@@ -181,11 +181,11 @@ page_fault (struct intr_frame *f)
|
|||||||
/* If the page fault occurred in kernel mode, then we intentionally indicate
|
/* If the page fault occurred in kernel mode, then we intentionally indicate
|
||||||
a fault (for get_user() etc). */
|
a fault (for get_user() etc). */
|
||||||
if (!user)
|
if (!user)
|
||||||
{
|
{
|
||||||
f->eip = (void *)f->eax;
|
f->eip = (void *)f->eax;
|
||||||
f->eax = 0xffffffff;
|
f->eax = 0xffffffff;
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* To implement virtual memory, delete the rest of the function
|
/* To implement virtual memory, delete the rest of the function
|
||||||
@@ -289,7 +289,7 @@ fetch_page (void *upage, bool write)
|
|||||||
bool success = false;
|
bool success = false;
|
||||||
switch (page->type) {
|
switch (page->type) {
|
||||||
case PAGE_MMAP:
|
case PAGE_MMAP:
|
||||||
case PAGE_FILE:
|
case PAGE_EXECUTABLE:
|
||||||
case PAGE_SHARED:
|
case PAGE_SHARED:
|
||||||
success = page_load_file (page);
|
success = page_load_file (page);
|
||||||
break;
|
break;
|
||||||
|
|||||||
@@ -371,7 +371,9 @@ process_exit (void)
|
|||||||
hash_destroy (&cur->open_files, fd_cleanup);
|
hash_destroy (&cur->open_files, fd_cleanup);
|
||||||
|
|
||||||
/* Clean up the thread's supplemental page table. */
|
/* Clean up the thread's supplemental page table. */
|
||||||
|
lock_acquire (&cur->pages_lock);
|
||||||
hash_destroy (&cur->pages, page_cleanup);
|
hash_destroy (&cur->pages, page_cleanup);
|
||||||
|
lock_release (&cur->pages_lock);
|
||||||
|
|
||||||
/* Close the executable file, implicitly allowing it to be written to. */
|
/* Close the executable file, implicitly allowing it to be written to. */
|
||||||
if (cur->exec_file != NULL)
|
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 */
|
/* 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,
|
if (page_insert_file (file, ofs, upage, page_read_bytes, page_zero_bytes,
|
||||||
writable, PAGE_FILE) == NULL)
|
writable, PAGE_EXECUTABLE) == NULL)
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
/* Advance. */
|
/* 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
|
/* Check and ensure that there is enough space in the user virtual memory to
|
||||||
hold the entire file. */
|
hold the entire file. */
|
||||||
for (off_t ofs = 0; ofs < file_size; ofs += PGSIZE)
|
for (off_t ofs = 0; ofs < file_size; ofs += PGSIZE)
|
||||||
{
|
|
||||||
if (page_get (thread_current (), addr + ofs) != NULL)
|
if (page_get (thread_current (), addr + ofs) != NULL)
|
||||||
return MMAP_FAILURE;
|
return MMAP_FAILURE;
|
||||||
}
|
|
||||||
|
|
||||||
/* Map the file data into the user virtual memory starting from addr. */
|
/* Map the file data into the user virtual memory starting from addr. */
|
||||||
for (off_t ofs = 0; ofs < file_size; ofs += PGSIZE)
|
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;
|
off_t zero_bytes = PGSIZE - read_bytes;
|
||||||
|
|
||||||
if (page_insert_file (file, ofs, addr + ofs, read_bytes, zero_bytes, true,
|
if (page_insert_file (file, ofs, addr + ofs, read_bytes, zero_bytes, true,
|
||||||
PAGE_FILE) == NULL)
|
PAGE_MMAP) == NULL)
|
||||||
return MMAP_FAILURE;
|
return MMAP_FAILURE;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -482,7 +481,6 @@ syscall_mmap (int fd, void *addr)
|
|||||||
if (mmap == NULL)
|
if (mmap == NULL)
|
||||||
return MMAP_FAILURE;
|
return MMAP_FAILURE;
|
||||||
|
|
||||||
|
|
||||||
return mmap->mapping;
|
return mmap->mapping;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -28,9 +28,6 @@ struct list lru_list;
|
|||||||
victim. Otherwise, the next element in the queue is similarly considered. */
|
victim. Otherwise, the next element in the queue is similarly considered. */
|
||||||
struct list_elem *next_victim = NULL;
|
struct list_elem *next_victim = NULL;
|
||||||
|
|
||||||
/* Synchronisation variables. */
|
|
||||||
/* Protects access to 'lru_list'. */
|
|
||||||
struct lock lru_lock;
|
|
||||||
|
|
||||||
struct frame_metadata
|
struct frame_metadata
|
||||||
{
|
{
|
||||||
@@ -43,8 +40,8 @@ struct frame_metadata
|
|||||||
within 'frame_table', whose key is the
|
within 'frame_table', whose key is the
|
||||||
kernel virtual address of the frame. */
|
kernel virtual address of the frame. */
|
||||||
struct list_elem list_elem; /* Tracks the position of the frame metadata
|
struct list_elem list_elem; /* Tracks the position of the frame metadata
|
||||||
in either the 'active' or 'inactive' list,
|
within 'lru_list', so a victim can be
|
||||||
so a victim can be chosen for eviction. */
|
chosen for eviction. */
|
||||||
};
|
};
|
||||||
|
|
||||||
hash_hash_func frame_metadata_hash;
|
hash_hash_func frame_metadata_hash;
|
||||||
@@ -66,7 +63,7 @@ frame_init (void)
|
|||||||
hash_init (&frame_table, frame_metadata_hash, frame_metadata_less, NULL);
|
hash_init (&frame_table, frame_metadata_hash, frame_metadata_less, NULL);
|
||||||
|
|
||||||
list_init (&lru_list);
|
list_init (&lru_list);
|
||||||
lock_init (&lru_lock);
|
lock_init (&ftable_lock);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* TODO: Consider synchronisation more closely (i.e. just for hash
|
/* TODO: Consider synchronisation more closely (i.e. just for hash
|
||||||
@@ -82,7 +79,7 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
|||||||
struct frame_metadata *frame_metadata;
|
struct frame_metadata *frame_metadata;
|
||||||
flags |= PAL_USER;
|
flags |= PAL_USER;
|
||||||
|
|
||||||
lock_acquire (&lru_lock);
|
lock_acquire (&ftable_lock);
|
||||||
void *frame = palloc_get_page (flags);
|
void *frame = palloc_get_page (flags);
|
||||||
|
|
||||||
/* If a frame couldn't be allocated we must be out of main memory. Thus,
|
/* If a frame couldn't be allocated we must be out of main memory. Thus,
|
||||||
@@ -125,7 +122,7 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
|||||||
memset (victim->frame, 0, PGSIZE);
|
memset (victim->frame, 0, PGSIZE);
|
||||||
|
|
||||||
/* 3. Indicate that the new frame's metadata will be stored
|
/* 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
|
As both the new frame and the victim frame share the same kernel
|
||||||
virtual address, the hash map need not be updated, and neither
|
virtual address, the hash map need not be updated, and neither
|
||||||
the list_elem value as both share the same lru_list position. */
|
the list_elem value as both share the same lru_list position. */
|
||||||
@@ -136,7 +133,7 @@ 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. */
|
we must update the frame table with a new entry, and grow lru_list. */
|
||||||
else
|
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. */
|
with next_victim either being NULL or uninitialized. */
|
||||||
frame_metadata = malloc (sizeof (struct frame_metadata));
|
frame_metadata = malloc (sizeof (struct frame_metadata));
|
||||||
if (frame_metadata == NULL)
|
if (frame_metadata == NULL)
|
||||||
@@ -168,30 +165,36 @@ frame_alloc (enum palloc_flags flags, void *upage, struct thread *owner)
|
|||||||
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
||||||
frame_metadata->upage = upage;
|
frame_metadata->upage = upage;
|
||||||
frame_metadata->pinned = false;
|
frame_metadata->pinned = false;
|
||||||
lock_release (&lru_lock);
|
lock_release (&ftable_lock);
|
||||||
return frame_metadata->frame;
|
return frame_metadata->frame;
|
||||||
}
|
}
|
||||||
|
|
||||||
void
|
void
|
||||||
frame_pin (void *frame)
|
frame_pin (void *frame)
|
||||||
{
|
{
|
||||||
|
ASSERT (frame != NULL);
|
||||||
|
lock_acquire (&ftable_lock);
|
||||||
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
||||||
if (frame_metadata == NULL)
|
if (frame_metadata == NULL)
|
||||||
PANIC ("Attempted to pin a frame at an unallocated kernel address '%p'\n",
|
PANIC ("Attempted to pin a frame at an unallocated kernel address '%p'\n",
|
||||||
frame);
|
frame);
|
||||||
|
|
||||||
frame_metadata->pinned = true;
|
frame_metadata->pinned = true;
|
||||||
|
lock_release (&ftable_lock);
|
||||||
}
|
}
|
||||||
|
|
||||||
void
|
void
|
||||||
frame_unpin (void *frame)
|
frame_unpin (void *frame)
|
||||||
{
|
{
|
||||||
|
ASSERT (frame != NULL);
|
||||||
|
lock_acquire (&ftable_lock);
|
||||||
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
struct frame_metadata *frame_metadata = frame_metadata_get (frame);
|
||||||
if (frame_metadata == NULL)
|
if (frame_metadata == NULL)
|
||||||
PANIC ("Attempted to unpin a frame at an unallocated kernel address '%p'\n",
|
PANIC ("Attempted to unpin a frame at an unallocated kernel address '%p'\n",
|
||||||
frame);
|
frame);
|
||||||
|
|
||||||
frame_metadata->pinned = false;
|
frame_metadata->pinned = false;
|
||||||
|
lock_release (&ftable_lock);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Attempt to deallocate a frame for a user process by removing it from the
|
/* Attempt to deallocate a frame for a user process by removing it from the
|
||||||
@@ -207,7 +210,7 @@ frame_free (void *frame)
|
|||||||
frame);
|
frame);
|
||||||
|
|
||||||
free_owners (&frame_metadata->owners);
|
free_owners (&frame_metadata->owners);
|
||||||
lock_acquire (&lru_lock);
|
lock_acquire (&ftable_lock);
|
||||||
hash_delete (&frame_table, &frame_metadata->hash_elem);
|
hash_delete (&frame_table, &frame_metadata->hash_elem);
|
||||||
list_remove (&frame_metadata->list_elem);
|
list_remove (&frame_metadata->list_elem);
|
||||||
|
|
||||||
@@ -221,7 +224,7 @@ frame_free (void *frame)
|
|||||||
else
|
else
|
||||||
next_victim = lru_next (next_victim);
|
next_victim = lru_next (next_victim);
|
||||||
}
|
}
|
||||||
lock_release (&lru_lock);
|
lock_release (&ftable_lock);
|
||||||
|
|
||||||
free (frame_metadata);
|
free (frame_metadata);
|
||||||
palloc_free_page (frame);
|
palloc_free_page (frame);
|
||||||
@@ -238,6 +241,7 @@ frame_owner_insert (void *frame, struct thread *owner)
|
|||||||
struct frame_owner *frame_owner = malloc (sizeof (struct frame_owner));
|
struct frame_owner *frame_owner = malloc (sizeof (struct frame_owner));
|
||||||
if (frame_owner == NULL)
|
if (frame_owner == NULL)
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
frame_owner->owner = owner;
|
frame_owner->owner = owner;
|
||||||
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
list_push_back (&frame_metadata->owners, &frame_owner->elem);
|
||||||
return true;
|
return true;
|
||||||
@@ -260,6 +264,7 @@ frame_owner_remove (void *frame, struct thread *owner)
|
|||||||
{
|
{
|
||||||
struct frame_owner *frame_owner
|
struct frame_owner *frame_owner
|
||||||
= list_entry (oe, struct frame_owner, elem);
|
= list_entry (oe, struct frame_owner, elem);
|
||||||
|
|
||||||
oe = list_next (oe);
|
oe = list_next (oe);
|
||||||
if (frame_owner->owner == owner)
|
if (frame_owner->owner == owner)
|
||||||
{
|
{
|
||||||
@@ -281,12 +286,12 @@ frame_metadata_find (void *frame)
|
|||||||
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
||||||
if (e == NULL)
|
if (e == NULL)
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
return hash_entry (e, struct frame_metadata, hash_elem);
|
return hash_entry (e, struct frame_metadata, hash_elem);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* TODO: Account for page aliases when checking accessed bit. */
|
|
||||||
/* A pre-condition for calling this function is that the calling thread
|
/* 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 *
|
static struct frame_metadata *
|
||||||
get_victim (void)
|
get_victim (void)
|
||||||
{
|
{
|
||||||
@@ -372,7 +377,6 @@ frame_metadata_get (void *frame)
|
|||||||
|
|
||||||
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
struct hash_elem *e = hash_find (&frame_table, &key_metadata.hash_elem);
|
||||||
if (e == NULL) return NULL;
|
if (e == NULL) return NULL;
|
||||||
|
|
||||||
return hash_entry (e, struct frame_metadata, hash_elem);
|
return hash_entry (e, struct frame_metadata, hash_elem);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -10,7 +10,12 @@ struct frame_owner
|
|||||||
struct list_elem elem; /* List element for the list of owners. */
|
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_init (void);
|
||||||
|
|
||||||
void *frame_alloc (enum palloc_flags, void *, struct thread *);
|
void *frame_alloc (enum palloc_flags, void *, struct thread *);
|
||||||
void frame_pin (void *frame);
|
void frame_pin (void *frame);
|
||||||
void frame_unpin (void *frame);
|
void frame_unpin (void *frame);
|
||||||
|
|||||||
@@ -67,26 +67,27 @@ mmap_unmap (struct mmap_entry *mmap)
|
|||||||
if necessary. */
|
if necessary. */
|
||||||
off_t length = file_length (mmap->file);
|
off_t length = file_length (mmap->file);
|
||||||
for (off_t ofs = 0; ofs < length; ofs += PGSIZE)
|
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(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);
|
void *upage = mmap->upage + ofs;
|
||||||
file_write_at (mmap->file, upage, page->read_bytes, ofs);
|
|
||||||
lock_release (&filesys_lock);
|
/* 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. */
|
/* Close the file and free the mmap entry. */
|
||||||
hash_delete (&thread_current ()->pages, &page->elem);
|
|
||||||
}
|
|
||||||
|
|
||||||
file_close (mmap->file);
|
file_close (mmap->file);
|
||||||
free (mmap);
|
free (mmap);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -90,6 +90,7 @@ page_insert_swapped (void *upage, void *kpage, struct list *owners)
|
|||||||
|
|
||||||
/* 1. Initialize swapped page entry. */
|
/* 1. Initialize swapped page entry. */
|
||||||
struct page_entry *page = page_get (owner, upage);
|
struct page_entry *page = page_get (owner, upage);
|
||||||
|
lock_acquire (&owner->pages_lock);
|
||||||
if (page == NULL)
|
if (page == NULL)
|
||||||
{
|
{
|
||||||
page = malloc (sizeof (struct page_entry));
|
page = malloc (sizeof (struct page_entry));
|
||||||
@@ -113,6 +114,7 @@ page_insert_swapped (void *upage, void *kpage, struct list *owners)
|
|||||||
page_set_swap (owner, pte, swap_slot);
|
page_set_swap (owner, pte, swap_slot);
|
||||||
|
|
||||||
lock_release (&page->lock);
|
lock_release (&page->lock);
|
||||||
|
lock_release (&owner->pages_lock);
|
||||||
}
|
}
|
||||||
if (exec_file != NULL)
|
if (exec_file != NULL)
|
||||||
{
|
{
|
||||||
@@ -155,7 +157,10 @@ page_insert_file (struct file *file, off_t ofs, void *upage,
|
|||||||
page->writable = writable;
|
page->writable = writable;
|
||||||
lock_init (&page->lock);
|
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;
|
return page;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -167,8 +172,10 @@ page_get (struct thread *thread, void *upage)
|
|||||||
struct page_entry fake_page_entry;
|
struct page_entry fake_page_entry;
|
||||||
fake_page_entry.upage = upage;
|
fake_page_entry.upage = upage;
|
||||||
|
|
||||||
|
lock_acquire (&thread->pages_lock);
|
||||||
struct hash_elem *e
|
struct hash_elem *e
|
||||||
= hash_find (&thread->pages, &fake_page_entry.elem);
|
= hash_find (&thread->pages, &fake_page_entry.elem);
|
||||||
|
lock_release (&thread->pages_lock);
|
||||||
if (e == NULL)
|
if (e == NULL)
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
@@ -188,6 +195,7 @@ page_load_file (struct page_entry *page)
|
|||||||
lock_acquire (&shared_file_pages_lock);
|
lock_acquire (&shared_file_pages_lock);
|
||||||
struct shared_file_page *sfp
|
struct shared_file_page *sfp
|
||||||
= shared_file_page_get (page->file, page->upage);
|
= shared_file_page_get (page->file, page->upage);
|
||||||
|
|
||||||
if (sfp != NULL)
|
if (sfp != NULL)
|
||||||
{
|
{
|
||||||
/* Frame exists, just install it. */
|
/* Frame exists, just install it. */
|
||||||
@@ -198,13 +206,10 @@ page_load_file (struct page_entry *page)
|
|||||||
lock_release (&shared_file_pages_lock);
|
lock_release (&shared_file_pages_lock);
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
/* First time adding the shared page, so add thread as owner. */
|
frame_owner_insert (sfp->frame, t);
|
||||||
if (page->type != PAGE_SHARED)
|
|
||||||
{
|
|
||||||
frame_owner_insert (sfp->frame, t);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
/* Shared page is in swap. Load it. */
|
|
||||||
|
/* Otherwise, shared page is in swap. Load it. */
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
void *frame = frame_alloc (PAL_USER, page->upage, t);
|
void *frame = frame_alloc (PAL_USER, page->upage, t);
|
||||||
@@ -220,6 +225,7 @@ page_load_file (struct page_entry *page)
|
|||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
page_flag_shared (t, page->upage, true);
|
page_flag_shared (t, page->upage, true);
|
||||||
if (page->type != PAGE_SHARED)
|
if (page->type != PAGE_SHARED)
|
||||||
{
|
{
|
||||||
@@ -317,12 +323,12 @@ page_cleanup (struct hash_elem *e, void *aux UNUSED)
|
|||||||
/* Flags the provided page table entry as representing a swapped out page. */
|
/* Flags the provided page table entry as representing a swapped out page. */
|
||||||
void
|
void
|
||||||
page_flag_swap (uint32_t *pte, bool set)
|
page_flag_swap (uint32_t *pte, bool set)
|
||||||
{
|
{
|
||||||
if (set)
|
if (set)
|
||||||
*pte |= (1 << SWAP_FLAG_BIT);
|
*pte |= (1 << SWAP_FLAG_BIT);
|
||||||
else
|
else
|
||||||
*pte &= ~(1 << SWAP_FLAG_BIT);
|
*pte &= ~(1 << SWAP_FLAG_BIT);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Sets the address bits of the page table entry to the provided swap slot
|
/* 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. */
|
value. To be used for later retrieval of the swap slot when page faulting. */
|
||||||
|
|||||||
@@ -7,9 +7,8 @@
|
|||||||
|
|
||||||
enum page_type
|
enum page_type
|
||||||
{
|
{
|
||||||
PAGE_FILE,
|
PAGE_EXECUTABLE,
|
||||||
PAGE_MMAP,
|
PAGE_MMAP,
|
||||||
PAGE_EMPTY,
|
|
||||||
PAGE_SHARED
|
PAGE_SHARED
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -35,13 +34,18 @@ struct page_entry
|
|||||||
|
|
||||||
struct shared_file_page
|
struct shared_file_page
|
||||||
{
|
{
|
||||||
struct file *file;
|
struct file *file; /* The shared file page's source file, used for indexing
|
||||||
void *upage;
|
the table. */
|
||||||
void *frame;
|
void *upage; /* The shared page's upage which is the same across all process
|
||||||
size_t swap_slot;
|
using it. Used for indexing the table. */
|
||||||
int ref_count;
|
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;
|
struct hash_elem elem; /* AN elem for the hash table. */
|
||||||
};
|
};
|
||||||
|
|
||||||
bool init_pages (struct hash *pages);
|
bool init_pages (struct hash *pages);
|
||||||
|
|||||||
Reference in New Issue
Block a user