1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
#include <string.h>
#include "filesys/file.h"
#include "userprog/process.h"
#include "threads/thread.h"
#include "threads/malloc.h"
#include "threads/palloc.h"
#include "vm/page.h"
static unsigned page_table_hash (const struct hash_elem *e, void *aux UNUSED);
static bool page_table_cmp_less (const struct hash_elem *a, const struct hash_elem *b,
void *aux UNUSED);
static void page_table_entry_free (struct hash_elem *e, void *aux UNUSED);
static bool page_table_insert (struct hash *ht, struct page_table_entry *pte);
static bool page_load_segment (struct page_table_entry *pte);
static bool page_load_mmf (struct page_table_entry *pte);
/* initialize page table structure */
void
page_table_init (struct hash *ht)
{
hash_init (ht, page_table_hash, page_table_cmp_less, NULL);
}
/* calulcates and returns the hash used as key of the hash/page table */
static unsigned
page_table_hash (const struct hash_elem *e, void *aux UNUSED)
{
const struct page_table_entry *pte = hash_entry (e, struct page_table_entry, elem);
return hash_bytes (&pte->upage, sizeof pte->upage);
}
/* page table comperator needed by the hash table implementation
returns true if A is less than B, or false if A is greater than
or equal to B */
static bool
page_table_cmp_less (const struct hash_elem *a, const struct hash_elem *b,
void *aux UNUSED)
{
const struct page_table_entry *pte1 = hash_entry (a, struct page_table_entry, elem);
const struct page_table_entry *pte2 = hash_entry (b, struct page_table_entry, elem);
return (pte1->upage < pte2->upage);
}
/* frees the content of page table */
void
page_table_free (struct hash *ht)
{
hash_destroy (ht, page_table_entry_free);
}
/* frees a single page table entry */
static void
page_table_entry_free (struct hash_elem *e, void *aux UNUSED)
{
struct page_table_entry *pte = hash_entry (e, struct page_table_entry, elem);
free (pte);
}
/* inserts a new entry into the page table
returns false if entry is invalid or already in the table */
static bool
page_table_insert (struct hash *ht, struct page_table_entry *pte)
{
if (pte == NULL)
return false;
return (hash_insert (ht, &pte->elem) == NULL);
}
/* inserts a new entry of type segment into the page table
returns false if entry is invalid or already in the table */
bool
page_table_insert_segment (struct file *file, off_t ofs, uint8_t *upage,
uint32_t read_bytes, uint32_t zero_bytes, bool writable)
{
struct page_table_entry *pte = malloc (sizeof *pte);
if (pte == NULL)
return false;
pte->upage = upage;
pte->type = PAGE_SEGMENT;
pte->loaded = false;
pte->segment.file = file;
pte->segment.ofs = ofs;
pte->segment.read_bytes = read_bytes;
pte->segment.zero_bytes = zero_bytes;
pte->segment.writable = writable;
return page_table_insert (&thread_current ()->page_table, pte);
}
/* fetch an entry from the page table. returns NULL if not found */
struct page_table_entry *
page_table_fetch (struct hash *ht, void *upage)
{
struct page_table_entry pte;
struct hash_elem *e;
pte.upage = upage;
e = hash_find (ht, &pte.elem);
return ((e != NULL) ? hash_entry (e, struct page_table_entry, elem) : NULL);
}
/* load the page referenced by the page table entry
returns true on success or already loaded, false otherwise */
bool
page_load (struct page_table_entry *pte)
{
if (pte->loaded)
return true;
switch (pte->type)
{
case PAGE_SEGMENT:
return page_load_segment (pte);
case PAGE_MEMORY_MAPPED_FILE:
return page_load_mmf (pte);
default:
ASSERT (false);
break;
}
return false;
}
/* load the segment data page */
static bool
page_load_segment (struct page_table_entry *pte)
{
struct segment *data = &pte->segment;
file_seek (data->file, data->ofs);
/* Get a page of memory. */
uint8_t *kpage = palloc_get_page (PAL_USER);
if (kpage == NULL)
return false;
/* Load this page. */
if (file_read (data->file, kpage, data->read_bytes)
!= (int) data->read_bytes)
{
palloc_free_page (kpage);
return false;
}
memset (kpage + data->read_bytes, 0, data->zero_bytes);
/* Add the page to the process's address space. */
if (!process_install_page (pte->upage, kpage, data->writable))
{
palloc_free_page (kpage);
return false;
}
pte->loaded = true;
return true;
}
/* load the memory mappged file page */
static bool
page_load_mmf (struct page_table_entry *pte)
{
//TODO: implement
return false;
}
|
