WebSVN – HelenOS – Diff – /branches/tracing/kernel/generic/src/proc/thread.c


/*
 * Copyright (c) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup genericproc
 * @{
 */
 
/**
 * @file
 * @brief   Thread management functions.
 */
 
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <proc/uarg.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <arch/asm.h>
#include <arch/cycle.h>
#include <arch.h>
#include <synch/synch.h>
#include <synch/spinlock.h>
#include <synch/waitq.h>
#include <synch/rwlock.h>
#include <cpu.h>
#include <func.h>
#include <context.h>
#include <adt/avl.h>
#include <adt/list.h>
#include <time/clock.h>
#include <time/timeout.h>
#include <config.h>
#include <arch/interrupt.h>
#include <smp/ipi.h>
#include <arch/faddr.h>
#include <atomic.h>
#include <memstr.h>
#include <print.h>
#include <mm/slab.h>
#include <debug.h>
#include <main/uinit.h>
#include <syscall/copy.h>
#include <errno.h>
#include <console/klog.h>
 
 
 
/** Thread states */
char *thread_states[] = {
    "Invalid",
    "Running",
    "Sleeping",
    "Ready",
    "Entering",
    "Exiting",
    "Lingering"
};
 
/** Lock protecting the threads_tree AVL tree.
 *
 * For locking rules, see declaration thereof.
 */
SPINLOCK_INITIALIZE(threads_lock);
 
/** ALV tree of all threads.
 *
 * When a thread is found in the threads_tree AVL tree, it is guaranteed to
 * exist as long as the threads_lock is held.
 */
avltree_t threads_tree;    
 
SPINLOCK_INITIALIZE(tidlock);
thread_id_t last_tid = 0;
 
static slab_cache_t *thread_slab;
#ifdef ARCH_HAS_FPU
slab_cache_t *fpu_context_slab;
#endif
 
/** Thread wrapper.
 *
 * This wrapper is provided to ensure that every thread makes a call to
 * thread_exit() when its implementing function returns.
 *
 * interrupts_disable() is assumed.
 *
 */
static void cushion(void)
{
    void (*f)(void *) = THREAD->thread_code;
    void *arg = THREAD->thread_arg;
    THREAD->last_cycle = get_cycle();
 
    /* This is where each thread wakes up after its creation */
    spinlock_unlock(&THREAD->lock);
    interrupts_enable();
 
    f(arg);
   
    /* Accumulate accounting to the task */
    ipl_t ipl = interrupts_disable();
   
    spinlock_lock(&THREAD->lock);
    if (!THREAD->uncounted) {
        thread_update_accounting();
        uint64_t cycles = THREAD->cycles;
        THREAD->cycles = 0;
        spinlock_unlock(&THREAD->lock);
       
        spinlock_lock(&TASK->lock);
        TASK->cycles += cycles;
        spinlock_unlock(&TASK->lock);
    } else
        spinlock_unlock(&THREAD->lock);
   
    interrupts_restore(ipl);
   
    thread_exit();
    /* not reached */
}
 
/** Initialization and allocation for thread_t structure */
static int thr_constructor(void *obj, int kmflags)
{
    thread_t *t = (thread_t *) obj;
 
    spinlock_initialize(&t->lock, "thread_t_lock");
    link_initialize(&t->rq_link);
    link_initialize(&t->wq_link);
    link_initialize(&t->th_link);
 
    /* call the architecture-specific part of the constructor */
    thr_constructor_arch(t);
   
#ifdef ARCH_HAS_FPU
#ifdef CONFIG_FPU_LAZY
    t->saved_fpu_context = NULL;
#else
    t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
    if (!t->saved_fpu_context)
        return -1;
#endif
#endif  
 
    t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags);
    if (!t->kstack) {
#ifdef ARCH_HAS_FPU
        if (t->saved_fpu_context)
            slab_free(fpu_context_slab, t->saved_fpu_context);
#endif
        return -1;
    }
 
    return 0;
}
 
/** Destruction of thread_t object */
static int thr_destructor(void *obj)
{
    thread_t *t = (thread_t *) obj;
 
    /* call the architecture-specific part of the destructor */
    thr_destructor_arch(t);
 
    frame_free(KA2PA(t->kstack));
#ifdef ARCH_HAS_FPU
    if (t->saved_fpu_context)
        slab_free(fpu_context_slab, t->saved_fpu_context);
#endif
    return 1; /* One page freed */
}
 
/** Initialize threads
 *
 * Initialize kernel threads support.
 *
 */
void thread_init(void)
{
    THREAD = NULL;
    atomic_set(&nrdy,0);
    thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
        thr_constructor, thr_destructor, 0);
 
#ifdef ARCH_HAS_FPU
    fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
        FPU_CONTEXT_ALIGN, NULL, NULL, 0);
#endif
 
    avltree_create(&threads_tree);
}
 
/** Make thread ready
 *
 * Switch thread t to the ready state.
 *
 * @param t Thread to make ready.
 *
 */
void thread_ready(thread_t *t)
{
    cpu_t *cpu;
    runq_t *r;
    ipl_t ipl;
    int i, avg;
 
    ipl = interrupts_disable();
 
    spinlock_lock(&t->lock);
 
    ASSERT(!(t->state == Ready));
 
    i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;
   
    cpu = CPU;
    if (t->flags & THREAD_FLAG_WIRED) {
        ASSERT(t->cpu != NULL);
        cpu = t->cpu;
    }
    t->state = Ready;
    spinlock_unlock(&t->lock);
   
    /*
     * Append t to respective ready queue on respective processor.
     */
    r = &cpu->rq[i];
    spinlock_lock(&r->lock);
    list_append(&t->rq_link, &r->rq_head);
    r->n++;
    spinlock_unlock(&r->lock);
 
    atomic_inc(&nrdy);
    avg = atomic_get(&nrdy) / config.cpu_active;
    atomic_inc(&cpu->nrdy);
 
    interrupts_restore(ipl);
}
 
/** Create new thread
 *
 * Create a new thread.
 *
 * @param func      Thread's implementing function.
 * @param arg       Thread's implementing function argument.
 * @param task      Task to which the thread belongs.
 * @param flags     Thread flags.
 * @param name      Symbolic name.
 * @param uncounted Thread's accounting doesn't affect accumulated task
 *          accounting.
 *
 * @return New thread's structure on success, NULL on failure.
 *
 */
thread_t *thread_create(void (* func)(void *), void *arg, task_t *task,
    int flags, char *name, bool uncounted)
{
    thread_t *t;
    ipl_t ipl;
   
    t = (thread_t *) slab_alloc(thread_slab, 0);
    if (!t)
        return NULL;
   
    /* Not needed, but good for debugging */
    memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES,
        0);
   
    ipl = interrupts_disable();
    spinlock_lock(&tidlock);
    t->tid = ++last_tid;
    spinlock_unlock(&tidlock);
    interrupts_restore(ipl);
   
    context_save(&t->saved_context);
    context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,
        THREAD_STACK_SIZE);
   
    the_initialize((the_t *) t->kstack);
   
    ipl = interrupts_disable();
    t->saved_context.ipl = interrupts_read();
    interrupts_restore(ipl);
   
    memcpy(t->name, name, THREAD_NAME_BUFLEN);
   
    t->thread_code = func;
    t->thread_arg = arg;
    t->ticks = -1;
    t->cycles = 0;
    t->uncounted = uncounted;
    t->priority = -1;       /* start in rq[0] */
    t->cpu = NULL;
    t->flags = flags;
    t->state = Entering;
    t->call_me = NULL;
    t->call_me_with = NULL;
   
    timeout_initialize(&t->sleep_timeout);
    t->sleep_interruptible = false;
    t->sleep_queue = NULL;
    t->timeout_pending = 0;
 
    t->in_copy_from_uspace = false;
    t->in_copy_to_uspace = false;
 
    t->interrupted = false;
    t->detached = false;
    waitq_initialize(&t->join_wq);
   
    t->rwlock_holder_type = RWLOCK_NONE;
       
    t->task = task;
   
    t->fpu_context_exists = 0;
    t->fpu_context_engaged = 0;
 
    avltree_node_initialize(&t->threads_tree_node);
    t->threads_tree_node.key = (uintptr_t) t;
 
 
    /* might depend on previous initialization */
    thread_create_arch(t); 
 
 
 
 
    if (!(flags & THREAD_FLAG_NOATTACH))
        thread_attach(t, task);
 
    return t;
}
 
/** Destroy thread memory structure
 *
 * Detach thread from all queues, cpus etc. and destroy it.
 *
 * Assume thread->lock is held!!
 */
void thread_destroy(thread_t *t)
{
    ASSERT(t->state == Exiting || t->state == Lingering);
    ASSERT(t->task);
    ASSERT(t->cpu);
 
    spinlock_lock(&t->cpu->lock);
    if (t->cpu->fpu_owner == t)
        t->cpu->fpu_owner = NULL;
    spinlock_unlock(&t->cpu->lock);
 
    spinlock_unlock(&t->lock);
 
    spinlock_lock(&threads_lock);
    avltree_delete(&threads_tree, &t->threads_tree_node);
    spinlock_unlock(&threads_lock);
 
    /*
     * Detach from the containing task.
     */
    spinlock_lock(&t->task->lock);
    list_remove(&t->th_link);
    spinlock_unlock(&t->task->lock);   
 
    /*
     * t is guaranteed to be the very last thread of its task.
     * It is safe to destroy the task.
     */
    if (atomic_predec(&t->task->refcount) == 0)
        task_destroy(t->task);
   
    slab_free(thread_slab, t);
}
 
/** Make the thread visible to the system.
 *
 * Attach the thread structure to the current task and make it visible in the
 * threads_tree.
 *
 * @param t Thread to be attached to the task.
 * @param task  Task to which the thread is to be attached.
 */
void thread_attach(thread_t *t, task_t *task)
{
    ipl_t ipl;
 
    /*
     * Attach to the current task.
     */
    ipl = interrupts_disable();
    spinlock_lock(&task->lock);
    atomic_inc(&task->refcount);
    atomic_inc(&task->lifecount);
    list_append(&t->th_link, &task->th_head);
    spinlock_unlock(&task->lock);
 
    /*
     * Register this thread in the system-wide list.
     */
    spinlock_lock(&threads_lock);
    avltree_insert(&threads_tree, &t->threads_tree_node);
    spinlock_unlock(&threads_lock);
   
    interrupts_restore(ipl);
}
 
/** Terminate thread.
 *
 * End current thread execution and switch it to the exiting state. All pending
 * timeouts are executed.
 */
void thread_exit(void)
{
    ipl_t ipl;
 
    if (atomic_predec(&TASK->lifecount) == 0) {
        /*
         * We are the last thread in the task that still has not exited.
         * With the exception of the moment the task was created, new
         * threads can only be created by threads of the same task.
         * We are safe to perform cleanup.
         */
        if (THREAD->flags & THREAD_FLAG_USPACE) {
            ipc_cleanup();
                futex_cleanup();
 
            klog_printf("Cleanup of task %llu completed.",
                TASK->taskid);
        }
    }
 
restart:
    ipl = interrupts_disable();
    spinlock_lock(&THREAD->lock);
    if (THREAD->timeout_pending) {
        /* busy waiting for timeouts in progress */
        spinlock_unlock(&THREAD->lock);
        interrupts_restore(ipl);
        goto restart;
    }
   
    THREAD->state = Exiting;
    spinlock_unlock(&THREAD->lock);
    scheduler();
 
    /* Not reached */
    while (1)
        ;
}
 
 
/** Thread sleep
 *
 * Suspend execution of the current thread.
 *
 * @param sec Number of seconds to sleep.
 *
 */
void thread_sleep(uint32_t sec)
{
    thread_usleep(sec * 1000000);
}
 
/** Wait for another thread to exit.
 *
 * @param t Thread to join on exit.
 * @param usec Timeout in microseconds.
 * @param flags Mode of operation.
 *
 * @return An error code from errno.h or an error code from synch.h.
 */
int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
{
    ipl_t ipl;
    int rc;
 
    if (t == THREAD)
        return EINVAL;
 
    /*
     * Since thread join can only be called once on an undetached thread,
     * the thread pointer is guaranteed to be still valid.
     */
   
    ipl = interrupts_disable();
    spinlock_lock(&t->lock);
    ASSERT(!t->detached);
    spinlock_unlock(&t->lock);
    interrupts_restore(ipl);
   
    rc = waitq_sleep_timeout(&t->join_wq, usec, flags);
   
    return rc; 
}
 
/** Detach thread.
 *
 * Mark the thread as detached, if the thread is already in the Lingering
 * state, deallocate its resources.
 *
 * @param t Thread to be detached.
 */
void thread_detach(thread_t *t)
{
    ipl_t ipl;
 
    /*
     * Since the thread is expected not to be already detached,
     * pointer to it must be still valid.
     */
    ipl = interrupts_disable();
    spinlock_lock(&t->lock);
    ASSERT(!t->detached);
    if (t->state == Lingering) {
        thread_destroy(t);  /* unlocks &t->lock */
        interrupts_restore(ipl);
        return;
    } else {
        t->detached = true;
    }
    spinlock_unlock(&t->lock);
    interrupts_restore(ipl);
}
 
/** Thread usleep
 *
 * Suspend execution of the current thread.
 *
 * @param usec Number of microseconds to sleep.
 *
 */
void thread_usleep(uint32_t usec)
{
    waitq_t wq;
                 
    waitq_initialize(&wq);
 
    (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
}
 
/** Register thread out-of-context invocation
 *
 * Register a function and its argument to be executed
 * on next context switch to the current thread.
 *
 * @param call_me      Out-of-context function.
 * @param call_me_with Out-of-context function argument.
 *
 */
void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
{
    ipl_t ipl;
   
    ipl = interrupts_disable();
    spinlock_lock(&THREAD->lock);
    THREAD->call_me = call_me;
    THREAD->call_me_with = call_me_with;
    spinlock_unlock(&THREAD->lock);
    interrupts_restore(ipl);
}
 
static bool thread_walker(avltree_node_t *node, void *arg)
{
    thread_t *t;
       
    t = avltree_get_instance(node, thread_t, threads_tree_node);
 
    uint64_t cycles;
    char suffix;
    order(t->cycles, &cycles, &suffix);
   
    if (sizeof(void *) == 4)
        printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ",
            t->tid, t->name, t, thread_states[t->state], t->task,
            t->task->context, t->thread_code, t->kstack, cycles, suffix);
    else
        printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ",
            t->tid, t->name, t, thread_states[t->state], t->task,
            t->task->context, t->thread_code, t->kstack, cycles, suffix);
           
    if (t->cpu)
        printf("%-4zd", t->cpu->id);
    else
        printf("none");
           
    if (t->state == Sleeping) {
        if (sizeof(uintptr_t) == 4)
            printf(" %#10zx", t->sleep_queue);
        else
            printf(" %#18zx", t->sleep_queue);
    }
           
    printf("\n");
 
    return true;
}
 
/** Print list of threads debug info */
void thread_print_list(void)
{
    ipl_t ipl;
   
    /* Messing with thread structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&threads_lock);
   
    if (sizeof(uintptr_t) == 4) {
        printf("tid    name       address    state    task       "
            "ctx code       stack      cycles     cpu  "
            "waitqueue\n");
        printf("------ ---------- ---------- -------- ---------- "
            "--- ---------- ---------- ---------- ---- "
            "----------\n");
    } else {
        printf("tid    name       address            state    task               "
            "ctx code               stack              cycles     cpu  "
            "waitqueue\n");
        printf("------ ---------- ------------------ -------- ------------------ "
            "--- ------------------ ------------------ ---------- ---- "
            "------------------\n");
    }
 
    avltree_walk(&threads_tree, thread_walker, NULL);
 
    spinlock_unlock(&threads_lock);
    interrupts_restore(ipl);
}
 
/** Check whether thread exists.
 *
 * Note that threads_lock must be already held and
 * interrupts must be already disabled.
 *
 * @param t Pointer to thread.
 *
 * @return True if thread t is known to the system, false otherwise.
 */
bool thread_exists(thread_t *t)
{
    avltree_node_t *node;
 
    node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t));
   
    return node != NULL;
}
 
 
/** Update accounting of current thread.
 *
 * Note that thread_lock on THREAD must be already held and
 * interrupts must be already disabled.
 *
 */
void thread_update_accounting(void)
{
    uint64_t time = get_cycle();
    THREAD->cycles += time - THREAD->last_cycle;
    THREAD->last_cycle = time;
}
 
/** Process syscall to create new thread.
 *
 */
unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
    thread_id_t *uspace_thread_id)
{
    thread_t *t;
    char namebuf[THREAD_NAME_BUFLEN];
    uspace_arg_t *kernel_uarg;
    int rc;
 
    rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN);
    if (rc != 0)
        return (unative_t) rc;
 
    /*
     * In case of failure, kernel_uarg will be deallocated in this function.
     * In case of success, kernel_uarg will be freed in uinit().
     */
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
   
    rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
    if (rc != 0) {
        free(kernel_uarg);
        return (unative_t) rc;
    }
 
    t = thread_create(uinit, kernel_uarg, TASK,
        THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
    if (t) {
        if (uspace_thread_id != NULL) {
            int rc;
 
            rc = copy_to_uspace(uspace_thread_id, &t->tid,
                sizeof(t->tid));
            if (rc != 0) {
                /*
                 * We have encountered a failure, but the thread
                 * has already been created. We need to undo its
                 * creation now.
                 */
 
                /*
                 * The new thread structure is initialized, but
                 * is still not visible to the system.
                 * We can safely deallocate it.
                 */
                slab_free(thread_slab, t);
                free(kernel_uarg);
 
                return (unative_t) rc;
             }
        }
        thread_attach(t, TASK);
        thread_ready(t);
 
        return 0;
    } else
        free(kernel_uarg);
 
    return (unative_t) ENOMEM;
}
 
/** Process syscall to terminate thread.
 *
 */
unative_t sys_thread_exit(int uspace_status)
{
    thread_exit();
    /* Unreachable */
    return 0;
}
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
/** Syscall for getting TID.
 *
 * @param uspace_thread_id Userspace address of 8-byte buffer where to store
 * current thread ID.
 *
 * @return 0 on success or an error code from @ref errno.h.
 */
unative_t sys_thread_get_id(thread_id_t *uspace_thread_id)
{
    /*
     * No need to acquire lock on THREAD because tid
     * remains constant for the lifespan of the thread.
     */
    return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
        sizeof(THREAD->tid));
}
 
/** @}
 */
 

Rev 2787	Rev 2799
1	/*	1	/*
2	* Copyright (c) 2001-2004 Jakub Jermar	2	* Copyright (c) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup genericproc	29	/** @addtogroup genericproc
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file	34	* @file
35	* @brief Thread management functions.	35	* @brief Thread management functions.
36	*/	36	*/
37		37
38	#include <proc/scheduler.h>	38	#include <proc/scheduler.h>
39	#include <proc/thread.h>	39	#include <proc/thread.h>
40	#include <proc/task.h>	40	#include <proc/task.h>
41	#include <proc/uarg.h>	41	#include <proc/uarg.h>
42	#include <mm/frame.h>	42	#include <mm/frame.h>
43	#include <mm/page.h>	43	#include <mm/page.h>
44	#include <arch/asm.h>	44	#include <arch/asm.h>
45	#include <arch/cycle.h>	45	#include <arch/cycle.h>
46	#include <arch.h>	46	#include <arch.h>
47	#include <synch/synch.h>	47	#include <synch/synch.h>
48	#include <synch/spinlock.h>	48	#include <synch/spinlock.h>
49	#include <synch/waitq.h>	49	#include <synch/waitq.h>
50	#include <synch/rwlock.h>	50	#include <synch/rwlock.h>
51	#include <cpu.h>	51	#include <cpu.h>
52	#include <func.h>	52	#include <func.h>
53	#include <context.h>	53	#include <context.h>
54	#include <adt/avl.h>	54	#include <adt/avl.h>
55	#include <adt/list.h>	55	#include <adt/list.h>
56	#include <time/clock.h>	56	#include <time/clock.h>
57	#include <time/timeout.h>	57	#include <time/timeout.h>
58	#include <config.h>	58	#include <config.h>
59	#include <arch/interrupt.h>	59	#include <arch/interrupt.h>
60	#include <smp/ipi.h>	60	#include <smp/ipi.h>
61	#include <arch/faddr.h>	61	#include <arch/faddr.h>
62	#include <atomic.h>	62	#include <atomic.h>
63	#include <memstr.h>	63	#include <memstr.h>
64	#include <print.h>	64	#include <print.h>
65	#include <mm/slab.h>	65	#include <mm/slab.h>
66	#include <debug.h>	66	#include <debug.h>
67	#include <main/uinit.h>	67	#include <main/uinit.h>
68	#include <syscall/copy.h>	68	#include <syscall/copy.h>
69	#include <errno.h>	69	#include <errno.h>
70	#include <console/klog.h>	70	#include <console/klog.h>
71	#include <tdebug/tdebug.h>	-
72		71
73		72
74	/** Thread states */	73	/** Thread states */
75	char *thread_states[] = {	74	char *thread_states[] = {
76	"Invalid",	75	"Invalid",
77	"Running",	76	"Running",
78	"Sleeping",	77	"Sleeping",
79	"Ready",	78	"Ready",
80	"Entering",	79	"Entering",
81	"Exiting",	80	"Exiting",
82	"Lingering"	81	"Lingering"
83	};	82	};
84		83
85	/** Lock protecting the threads_tree AVL tree.	84	/** Lock protecting the threads_tree AVL tree.
86	*	85	*
87	* For locking rules, see declaration thereof.	86	* For locking rules, see declaration thereof.
88	*/	87	*/
89	SPINLOCK_INITIALIZE(threads_lock);	88	SPINLOCK_INITIALIZE(threads_lock);
90		89
91	/** ALV tree of all threads.	90	/** ALV tree of all threads.
92	*	91	*
93	* When a thread is found in the threads_tree AVL tree, it is guaranteed to	92	* When a thread is found in the threads_tree AVL tree, it is guaranteed to
94	* exist as long as the threads_lock is held.	93	* exist as long as the threads_lock is held.
95	*/	94	*/
96	avltree_t threads_tree;	95	avltree_t threads_tree;
97		96
98	SPINLOCK_INITIALIZE(tidlock);	97	SPINLOCK_INITIALIZE(tidlock);
99	thread_id_t last_tid = 0;	98	thread_id_t last_tid = 0;
100		99
101	static slab_cache_t *thread_slab;	100	static slab_cache_t *thread_slab;
102	#ifdef ARCH_HAS_FPU	101	#ifdef ARCH_HAS_FPU
103	slab_cache_t *fpu_context_slab;	102	slab_cache_t *fpu_context_slab;
104	#endif	103	#endif
105		104
106	/** Thread wrapper.	105	/** Thread wrapper.
107	*	106	*
108	* This wrapper is provided to ensure that every thread makes a call to	107	* This wrapper is provided to ensure that every thread makes a call to
109	* thread_exit() when its implementing function returns.	108	* thread_exit() when its implementing function returns.
110	*	109	*
111	* interrupts_disable() is assumed.	110	* interrupts_disable() is assumed.
112	*	111	*
113	*/	112	*/
114	static void cushion(void)	113	static void cushion(void)
115	{	114	{
116	void (f)(void ) = THREAD->thread_code;	115	void (f)(void ) = THREAD->thread_code;
117	void *arg = THREAD->thread_arg;	116	void *arg = THREAD->thread_arg;
118	THREAD->last_cycle = get_cycle();	117	THREAD->last_cycle = get_cycle();
119		118
120	/* This is where each thread wakes up after its creation */	119	/* This is where each thread wakes up after its creation */
121	spinlock_unlock(&THREAD->lock);	120	spinlock_unlock(&THREAD->lock);
122	interrupts_enable();	121	interrupts_enable();
123		122
124	f(arg);	123	f(arg);
125		124
126	/* Accumulate accounting to the task */	125	/* Accumulate accounting to the task */
127	ipl_t ipl = interrupts_disable();	126	ipl_t ipl = interrupts_disable();
128		127
129	spinlock_lock(&THREAD->lock);	128	spinlock_lock(&THREAD->lock);
130	if (!THREAD->uncounted) {	129	if (!THREAD->uncounted) {
131	thread_update_accounting();	130	thread_update_accounting();
132	uint64_t cycles = THREAD->cycles;	131	uint64_t cycles = THREAD->cycles;
133	THREAD->cycles = 0;	132	THREAD->cycles = 0;
134	spinlock_unlock(&THREAD->lock);	133	spinlock_unlock(&THREAD->lock);
135		134
136	spinlock_lock(&TASK->lock);	135	spinlock_lock(&TASK->lock);
137	TASK->cycles += cycles;	136	TASK->cycles += cycles;
138	spinlock_unlock(&TASK->lock);	137	spinlock_unlock(&TASK->lock);
139	} else	138	} else
140	spinlock_unlock(&THREAD->lock);	139	spinlock_unlock(&THREAD->lock);
141		140
142	interrupts_restore(ipl);	141	interrupts_restore(ipl);
143		142
144	thread_exit();	143	thread_exit();
145	/* not reached */	144	/* not reached */
146	}	145	}
147		146
148	/** Initialization and allocation for thread_t structure */	147	/** Initialization and allocation for thread_t structure */
149	static int thr_constructor(void *obj, int kmflags)	148	static int thr_constructor(void *obj, int kmflags)
150	{	149	{
151	thread_t t = (thread_t ) obj;	150	thread_t t = (thread_t ) obj;
152		151
153	spinlock_initialize(&t->lock, "thread_t_lock");	152	spinlock_initialize(&t->lock, "thread_t_lock");
154	link_initialize(&t->rq_link);	153	link_initialize(&t->rq_link);
155	link_initialize(&t->wq_link);	154	link_initialize(&t->wq_link);
156	link_initialize(&t->th_link);	155	link_initialize(&t->th_link);
157		156
158	/* call the architecture-specific part of the constructor */	157	/* call the architecture-specific part of the constructor */
159	thr_constructor_arch(t);	158	thr_constructor_arch(t);
160		159
161	#ifdef ARCH_HAS_FPU	160	#ifdef ARCH_HAS_FPU
162	#ifdef CONFIG_FPU_LAZY	161	#ifdef CONFIG_FPU_LAZY
163	t->saved_fpu_context = NULL;	162	t->saved_fpu_context = NULL;
164	#else	163	#else
165	t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);	164	t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
166	if (!t->saved_fpu_context)	165	if (!t->saved_fpu_context)
167	return -1;	166	return -1;
168	#endif	167	#endif
169	#endif	168	#endif
170		169
171	t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);	170	t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);
172	if (!t->kstack) {	171	if (!t->kstack) {
173	#ifdef ARCH_HAS_FPU	172	#ifdef ARCH_HAS_FPU
174	if (t->saved_fpu_context)	173	if (t->saved_fpu_context)
175	slab_free(fpu_context_slab, t->saved_fpu_context);	174	slab_free(fpu_context_slab, t->saved_fpu_context);
176	#endif	175	#endif
177	return -1;	176	return -1;
178	}	177	}
179		178
180	return 0;	179	return 0;
181	}	180	}
182		181
183	/** Destruction of thread_t object */	182	/** Destruction of thread_t object */
184	static int thr_destructor(void *obj)	183	static int thr_destructor(void *obj)
185	{	184	{
186	thread_t t = (thread_t ) obj;	185	thread_t t = (thread_t ) obj;
187		186
188	/* call the architecture-specific part of the destructor */	187	/* call the architecture-specific part of the destructor */
189	thr_destructor_arch(t);	188	thr_destructor_arch(t);
190		189
191	frame_free(KA2PA(t->kstack));	190	frame_free(KA2PA(t->kstack));
192	#ifdef ARCH_HAS_FPU	191	#ifdef ARCH_HAS_FPU
193	if (t->saved_fpu_context)	192	if (t->saved_fpu_context)
194	slab_free(fpu_context_slab, t->saved_fpu_context);	193	slab_free(fpu_context_slab, t->saved_fpu_context);
195	#endif	194	#endif
196	return 1; /* One page freed */	195	return 1; /* One page freed */
197	}	196	}
198		197
199	/** Initialize threads	198	/** Initialize threads
200	*	199	*
201	* Initialize kernel threads support.	200	* Initialize kernel threads support.
202	*	201	*
203	*/	202	*/
204	void thread_init(void)	203	void thread_init(void)
205	{	204	{
206	THREAD = NULL;	205	THREAD = NULL;
207	atomic_set(&nrdy,0);	206	atomic_set(&nrdy,0);
208	thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,	207	thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
209	thr_constructor, thr_destructor, 0);	208	thr_constructor, thr_destructor, 0);
210		209
211	#ifdef ARCH_HAS_FPU	210	#ifdef ARCH_HAS_FPU
212	fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),	211	fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
213	FPU_CONTEXT_ALIGN, NULL, NULL, 0);	212	FPU_CONTEXT_ALIGN, NULL, NULL, 0);
214	#endif	213	#endif
215		214
216	avltree_create(&threads_tree);	215	avltree_create(&threads_tree);
217	}	216	}
218		217
219	/** Make thread ready	218	/** Make thread ready
220	*	219	*
221	* Switch thread t to the ready state.	220	* Switch thread t to the ready state.
222	*	221	*
223	* @param t Thread to make ready.	222	* @param t Thread to make ready.
224	*	223	*
225	*/	224	*/
226	void thread_ready(thread_t *t)	225	void thread_ready(thread_t *t)
227	{	226	{
228	cpu_t *cpu;	227	cpu_t *cpu;
229	runq_t *r;	228	runq_t *r;
230	ipl_t ipl;	229	ipl_t ipl;
231	int i, avg;	230	int i, avg;
232		231
233	ipl = interrupts_disable();	232	ipl = interrupts_disable();
234		233
235	spinlock_lock(&t->lock);	234	spinlock_lock(&t->lock);
236		235
237	ASSERT(!(t->state == Ready));	236	ASSERT(!(t->state == Ready));
238		237
239	i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;	238	i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;
240		239
241	cpu = CPU;	240	cpu = CPU;
242	if (t->flags & THREAD_FLAG_WIRED) {	241	if (t->flags & THREAD_FLAG_WIRED) {
243	ASSERT(t->cpu != NULL);	242	ASSERT(t->cpu != NULL);
244	cpu = t->cpu;	243	cpu = t->cpu;
245	}	244	}
246	t->state = Ready;	245	t->state = Ready;
247	spinlock_unlock(&t->lock);	246	spinlock_unlock(&t->lock);
248		247
249	/*	248	/*
250	* Append t to respective ready queue on respective processor.	249	* Append t to respective ready queue on respective processor.
251	*/	250	*/
252	r = &cpu->rq[i];	251	r = &cpu->rq[i];
253	spinlock_lock(&r->lock);	252	spinlock_lock(&r->lock);
254	list_append(&t->rq_link, &r->rq_head);	253	list_append(&t->rq_link, &r->rq_head);
255	r->n++;	254	r->n++;
256	spinlock_unlock(&r->lock);	255	spinlock_unlock(&r->lock);
257		256
258	atomic_inc(&nrdy);	257	atomic_inc(&nrdy);
259	avg = atomic_get(&nrdy) / config.cpu_active;	258	avg = atomic_get(&nrdy) / config.cpu_active;
260	atomic_inc(&cpu->nrdy);	259	atomic_inc(&cpu->nrdy);
261		260
262	interrupts_restore(ipl);	261	interrupts_restore(ipl);
263	}	262	}
264		263
265	/** Create new thread	264	/** Create new thread
266	*	265	*
267	* Create a new thread.	266	* Create a new thread.
268	*	267	*
269	* @param func Thread's implementing function.	268	* @param func Thread's implementing function.
270	* @param arg Thread's implementing function argument.	269	* @param arg Thread's implementing function argument.
271	* @param task Task to which the thread belongs.	270	* @param task Task to which the thread belongs.
272	* @param flags Thread flags.	271	* @param flags Thread flags.
273	* @param name Symbolic name.	272	* @param name Symbolic name.
274	* @param uncounted Thread's accounting doesn't affect accumulated task	273	* @param uncounted Thread's accounting doesn't affect accumulated task
275	* accounting.	274	* accounting.
276	*	275	*
277	* @return New thread's structure on success, NULL on failure.	276	* @return New thread's structure on success, NULL on failure.
278	*	277	*
279	*/	278	*/
280	thread_t thread_create(void ( func)(void ), void arg, task_t *task,	279	thread_t thread_create(void ( func)(void ), void arg, task_t *task,
281	int flags, char *name, bool uncounted)	280	int flags, char *name, bool uncounted)
282	{	281	{
283	thread_t *t;	282	thread_t *t;
284	ipl_t ipl;	283	ipl_t ipl;
285		284
286	t = (thread_t *) slab_alloc(thread_slab, 0);	285	t = (thread_t *) slab_alloc(thread_slab, 0);
287	if (!t)	286	if (!t)
288	return NULL;	287	return NULL;
289		288
290	/* Not needed, but good for debugging */	289	/* Not needed, but good for debugging */
291	memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES,	290	memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES,
292	0);	291	0);
293		292
294	ipl = interrupts_disable();	293	ipl = interrupts_disable();
295	spinlock_lock(&tidlock);	294	spinlock_lock(&tidlock);
296	t->tid = ++last_tid;	295	t->tid = ++last_tid;
297	spinlock_unlock(&tidlock);	296	spinlock_unlock(&tidlock);
298	interrupts_restore(ipl);	297	interrupts_restore(ipl);
299		298
300	context_save(&t->saved_context);	299	context_save(&t->saved_context);
301	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,	300	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,
302	THREAD_STACK_SIZE);	301	THREAD_STACK_SIZE);
303		302
304	the_initialize((the_t *) t->kstack);	303	the_initialize((the_t *) t->kstack);
305		304
306	ipl = interrupts_disable();	305	ipl = interrupts_disable();
307	t->saved_context.ipl = interrupts_read();	306	t->saved_context.ipl = interrupts_read();
308	interrupts_restore(ipl);	307	interrupts_restore(ipl);
309		308
310	memcpy(t->name, name, THREAD_NAME_BUFLEN);	309	memcpy(t->name, name, THREAD_NAME_BUFLEN);
311		310
312	t->thread_code = func;	311	t->thread_code = func;
313	t->thread_arg = arg;	312	t->thread_arg = arg;
314	t->ticks = -1;	313	t->ticks = -1;
315	t->cycles = 0;	314	t->cycles = 0;
316	t->uncounted = uncounted;	315	t->uncounted = uncounted;
317	t->priority = -1; /* start in rq[0] */	316	t->priority = -1; /* start in rq[0] */
318	t->cpu = NULL;	317	t->cpu = NULL;
319	t->flags = flags;	318	t->flags = flags;
320	t->state = Entering;	319	t->state = Entering;
321	t->call_me = NULL;	320	t->call_me = NULL;
322	t->call_me_with = NULL;	321	t->call_me_with = NULL;
323		322
324	timeout_initialize(&t->sleep_timeout);	323	timeout_initialize(&t->sleep_timeout);
325	t->sleep_interruptible = false;	324	t->sleep_interruptible = false;
326	t->sleep_queue = NULL;	325	t->sleep_queue = NULL;
327	t->timeout_pending = 0;	326	t->timeout_pending = 0;
328		327
329	t->in_copy_from_uspace = false;	328	t->in_copy_from_uspace = false;
330	t->in_copy_to_uspace = false;	329	t->in_copy_to_uspace = false;
331		330
332	t->interrupted = false;	331	t->interrupted = false;
333	t->detached = false;	332	t->detached = false;
334	waitq_initialize(&t->join_wq);	333	waitq_initialize(&t->join_wq);
335		334
336	t->rwlock_holder_type = RWLOCK_NONE;	335	t->rwlock_holder_type = RWLOCK_NONE;
337		336
338	t->task = task;	337	t->task = task;
339		338
340	t->fpu_context_exists = 0;	339	t->fpu_context_exists = 0;
341	t->fpu_context_engaged = 0;	340	t->fpu_context_engaged = 0;
342		341
343	avltree_node_initialize(&t->threads_tree_node);	342	avltree_node_initialize(&t->threads_tree_node);
344	t->threads_tree_node.key = (uintptr_t) t;	343	t->threads_tree_node.key = (uintptr_t) t;
345	// t->threads_tree_node.key = (avltree_key_t) t->tid;	-
346		344
347	/* might depend on previous initialization */	345	/* might depend on previous initialization */
348	thread_create_arch(t);	346	thread_create_arch(t);
349		-
350	/* init tdebug stuff */	-
351	tdebug_thread_init(t);	-
352		347
353	if (!(flags & THREAD_FLAG_NOATTACH))	348	if (!(flags & THREAD_FLAG_NOATTACH))
354	thread_attach(t, task);	349	thread_attach(t, task);
355		350
356	return t;	351	return t;
357	}	352	}
358		353
359	/** Destroy thread memory structure	354	/** Destroy thread memory structure
360	*	355	*
361	* Detach thread from all queues, cpus etc. and destroy it.	356	* Detach thread from all queues, cpus etc. and destroy it.
362	*	357	*
363	* Assume thread->lock is held!!	358	* Assume thread->lock is held!!
364	*/	359	*/
365	void thread_destroy(thread_t *t)	360	void thread_destroy(thread_t *t)
366	{	361	{
367	ASSERT(t->state == Exiting \|\| t->state == Lingering);	362	ASSERT(t->state == Exiting \|\| t->state == Lingering);
368	ASSERT(t->task);	363	ASSERT(t->task);
369	ASSERT(t->cpu);	364	ASSERT(t->cpu);
370		365
371	spinlock_lock(&t->cpu->lock);	366	spinlock_lock(&t->cpu->lock);
372	if (t->cpu->fpu_owner == t)	367	if (t->cpu->fpu_owner == t)
373	t->cpu->fpu_owner = NULL;	368	t->cpu->fpu_owner = NULL;
374	spinlock_unlock(&t->cpu->lock);	369	spinlock_unlock(&t->cpu->lock);
375		370
376	spinlock_unlock(&t->lock);	371	spinlock_unlock(&t->lock);
377		372
378	spinlock_lock(&threads_lock);	373	spinlock_lock(&threads_lock);
379	avltree_delete(&threads_tree, &t->threads_tree_node);	374	avltree_delete(&threads_tree, &t->threads_tree_node);
380	spinlock_unlock(&threads_lock);	375	spinlock_unlock(&threads_lock);
381		376
382	/*	377	/*
383	* Detach from the containing task.	378	* Detach from the containing task.
384	*/	379	*/
385	spinlock_lock(&t->task->lock);	380	spinlock_lock(&t->task->lock);
386	list_remove(&t->th_link);	381	list_remove(&t->th_link);
387	spinlock_unlock(&t->task->lock);	382	spinlock_unlock(&t->task->lock);
388		383
389	/*	384	/*
390	* t is guaranteed to be the very last thread of its task.	385	* t is guaranteed to be the very last thread of its task.
391	* It is safe to destroy the task.	386	* It is safe to destroy the task.
392	*/	387	*/
393	if (atomic_predec(&t->task->refcount) == 0)	388	if (atomic_predec(&t->task->refcount) == 0)
394	task_destroy(t->task);	389	task_destroy(t->task);
395		390
396	slab_free(thread_slab, t);	391	slab_free(thread_slab, t);
397	}	392	}
398		393
399	/** Make the thread visible to the system.	394	/** Make the thread visible to the system.
400	*	395	*
401	* Attach the thread structure to the current task and make it visible in the	396	* Attach the thread structure to the current task and make it visible in the
402	* threads_tree.	397	* threads_tree.
403	*	398	*
404	* @param t Thread to be attached to the task.	399	* @param t Thread to be attached to the task.
405	* @param task Task to which the thread is to be attached.	400	* @param task Task to which the thread is to be attached.
406	*/	401	*/
407	void thread_attach(thread_t t, task_t task)	402	void thread_attach(thread_t t, task_t task)
408	{	403	{
409	ipl_t ipl;	404	ipl_t ipl;
410		405
411	/*	406	/*
412	* Attach to the current task.	407	* Attach to the current task.
413	*/	408	*/
414	ipl = interrupts_disable();	409	ipl = interrupts_disable();
415	spinlock_lock(&task->lock);	410	spinlock_lock(&task->lock);
416	atomic_inc(&task->refcount);	411	atomic_inc(&task->refcount);
417	atomic_inc(&task->lifecount);	412	atomic_inc(&task->lifecount);
418	list_append(&t->th_link, &task->th_head);	413	list_append(&t->th_link, &task->th_head);
419	spinlock_unlock(&task->lock);	414	spinlock_unlock(&task->lock);
420		415
421	/*	416	/*
422	* Register this thread in the system-wide list.	417	* Register this thread in the system-wide list.
423	*/	418	*/
424	spinlock_lock(&threads_lock);	419	spinlock_lock(&threads_lock);
425	avltree_insert(&threads_tree, &t->threads_tree_node);	420	avltree_insert(&threads_tree, &t->threads_tree_node);
426	spinlock_unlock(&threads_lock);	421	spinlock_unlock(&threads_lock);
427		422
428	interrupts_restore(ipl);	423	interrupts_restore(ipl);
429	}	424	}
430		425
431	/** Terminate thread.	426	/** Terminate thread.
432	*	427	*
433	* End current thread execution and switch it to the exiting state. All pending	428	* End current thread execution and switch it to the exiting state. All pending
434	* timeouts are executed.	429	* timeouts are executed.
435	*/	430	*/
436	void thread_exit(void)	431	void thread_exit(void)
437	{	432	{
438	ipl_t ipl;	433	ipl_t ipl;
439		434
440	if (atomic_predec(&TASK->lifecount) == 0) {	435	if (atomic_predec(&TASK->lifecount) == 0) {
441	/*	436	/*
442	* We are the last thread in the task that still has not exited.	437	* We are the last thread in the task that still has not exited.
443	* With the exception of the moment the task was created, new	438	* With the exception of the moment the task was created, new
444	* threads can only be created by threads of the same task.	439	* threads can only be created by threads of the same task.
445	* We are safe to perform cleanup.	440	* We are safe to perform cleanup.
446	*/	441	*/
447	if (THREAD->flags & THREAD_FLAG_USPACE) {	442	if (THREAD->flags & THREAD_FLAG_USPACE) {
448	ipc_cleanup();	443	ipc_cleanup();
449	futex_cleanup();	444	futex_cleanup();
450	tdebug_cleanup();	-
451	klog_printf("Cleanup of task %llu completed.",	445	klog_printf("Cleanup of task %llu completed.",
452	TASK->taskid);	446	TASK->taskid);
453	}	447	}
454	}	448	}
455		449
456	restart:	450	restart:
457	ipl = interrupts_disable();	451	ipl = interrupts_disable();
458	spinlock_lock(&THREAD->lock);	452	spinlock_lock(&THREAD->lock);
459	if (THREAD->timeout_pending) {	453	if (THREAD->timeout_pending) {
460	/* busy waiting for timeouts in progress */	454	/* busy waiting for timeouts in progress */
461	spinlock_unlock(&THREAD->lock);	455	spinlock_unlock(&THREAD->lock);
462	interrupts_restore(ipl);	456	interrupts_restore(ipl);
463	goto restart;	457	goto restart;
464	}	458	}
465		459
466	THREAD->state = Exiting;	460	THREAD->state = Exiting;
467	spinlock_unlock(&THREAD->lock);	461	spinlock_unlock(&THREAD->lock);
468	scheduler();	462	scheduler();
469		463
470	/* Not reached */	464	/* Not reached */
471	while (1)	465	while (1)
472	;	466	;
473	}	467	}
474		468
475		469
476	/** Thread sleep	470	/** Thread sleep
477	*	471	*
478	* Suspend execution of the current thread.	472	* Suspend execution of the current thread.
479	*	473	*
480	* @param sec Number of seconds to sleep.	474	* @param sec Number of seconds to sleep.
481	*	475	*
482	*/	476	*/
483	void thread_sleep(uint32_t sec)	477	void thread_sleep(uint32_t sec)
484	{	478	{
485	thread_usleep(sec * 1000000);	479	thread_usleep(sec * 1000000);
486	}	480	}
487		481
488	/** Wait for another thread to exit.	482	/** Wait for another thread to exit.
489	*	483	*
490	* @param t Thread to join on exit.	484	* @param t Thread to join on exit.
491	* @param usec Timeout in microseconds.	485	* @param usec Timeout in microseconds.
492	* @param flags Mode of operation.	486	* @param flags Mode of operation.
493	*	487	*
494	* @return An error code from errno.h or an error code from synch.h.	488	* @return An error code from errno.h or an error code from synch.h.
495	*/	489	*/
496	int thread_join_timeout(thread_t *t, uint32_t usec, int flags)	490	int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
497	{	491	{
498	ipl_t ipl;	492	ipl_t ipl;
499	int rc;	493	int rc;
500		494

Subversion Repositories HelenOS

(root)/branches/tracing/kernel/generic/src/proc/thread.c @ 3030 – Rev 2787 → 2799