implement page table and use it for lazy loading of segments

1 files changed, 1 insertions, 1 deletions

diff --git a/threads/thread.c b/threads/thread.c
index cf404b6..14889ca 100644
--- a/threads/thread.c
+++ b/threads/thread.c
@@ -73,7 +73,7 @@ static tid_t allocate_tid (void);
 
 /* comparison function for our descending ordered ready list. */
 bool
-thread_priority_cmp_greater(const struct list_elem *a, const struct list_elem *b,
+thread_priority_cmp_greater (const struct list_elem *a, const struct list_elem *b,
   void *AUX UNUSED)
 {
   const struct thread *t1 = list_entry (a, struct thread, elem);