-#include "thread.h"
+#include "threads/thread.h"
+#include <debug.h>
#include <stddef.h>
-#include "debug.h"
-#include "interrupt.h"
-#include "intr-stubs.h"
-#include "lib.h"
-#include "mmu.h"
-#include "palloc.h"
-#include "random.h"
-#include "switch.h"
-
-uint32_t thread_stack_ofs = offsetof (struct thread, stack);
-
-static struct list run_queue;
-static struct thread *idle_thread;
-
-static void
-idle (void *aux UNUSED)
-{
- for (;;)
- {
- /* Wait for an interrupt. */
- asm ("hlt");
+#include <random.h>
+#include <stdio.h>
+#include <string.h>
+#include "threads/flags.h"
+#include "threads/interrupt.h"
+#include "threads/intr-stubs.h"
+#include "threads/mmu.h"
+#include "threads/palloc.h"
+#include "threads/switch.h"
+#include "threads/synch.h"
+#ifdef USERPROG
+#include "userprog/addrspace.h"
+#include "userprog/gdt.h"
+#endif
- /* Let someone else run. */
- intr_disable ();
- thread_sleep ();
- intr_enable ();
- }
-}
+/* Random value for struct thread's `magic' member.
+ Used to detect stack overflow. See the big comment at the top
+ of thread.h for details. */
+#define THREAD_MAGIC 0xcd6abf4b
-void
-thread_init (const char *name, void (*function) (void *aux), void *aux)
-{
- struct thread *initial_thread;
+/* List of processes in THREAD_READY state, that is, processes
+ that are ready to run but not actually running. */
+static struct list ready_list;
- ASSERT (intr_get_level () == IF_OFF);
+/* Idle thread. */
+static struct thread *idle_thread;
- list_init (&run_queue);
- idle_thread = thread_create ("idle", idle, NULL);
+/* Initial thread, the thread running init.c:main(). */
+static struct thread *initial_thread;
- initial_thread = thread_create (name, function, aux);
- list_remove (&initial_thread->rq_elem);
- initial_thread->status = THREAD_RUNNING;
- switch_threads (NULL, initial_thread);
-
- NOT_REACHED ();
-}
+/* Lock used by allocate_tid(). */
+static struct lock tid_lock;
+/* Stack frame for kernel_thread(). */
struct kernel_thread_frame
{
void *eip; /* Return address. */
- void (*function) (void *); /* Function to call. */
+ thread_func *function; /* Function to call. */
void *aux; /* Auxiliary data for function. */
};
-static void
-kernel_thread (void (*function) (void *aux), void *aux)
-{
- ASSERT (function != NULL);
+static void kernel_thread (thread_func *, void *aux);
+
+static void idle (void *aux UNUSED);
+static struct thread *running_thread (void);
+static struct thread *next_thread_to_run (void);
+static struct thread *new_thread (const char *name, int priority);
+static void init_thread (struct thread *, const char *name, int priority);
+static bool is_thread (struct thread *);
+static void *alloc_frame (struct thread *, size_t size);
+static void destroy_thread (struct thread *);
+static void schedule (void);
+void schedule_tail (struct thread *prev);
+static tid_t allocate_tid (void);
- intr_enable ();
- function (aux);
- thread_exit ();
-}
+/* Initializes the threading system by transforming the code
+ that's currently running into a thread. Note that this is
+ possible only because the loader was careful to put the bottom
+ of the stack at a page boundary; it won't work in general.
+ Also initializes the run queue.
-static struct thread *
-new_thread (const char *name)
+ After calling this function, be sure to initialize the page
+ allocator before trying to create any threads with
+ thread_create(). */
+void
+thread_init (void)
{
- struct thread *t;
+ ASSERT (intr_get_level () == INTR_OFF);
- ASSERT (name != NULL);
-
- t = palloc_get (PAL_ZERO);
- if (t != NULL)
- {
- strlcpy (t->name, name, sizeof t->name);
- t->stack = (uint8_t *) t + PGSIZE;
- t->status = THREAD_BLOCKED;
- }
-
- return t;
+ lock_init (&tid_lock, "tid");
+
+ /* Set up a thread structure for the running thread. */
+ initial_thread = running_thread ();
+ init_thread (initial_thread, "main", PRI_DEFAULT);
+ initial_thread->status = THREAD_RUNNING;
+ initial_thread->tid = allocate_tid ();
+
+ /* Initialize run queue. */
+ list_init (&ready_list);
}
-static void *
-alloc_frame (struct thread *t, size_t size)
+/* Starts preemptive thread scheduling by enabling interrupts.
+ Also creates the idle thread. */
+void
+thread_start (void)
{
- ASSERT (size % sizeof (uint32_t) == 0);
-
- t->stack -= size;
- return t->stack;
+ thread_create ("idle", PRI_DEFAULT, idle, NULL);
+ intr_enable ();
}
-struct thread *
-thread_create (const char *name, void (*function) (void *aux), void *aux)
+/* Creates a new kernel thread named NAME with the given initial
+ PRIORITY, which executes FUNCTION passing AUX as the argument,
+ and adds it to the ready queue. If thread_start() has been
+ called, then the new thread may be scheduled before
+ thread_create() returns. It could even exit before
+ thread_create() returns. Use a semaphore or some other form
+ of synchronization if you need to ensure ordering. Returns
+ the thread identifier for the new thread, or TID_ERROR if
+ creation fails.
+
+ The code provided sets the new thread's `priority' member to
+ PRIORITY, but no actual priority scheduling is implemented.
+ Priority scheduling is the goal of Problem 1-3. */
+tid_t
+thread_create (const char *name, int priority,
+ thread_func *function, void *aux)
{
struct thread *t;
struct kernel_thread_frame *kf;
struct switch_entry_frame *ef;
struct switch_threads_frame *sf;
+ tid_t tid;
ASSERT (function != NULL);
- t = new_thread (name);
+ t = new_thread (name, priority);
+ if (t == NULL)
+ return TID_ERROR;
+ tid = t->tid;
/* Stack frame for kernel_thread(). */
kf = alloc_frame (t, sizeof *kf);
ef = alloc_frame (t, sizeof *ef);
ef->eip = (void (*) (void)) kernel_thread;
- /* Stack frame for thread_switch(). */
+ /* Stack frame for switch_threads(). */
sf = alloc_frame (t, sizeof *sf);
sf->eip = switch_entry;
/* Add to run queue. */
- thread_ready (t);
+ thread_unblock (t);
- return t;
+ return tid;
+}
+
+/* Transitions a blocked thread T from its current state to the
+ ready-to-run state. This is an error if T is not blocked.
+ (Use thread_yield() to make the running thread ready.) */
+void
+thread_unblock (struct thread *t)
+{
+ enum intr_level old_level;
+
+ ASSERT (is_thread (t));
+
+ old_level = intr_disable ();
+ ASSERT (t->status == THREAD_BLOCKED);
+ list_push_back (&ready_list, &t->elem);
+ t->status = THREAD_READY;
+ intr_set_level (old_level);
+}
+
+/* Returns the name of the running thread. */
+const char *
+thread_name (void)
+{
+ return thread_current ()->name;
}
+/* Returns the running thread.
+ This is running_thread() plus a couple of sanity checks.
+ See the big comment at the top of thread.h for details. */
struct thread *
thread_current (void)
{
- uint32_t *esp;
- asm ("movl %%esp, %0\n" : "=g" (esp));
- return pg_round_down (esp);
+ struct thread *t = running_thread ();
+
+ /* Make sure T is really a thread.
+ If either of these assertions fire, then your thread may
+ have overflowed its stack. Each thread has less than 4 kB
+ of stack, so a few big automatic arrays or moderate
+ recursion can cause stack overflow. */
+ ASSERT (is_thread (t));
+ ASSERT (t->status == THREAD_RUNNING);
+
+ return t;
}
-#ifdef USERPROG
-bool
-thread_execute (const char *filename)
+/* Returns the running thread's tid. */
+tid_t
+thread_tid (void)
{
- struct thread *t;
- struct intr_frame *if_;
- struct switch_entry_frame *ef;
- struct switch_threads_frame *sf;
- void (*start) (void);
+ return thread_current ()->tid;
+}
- ASSERT (filename != NULL);
+/* Deschedules the current thread and destroys it. Never
+ returns to the caller. */
+void
+thread_exit (void)
+{
+ ASSERT (!intr_context ());
- t = new_thread (filename);
- if (t == NULL)
- return false;
+ /* Just set our status to dying and schedule another process.
+ We will be destroyed during the call to schedule_tail(). */
+ intr_disable ();
+ thread_current ()->status = THREAD_DYING;
+ schedule ();
+ NOT_REACHED ();
+}
+
+/* Yields the CPU. The current thread is not put to sleep and
+ may be scheduled again immediately at the scheduler's whim. */
+void
+thread_yield (void)
+{
+ struct thread *cur = thread_current ();
+ enum intr_level old_level;
- if (!addrspace_load (&t->addrspace, filename, &start))
- panic ("%s: program load failed", filename);
-
- /* Interrupt frame. */
- if_ = alloc_frame (t, sizeof *if_);
- if_->es = SEL_UDSEG;
- if_->ds = SEL_UDSEG;
- if_->eip = start;
- if_->cs = SEL_UCSEG;
- if_->eflags = FLAG_IF | 2;
- if_->esp = PHYS_BASE;
- if_->ss = SEL_UDSEG;
+ ASSERT (!intr_context ());
- /* Stack frame for switch_entry(). */
- ef = alloc_frame (t, sizeof *ef);
- ef->eip = intr_exit;
+ old_level = intr_disable ();
+ list_push_back (&ready_list, &cur->elem);
+ cur->status = THREAD_READY;
+ schedule ();
+ intr_set_level (old_level);
+}
- /* Stack frame for thread_switch(). */
- sf = alloc_frame (t, sizeof *sf);
- sf->eip = switch_entry;
+/* Puts the current thread to sleep. It will not be scheduled
+ again until awoken by thread_unblock().
- /* Add to run queue. */
- thread_ready (t);
+ This function must be called with interrupts turned off. It
+ is usually a better idea to use one of the synchronization
+ primitives in synch.h. */
+void
+thread_block (void)
+{
+ ASSERT (!intr_context ());
+ ASSERT (intr_get_level () == INTR_OFF);
- return true;
+ thread_current ()->status = THREAD_BLOCKED;
+ schedule ();
}
-#endif
-
-void
-thread_ready (struct thread *t)
+\f
+/* Idle thread. Executes when no other thread is ready to run. */
+static void
+idle (void *aux UNUSED)
{
- if (t->status != THREAD_READY)
+ idle_thread = thread_current ();
+
+ for (;;)
{
- list_push_back (&run_queue, &t->rq_elem);
- t->status = THREAD_READY;
+ /* Let someone else run. */
+ intr_disable ();
+ thread_block ();
+ intr_enable ();
+
+ /* Use CPU `hlt' instruction to wait for interrupt. */
+ asm ("hlt");
}
}
-static struct thread *
-find_next_to_run (void)
+/* Function used as the basis for a kernel thread. */
+static void
+kernel_thread (thread_func *function, void *aux)
{
- if (list_empty (&run_queue))
- return NULL;
- else
- return list_entry (list_pop_front (&run_queue), struct thread, rq_elem);
-}
+ ASSERT (function != NULL);
-void
-thread_destroy (struct thread *t)
+ intr_enable (); /* The scheduler runs with interrupts off. */
+ function (aux); /* Execute the thread function. */
+ thread_exit (); /* If function() returns, kill the thread. */
+}
+\f
+/* Returns the running thread. */
+struct thread *
+running_thread (void)
{
- ASSERT (t->status == THREAD_DYING);
- ASSERT (t != thread_current ());
+ uint32_t *esp;
- palloc_free (t);
+ /* Copy the CPU's stack pointer into `esp', and then round that
+ down to the start of a page. Because `struct thread' is
+ always at the beginning of a page and the stack pointer is
+ somewhere in the middle, this locates the curent thread. */
+ asm ("movl %%esp, %0\n" : "=g" (esp));
+ return pg_round_down (esp);
}
-void schedule_tail (struct thread *prev);
-
-void
-schedule_tail (struct thread *prev)
+/* Returns true if T appears to point to a valid thread. */
+static bool
+is_thread (struct thread *t)
{
- ASSERT (intr_get_level () == IF_OFF);
+ return t != NULL && t->magic == THREAD_MAGIC;
+}
-#ifdef USERPROG
- addrspace_activate (&thread_current ()->addrspace);
-#endif
+/* Creates a new thread named NAME as a child of the running
+ thread. Returns the new thread if successful or a null
+ pointer on failure. */
+static struct thread *
+new_thread (const char *name, int priority)
+{
+ struct thread *t = palloc_get (PAL_ZERO);
+ if (t != NULL)
+ {
+ init_thread (t, name, priority);
+ t->tid = allocate_tid ();
+ }
- if (prev != NULL && prev->status == THREAD_DYING)
- thread_destroy (prev);
+ return t;
}
+/* Does basic initialization of T as a blocked thread named
+ NAME. */
static void
-thread_schedule (void)
+init_thread (struct thread *t, const char *name, int priority)
{
- struct thread *cur, *next, *prev;
+ ASSERT (t != NULL);
+ ASSERT (PRI_MIN <= priority && priority <= PRI_MAX);
+ ASSERT (name != NULL);
- ASSERT (intr_get_level () == IF_OFF);
+ memset (t, 0, sizeof *t);
+ t->status = THREAD_BLOCKED;
+ strlcpy (t->name, name, sizeof t->name);
+ t->stack = (uint8_t *) t + PGSIZE;
+ t->priority = priority;
+ t->magic = THREAD_MAGIC;
+}
- cur = thread_current ();
- ASSERT (cur->status != THREAD_RUNNING);
+/* Allocates a SIZE-byte frame at the top of thread T's stack and
+ returns a pointer to the frame's base. */
+static void *
+alloc_frame (struct thread *t, size_t size)
+{
+ /* Stack data is always allocated in word-size units. */
+ ASSERT (is_thread (t));
+ ASSERT (size % sizeof (uint32_t) == 0);
- next = find_next_to_run ();
- if (next == NULL)
- next = idle_thread;
+ t->stack -= size;
+ return t->stack;
+}
- next->status = THREAD_RUNNING;
- if (cur != next)
- {
- prev = switch_threads (cur, next);
+/* Chooses and returns the next thread to be scheduled. Should
+ return a thread from the run queue, unless the run queue is
+ empty. (If the running thread can continue running, then it
+ will be in the run queue.) If the run queue is empty, return
+ idle_thread. */
+static struct thread *
+next_thread_to_run (void)
+{
+ if (list_empty (&ready_list))
+ return idle_thread;
+ else
+ return list_entry (list_pop_front (&ready_list), struct thread, elem);
+}
- /* Prevent GCC from reordering anything around the thread
- switch. */
- asm volatile ("" : : : "memory");
+/* Destroys T, which must not be the running thread. */
+static void
+destroy_thread (struct thread *t)
+{
+ ASSERT (is_thread (t));
+ ASSERT (t != thread_current ());
- schedule_tail (prev);
- }
+#ifdef USERPROG
+ addrspace_destroy (t);
+#endif
+ if (t != initial_thread)
+ palloc_free (t);
}
+/* Completes a thread switch by activating the new thread's page
+ tables, and, if the previous thread is dying, destroying it.
+
+ At this function's invocation, we just switched from thread
+ PREV, the new thread is already running, and interrupts are
+ still disabled. This function is normally invoked by
+ thread_schedule() as its final action before returning, but
+ the first time a thread is scheduled it is called by
+ switch_entry() (see switch.S).
+
+ After this function and its caller returns, the thread switch
+ is complete. */
void
-thread_yield (void)
+schedule_tail (struct thread *prev)
{
- enum if_level old_level;
+ struct thread *cur = running_thread ();
- ASSERT (!intr_context ());
+ ASSERT (intr_get_level () == INTR_OFF);
- old_level = intr_disable ();
- thread_ready (thread_current ());
- thread_schedule ();
- intr_set_level (old_level);
+ /* Mark us as running. */
+ cur->status = THREAD_RUNNING;
+
+#ifdef USERPROG
+ /* Activate the new address space. */
+ addrspace_activate ();
+#endif
+
+ /* If the thread we switched from is dying, destroy it.
+ This must happen late because it's not a good idea to
+ e.g. destroy the page table you're currently using. */
+ if (prev != NULL && prev->status == THREAD_DYING)
+ destroy_thread (prev);
}
-void
-thread_exit (void)
+/* Schedules a new process. At entry, interrupts must be off and
+ the running process's state must have been changed from
+ running to some other state. This function finds another
+ thread to run and switches to it. */
+static void
+schedule (void)
{
- ASSERT (!intr_context ());
+ struct thread *cur = running_thread ();
+ struct thread *next = next_thread_to_run ();
+ struct thread *prev = NULL;
- intr_disable ();
- thread_current ()->status = THREAD_DYING;
- thread_schedule ();
- NOT_REACHED ();
+ ASSERT (intr_get_level () == INTR_OFF);
+ ASSERT (cur->status != THREAD_RUNNING);
+ ASSERT (is_thread (next));
+
+ if (cur != next)
+ prev = switch_threads (cur, next);
+ schedule_tail (prev);
}
-void
-thread_sleep (void)
+/* Returns a tid to use for a new thread. */
+static tid_t
+allocate_tid (void)
{
- ASSERT (!intr_context ());
- ASSERT (intr_get_level () == IF_OFF);
+ static tid_t next_tid = 1;
+ tid_t tid;
- thread_current ()->status = THREAD_BLOCKED;
- thread_schedule ();
+ lock_acquire (&tid_lock);
+ tid = next_tid++;
+ lock_release (&tid_lock);
+
+ return tid;
}
+\f
+/* Offset of `stack' member within `struct thread'.
+ Used by switch.S, which can't figure it out on its own. */
+uint32_t thread_stack_ofs = offsetof (struct thread, stack);
projects / pintos-anon / blobdiff