WebSVN – HelenOS – Diff – /trunk/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/btree.h>
#include <adt/list.h>
#include <typedefs.h>
#include <time/clock.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>
 
 
/** Thread states */
char *thread_states[] = {
    "Invalid",
    "Running",
    "Sleeping",
    "Ready",
    "Entering",
    "Exiting",
    "Undead"
};
 
/** Lock protecting the threads_btree B+tree. For locking rules, see declaration thereof. */
SPINLOCK_INITIALIZE(threads_lock);
 
/** B+tree of all threads.
 *
 * When a thread is found in the threads_btree B+tree, it is guaranteed to exist as long
 * as the threads_lock is held.
 */
btree_t threads_btree;     
 
SPINLOCK_INITIALIZE(tidlock);
uint32_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);
    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);
   
    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 = 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
 
    btree_create(&threads_btree);
}
 
/** 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) {
        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);
}
 
/** 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)
{
    bool destroy_task = false; 
 
    ASSERT(t->state == Exiting || t->state == Undead);
    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);
    btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL);
    spinlock_unlock(&threads_lock);
 
    /*
     * Detach from the containing task.
     */
    spinlock_lock(&t->task->lock);
    list_remove(&t->th_link);
    if (--t->task->refcount == 0) {
        t->task->accept_new_threads = false;
        destroy_task = true;
    }
    spinlock_unlock(&t->task->lock);   
   
    if (destroy_task)
        task_destroy(t->task);
   
    slab_free(thread_slab, t);
}
 
/** 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.
 *
 * @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)
{
    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->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->join_type = None;
    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;
 
    thread_create_arch(t);      /* might depend on previous initialization */
   
    /*
     * Attach to the containing task.
     */
    ipl = interrupts_disable();  
    spinlock_lock(&task->lock);
    if (!task->accept_new_threads) {
        spinlock_unlock(&task->lock);
        slab_free(thread_slab, t);
        interrupts_restore(ipl);
        return NULL;
    }
    list_append(&t->th_link, &task->th_head);
    if (task->refcount++ == 0)
        task->main_thread = t;
    spinlock_unlock(&task->lock);
 
    /*
     * Register this thread in the system-wide list.
     */
    spinlock_lock(&threads_lock);
    btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, NULL);
    spinlock_unlock(&threads_lock);
   
    interrupts_restore(ipl);
   
    return t;
}
 
/** 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;
 
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 Undead state,
 * deallocate its resources.
 *
 * @param t Thread to be detached.
 */
void thread_detach(thread_t *t)
{
    ipl_t ipl;
 
    /*
     * Since the thread is expected to not be already detached,
     * pointer to it must be still valid.
     */
    ipl = interrupts_disable();
    spinlock_lock(&t->lock);
    ASSERT(!t->detached);
    if (t->state == Undead) {
        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);
}
 
/** Print list of threads debug info */
void thread_print_list(void)
{
    link_t *cur;
    ipl_t ipl;
   
    /* Messing with thread structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&threads_lock);
   
    printf("tid    name       address    state    task       ctx code       stack      cycles     cpu  kstack     waitqueue\n");
    printf("------ ---------- ---------- -------- ---------- --- ---------- ---------- ---------- ---- ---------- ----------\n");
 
    for (cur = threads_btree.leaf_head.next; cur != &threads_btree.leaf_head; cur = cur->next) {
        btree_node_t *node;
        int i;
 
        node = list_get_instance(cur, btree_node_t, leaf_link);
        for (i = 0; i < node->keys; i++) {
            thread_t *t;
       
            t = (thread_t *) node->value[i];
           
            uint64_t cycles;
            char suffix;
           
            if (t->cycles > 1000000000000000000LL) {
                cycles = t->cycles / 1000000000000000000LL;
                suffix = 'E';
            } else if (t->cycles > 1000000000000LL) {
                cycles = t->cycles / 1000000000000LL;
                suffix = 'T';
            } else if (t->cycles > 1000000LL) {
                cycles = t->cycles / 1000000LL;
                suffix = 'M';
            } else {
                cycles = t->cycles;
                suffix = ' ';
            }
           
            printf("%-6zd %-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);
           
            if (t->cpu)
                printf("%-4zd", t->cpu->id);
            else
                printf("none");
           
            if (t->state == Sleeping)
                printf(" %#10zx %#10zx", t->kstack, t->sleep_queue);
           
            printf("\n");
        }
    }
 
    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)
{
    btree_node_t *leaf;
   
    return btree_search(&threads_btree, (btree_key_t) ((uintptr_t) t), &leaf) != 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_t *t;
    char namebuf[THREAD_NAME_BUFLEN];
    uspace_arg_t *kernel_uarg;
    uint32_t tid;
    int rc;
 
    rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN);
    if (rc != 0)
        return (unative_t) rc;
 
    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;
    }
 
    if ((t = thread_create(uinit, kernel_uarg, TASK, THREAD_FLAG_USPACE, namebuf))) {
        tid = t->tid;
        thread_ready(t);
        return (unative_t) tid;
    } 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;
}
 
/** @}
 */
 

Rev 2032	Rev 2039
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/btree.h>	54	#include <adt/btree.h>
55	#include <adt/list.h>	55	#include <adt/list.h>
56	#include <typedefs.h>	56	#include <typedefs.h>
57	#include <time/clock.h>	57	#include <time/clock.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		70
71		71
72	/** Thread states */	72	/** Thread states */
73	char *thread_states[] = {	73	char *thread_states[] = {
74	"Invalid",	74	"Invalid",
75	"Running",	75	"Running",
76	"Sleeping",	76	"Sleeping",
77	"Ready",	77	"Ready",
78	"Entering",	78	"Entering",
79	"Exiting",	79	"Exiting",
80	"Undead"	80	"Undead"
81	};	81	};
82		82
83	/** Lock protecting the threads_btree B+tree. For locking rules, see declaration thereof. */	83	/** Lock protecting the threads_btree B+tree. For locking rules, see declaration thereof. */
84	SPINLOCK_INITIALIZE(threads_lock);	84	SPINLOCK_INITIALIZE(threads_lock);
85		85
86	/** B+tree of all threads.	86	/** B+tree of all threads.
87	*	87	*
88	* When a thread is found in the threads_btree B+tree, it is guaranteed to exist as long	88	* When a thread is found in the threads_btree B+tree, it is guaranteed to exist as long
89	* as the threads_lock is held.	89	* as the threads_lock is held.
90	*/	90	*/
91	btree_t threads_btree;	91	btree_t threads_btree;
92		92
93	SPINLOCK_INITIALIZE(tidlock);	93	SPINLOCK_INITIALIZE(tidlock);
94	uint32_t last_tid = 0;	94	uint32_t last_tid = 0;
95		95
96	static slab_cache_t *thread_slab;	96	static slab_cache_t *thread_slab;
97	#ifdef ARCH_HAS_FPU	97	#ifdef ARCH_HAS_FPU
98	slab_cache_t *fpu_context_slab;	98	slab_cache_t *fpu_context_slab;
99	#endif	99	#endif
100		100
101	/** Thread wrapper	101	/** Thread wrapper
102	*	102	*
103	* This wrapper is provided to ensure that every thread	103	* This wrapper is provided to ensure that every thread
104	* makes a call to thread_exit() when its implementing	104	* makes a call to thread_exit() when its implementing
105	* function returns.	105	* function returns.
106	*	106	*
107	* interrupts_disable() is assumed.	107	* interrupts_disable() is assumed.
108	*	108	*
109	*/	109	*/
110	static void cushion(void)	110	static void cushion(void)
111	{	111	{
112	void (f)(void ) = THREAD->thread_code;	112	void (f)(void ) = THREAD->thread_code;
113	void *arg = THREAD->thread_arg;	113	void *arg = THREAD->thread_arg;
114	THREAD->last_cycle = get_cycle();	114	THREAD->last_cycle = get_cycle();
115		115
116	/* this is where each thread wakes up after its creation */	116	/* This is where each thread wakes up after its creation */
117	spinlock_unlock(&THREAD->lock);	117	spinlock_unlock(&THREAD->lock);
118	interrupts_enable();	118	interrupts_enable();
119		119
120	f(arg);	120	f(arg);
-		121
-		122	/* Accumulate accounting to the task */
-		123	ipl_t ipl = interrupts_disable();
-		124
-		125	spinlock_lock(&THREAD->lock);
-		126	thread_update_accounting();
-		127	uint64_t cycles = THREAD->cycles;
-		128	THREAD->cycles = 0;
-		129	spinlock_unlock(&THREAD->lock);
-		130
-		131	spinlock_lock(&TASK->lock);
-		132	TASK->cycles += cycles;
-		133	spinlock_unlock(&TASK->lock);
-		134
-		135	interrupts_restore(ipl);
-		136
121	thread_exit();	137	thread_exit();
122	/* not reached */	138	/* not reached */
123	}	139	}
124		140
125	/** Initialization and allocation for thread_t structure */	141	/** Initialization and allocation for thread_t structure */
126	static int thr_constructor(void *obj, int kmflags)	142	static int thr_constructor(void *obj, int kmflags)
127	{	143	{
128	thread_t t = (thread_t ) obj;	144	thread_t t = (thread_t ) obj;
129		145
130	spinlock_initialize(&t->lock, "thread_t_lock");	146	spinlock_initialize(&t->lock, "thread_t_lock");
131	link_initialize(&t->rq_link);	147	link_initialize(&t->rq_link);
132	link_initialize(&t->wq_link);	148	link_initialize(&t->wq_link);
133	link_initialize(&t->th_link);	149	link_initialize(&t->th_link);
134		150
135	/* call the architecture-specific part of the constructor */	151	/* call the architecture-specific part of the constructor */
136	thr_constructor_arch(t);	152	thr_constructor_arch(t);
137		153
138	#ifdef ARCH_HAS_FPU	154	#ifdef ARCH_HAS_FPU
139	# ifdef CONFIG_FPU_LAZY	155	# ifdef CONFIG_FPU_LAZY
140	t->saved_fpu_context = NULL;	156	t->saved_fpu_context = NULL;
141	# else	157	# else
142	t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags);	158	t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags);
143	if (!t->saved_fpu_context)	159	if (!t->saved_fpu_context)
144	return -1;	160	return -1;
145	# endif	161	# endif
146	#endif	162	#endif
147		163
148	t->kstack = frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);	164	t->kstack = frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);
149	if (! t->kstack) {	165	if (! t->kstack) {
150	#ifdef ARCH_HAS_FPU	166	#ifdef ARCH_HAS_FPU
151	if (t->saved_fpu_context)	167	if (t->saved_fpu_context)
152	slab_free(fpu_context_slab,t->saved_fpu_context);	168	slab_free(fpu_context_slab,t->saved_fpu_context);
153	#endif	169	#endif
154	return -1;	170	return -1;
155	}	171	}
156		172
157	return 0;	173	return 0;
158	}	174	}
159		175
160	/** Destruction of thread_t object */	176	/** Destruction of thread_t object */
161	static int thr_destructor(void *obj)	177	static int thr_destructor(void *obj)
162	{	178	{
163	thread_t t = (thread_t ) obj;	179	thread_t t = (thread_t ) obj;
164		180
165	/* call the architecture-specific part of the destructor */	181	/* call the architecture-specific part of the destructor */
166	thr_destructor_arch(t);	182	thr_destructor_arch(t);
167		183
168	frame_free(KA2PA(t->kstack));	184	frame_free(KA2PA(t->kstack));
169	#ifdef ARCH_HAS_FPU	185	#ifdef ARCH_HAS_FPU
170	if (t->saved_fpu_context)	186	if (t->saved_fpu_context)
171	slab_free(fpu_context_slab,t->saved_fpu_context);	187	slab_free(fpu_context_slab,t->saved_fpu_context);
172	#endif	188	#endif
173	return 1; /* One page freed */	189	return 1; /* One page freed */
174	}	190	}
175		191
176	/** Initialize threads	192	/** Initialize threads
177	*	193	*
178	* Initialize kernel threads support.	194	* Initialize kernel threads support.
179	*	195	*
180	*/	196	*/
181	void thread_init(void)	197	void thread_init(void)
182	{	198	{
183	THREAD = NULL;	199	THREAD = NULL;
184	atomic_set(&nrdy,0);	200	atomic_set(&nrdy,0);
185	thread_slab = slab_cache_create("thread_slab",	201	thread_slab = slab_cache_create("thread_slab",
186	sizeof(thread_t),0,	202	sizeof(thread_t),0,
187	thr_constructor, thr_destructor, 0);	203	thr_constructor, thr_destructor, 0);
188	#ifdef ARCH_HAS_FPU	204	#ifdef ARCH_HAS_FPU
189	fpu_context_slab = slab_cache_create("fpu_slab",	205	fpu_context_slab = slab_cache_create("fpu_slab",
190	sizeof(fpu_context_t),	206	sizeof(fpu_context_t),
191	FPU_CONTEXT_ALIGN,	207	FPU_CONTEXT_ALIGN,
192	NULL, NULL, 0);	208	NULL, NULL, 0);
193	#endif	209	#endif
194		210
195	btree_create(&threads_btree);	211	btree_create(&threads_btree);
196	}	212	}
197		213
198	/** Make thread ready	214	/** Make thread ready
199	*	215	*
200	* Switch thread t to the ready state.	216	* Switch thread t to the ready state.
201	*	217	*
202	* @param t Thread to make ready.	218	* @param t Thread to make ready.
203	*	219	*
204	*/	220	*/
205	void thread_ready(thread_t *t)	221	void thread_ready(thread_t *t)
206	{	222	{
207	cpu_t *cpu;	223	cpu_t *cpu;
208	runq_t *r;	224	runq_t *r;
209	ipl_t ipl;	225	ipl_t ipl;
210	int i, avg;	226	int i, avg;
211		227
212	ipl = interrupts_disable();	228	ipl = interrupts_disable();
213		229
214	spinlock_lock(&t->lock);	230	spinlock_lock(&t->lock);
215		231
216	ASSERT(! (t->state == Ready));	232	ASSERT(! (t->state == Ready));
217		233
218	i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority;	234	i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority;
219		235
220	cpu = CPU;	236	cpu = CPU;
221	if (t->flags & THREAD_FLAG_WIRED) {	237	if (t->flags & THREAD_FLAG_WIRED) {
222	cpu = t->cpu;	238	cpu = t->cpu;
223	}	239	}
224	t->state = Ready;	240	t->state = Ready;
225	spinlock_unlock(&t->lock);	241	spinlock_unlock(&t->lock);
226		242
227	/*	243	/*
228	* Append t to respective ready queue on respective processor.	244	* Append t to respective ready queue on respective processor.
229	*/	245	*/
230	r = &cpu->rq[i];	246	r = &cpu->rq[i];
231	spinlock_lock(&r->lock);	247	spinlock_lock(&r->lock);
232	list_append(&t->rq_link, &r->rq_head);	248	list_append(&t->rq_link, &r->rq_head);
233	r->n++;	249	r->n++;
234	spinlock_unlock(&r->lock);	250	spinlock_unlock(&r->lock);
235		251
236	atomic_inc(&nrdy);	252	atomic_inc(&nrdy);
237	avg = atomic_get(&nrdy) / config.cpu_active;	253	avg = atomic_get(&nrdy) / config.cpu_active;
238	atomic_inc(&cpu->nrdy);	254	atomic_inc(&cpu->nrdy);
239		255
240	interrupts_restore(ipl);	256	interrupts_restore(ipl);
241	}	257	}
242		258
243	/** Destroy thread memory structure	259	/** Destroy thread memory structure
244	*	260	*
245	* Detach thread from all queues, cpus etc. and destroy it.	261	* Detach thread from all queues, cpus etc. and destroy it.
246	*	262	*
247	* Assume thread->lock is held!!	263	* Assume thread->lock is held!!
248	*/	264	*/
249	void thread_destroy(thread_t *t)	265	void thread_destroy(thread_t *t)
250	{	266	{
251	bool destroy_task = false;	267	bool destroy_task = false;
252		268
253	ASSERT(t->state == Exiting \|\| t->state == Undead);	269	ASSERT(t->state == Exiting \|\| t->state == Undead);
254	ASSERT(t->task);	270	ASSERT(t->task);
255	ASSERT(t->cpu);	271	ASSERT(t->cpu);
256		272
257	spinlock_lock(&t->cpu->lock);	273	spinlock_lock(&t->cpu->lock);
258	if(t->cpu->fpu_owner==t)	274	if(t->cpu->fpu_owner==t)
259	t->cpu->fpu_owner=NULL;	275	t->cpu->fpu_owner=NULL;
260	spinlock_unlock(&t->cpu->lock);	276	spinlock_unlock(&t->cpu->lock);
261		277
262	spinlock_unlock(&t->lock);	278	spinlock_unlock(&t->lock);
263		279
264	spinlock_lock(&threads_lock);	280	spinlock_lock(&threads_lock);
265	btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL);	281	btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL);
266	spinlock_unlock(&threads_lock);	282	spinlock_unlock(&threads_lock);
267		283
268	/*	284	/*
269	* Detach from the containing task.	285	* Detach from the containing task.
270	*/	286	*/
271	spinlock_lock(&t->task->lock);	287	spinlock_lock(&t->task->lock);
272	list_remove(&t->th_link);	288	list_remove(&t->th_link);
273	if (--t->task->refcount == 0) {	289	if (--t->task->refcount == 0) {
274	t->task->accept_new_threads = false;	290	t->task->accept_new_threads = false;
275	destroy_task = true;	291	destroy_task = true;
276	}	292	}
277	spinlock_unlock(&t->task->lock);	293	spinlock_unlock(&t->task->lock);
278		294
279	if (destroy_task)	295	if (destroy_task)
280	task_destroy(t->task);	296	task_destroy(t->task);
281		297
282	slab_free(thread_slab, t);	298	slab_free(thread_slab, t);
283	}	299	}
284		300
285	/** Create new thread	301	/** Create new thread
286	*	302	*
287	* Create a new thread.	303	* Create a new thread.
288	*	304	*
289	* @param func Thread's implementing function.	305	* @param func Thread's implementing function.
290	* @param arg Thread's implementing function argument.	306	* @param arg Thread's implementing function argument.
291	* @param task Task to which the thread belongs.	307	* @param task Task to which the thread belongs.
292	* @param flags Thread flags.	308	* @param flags Thread flags.
293	* @param name Symbolic name.	309	* @param name Symbolic name.
294	*	310	*
295	* @return New thread's structure on success, NULL on failure.	311	* @return New thread's structure on success, NULL on failure.
296	*	312	*
297	*/	313	*/
298	thread_t thread_create(void ( func)(void ), void arg, task_t task, int flags, char name)	314	thread_t thread_create(void ( func)(void ), void arg, task_t task, int flags, char name)
299	{	315	{
300	thread_t *t;	316	thread_t *t;
301	ipl_t ipl;	317	ipl_t ipl;
302		318
303	t = (thread_t *) slab_alloc(thread_slab, 0);	319	t = (thread_t *) slab_alloc(thread_slab, 0);
304	if (!t)	320	if (!t)
305	return NULL;	321	return NULL;
306		322
307	/* Not needed, but good for debugging */	323	/* Not needed, but good for debugging */
308	memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);	324	memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);
309		325
310	ipl = interrupts_disable();	326	ipl = interrupts_disable();
311	spinlock_lock(&tidlock);	327	spinlock_lock(&tidlock);
312	t->tid = ++last_tid;	328	t->tid = ++last_tid;
313	spinlock_unlock(&tidlock);	329	spinlock_unlock(&tidlock);
314	interrupts_restore(ipl);	330	interrupts_restore(ipl);
315		331
316	context_save(&t->saved_context);	332	context_save(&t->saved_context);
317	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, THREAD_STACK_SIZE);	333	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, THREAD_STACK_SIZE);
318		334
319	the_initialize((the_t *) t->kstack);	335	the_initialize((the_t *) t->kstack);
320		336
321	ipl = interrupts_disable();	337	ipl = interrupts_disable();
322	t->saved_context.ipl = interrupts_read();	338	t->saved_context.ipl = interrupts_read();
323	interrupts_restore(ipl);	339	interrupts_restore(ipl);
324		340
325	memcpy(t->name, name, THREAD_NAME_BUFLEN);	341	memcpy(t->name, name, THREAD_NAME_BUFLEN);
326		342
327	t->thread_code = func;	343	t->thread_code = func;
328	t->thread_arg = arg;	344	t->thread_arg = arg;
329	t->ticks = -1;	345	t->ticks = -1;
330	t->cycles = 0;	346	t->cycles = 0;
331	t->priority = -1; /* start in rq[0] */	347	t->priority = -1; /* start in rq[0] */
332	t->cpu = NULL;	348	t->cpu = NULL;
333	t->flags = flags;	349	t->flags = flags;
334	t->state = Entering;	350	t->state = Entering;
335	t->call_me = NULL;	351	t->call_me = NULL;
336	t->call_me_with = NULL;	352	t->call_me_with = NULL;
337		353
338	timeout_initialize(&t->sleep_timeout);	354	timeout_initialize(&t->sleep_timeout);
339	t->sleep_interruptible = false;	355	t->sleep_interruptible = false;
340	t->sleep_queue = NULL;	356	t->sleep_queue = NULL;
341	t->timeout_pending = 0;	357	t->timeout_pending = 0;
342		358
343	t->in_copy_from_uspace = false;	359	t->in_copy_from_uspace = false;
344	t->in_copy_to_uspace = false;	360	t->in_copy_to_uspace = false;
345		361
346	t->interrupted = false;	362	t->interrupted = false;
347	t->join_type = None;	363	t->join_type = None;
348	t->detached = false;	364	t->detached = false;
349	waitq_initialize(&t->join_wq);	365	waitq_initialize(&t->join_wq);
350		366
351	t->rwlock_holder_type = RWLOCK_NONE;	367	t->rwlock_holder_type = RWLOCK_NONE;
352		368
353	t->task = task;	369	t->task = task;
354		370
355	t->fpu_context_exists = 0;	371	t->fpu_context_exists = 0;
356	t->fpu_context_engaged = 0;	372	t->fpu_context_engaged = 0;
357		373
358	thread_create_arch(t); /* might depend on previous initialization */	374	thread_create_arch(t); /* might depend on previous initialization */
359		375
360	/*	376	/*
361	* Attach to the containing task.	377	* Attach to the containing task.
362	*/	378	*/
363	ipl = interrupts_disable();	379	ipl = interrupts_disable();
364	spinlock_lock(&task->lock);	380	spinlock_lock(&task->lock);
365	if (!task->accept_new_threads) {	381	if (!task->accept_new_threads) {
366	spinlock_unlock(&task->lock);	382	spinlock_unlock(&task->lock);
367	slab_free(thread_slab, t);	383	slab_free(thread_slab, t);
368	interrupts_restore(ipl);	384	interrupts_restore(ipl);
369	return NULL;	385	return NULL;
370	}	386	}
371	list_append(&t->th_link, &task->th_head);	387	list_append(&t->th_link, &task->th_head);
372	if (task->refcount++ == 0)	388	if (task->refcount++ == 0)
373	task->main_thread = t;	389	task->main_thread = t;
374	spinlock_unlock(&task->lock);	390	spinlock_unlock(&task->lock);
375		391
376	/*	392	/*
377	* Register this thread in the system-wide list.	393	* Register this thread in the system-wide list.
378	*/	394	*/
379	spinlock_lock(&threads_lock);	395	spinlock_lock(&threads_lock);
380	btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, NULL);	396	btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, NULL);
381	spinlock_unlock(&threads_lock);	397	spinlock_unlock(&threads_lock);
382		398
383	interrupts_restore(ipl);	399	interrupts_restore(ipl);
384		400
385	return t;	401	return t;
386	}	402	}
387		403
388	/** Terminate thread.	404	/** Terminate thread.
389	*	405	*
390	* End current thread execution and switch it to the exiting	406	* End current thread execution and switch it to the exiting
391	* state. All pending timeouts are executed.	407	* state. All pending timeouts are executed.
392	*	408	*
393	*/	409	*/
394	void thread_exit(void)	410	void thread_exit(void)
395	{	411	{
396	ipl_t ipl;	412	ipl_t ipl;
397		413
398	restart:	414	restart:
399	ipl = interrupts_disable();	415	ipl = interrupts_disable();
400	spinlock_lock(&THREAD->lock);	416	spinlock_lock(&THREAD->lock);
401	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */	417	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
402	spinlock_unlock(&THREAD->lock);	418	spinlock_unlock(&THREAD->lock);
403	interrupts_restore(ipl);	419	interrupts_restore(ipl);
404	goto restart;	420	goto restart;
405	}	421	}
406	THREAD->state = Exiting;	422	THREAD->state = Exiting;
407	spinlock_unlock(&THREAD->lock);	423	spinlock_unlock(&THREAD->lock);
408	scheduler();	424	scheduler();
409		425
410	/* Not reached */	426	/* Not reached */
411	while (1)	427	while (1)
412	;	428	;
413	}	429	}
414		430
415		431
416	/** Thread sleep	432	/** Thread sleep
417	*	433	*
418	* Suspend execution of the current thread.	434	* Suspend execution of the current thread.
419	*	435	*
420	* @param sec Number of seconds to sleep.	436	* @param sec Number of seconds to sleep.
421	*	437	*
422	*/	438	*/
423	void thread_sleep(uint32_t sec)	439	void thread_sleep(uint32_t sec)
424	{	440	{
425	thread_usleep(sec*1000000);	441	thread_usleep(sec*1000000);
426	}	442	}
427		443
428	/** Wait for another thread to exit.	444	/** Wait for another thread to exit.
429	*	445	*
430	* @param t Thread to join on exit.	446	* @param t Thread to join on exit.
431	* @param usec Timeout in microseconds.	447	* @param usec Timeout in microseconds.
432	* @param flags Mode of operation.	448	* @param flags Mode of operation.
433	*	449	*
434	* @return An error code from errno.h or an error code from synch.h.	450	* @return An error code from errno.h or an error code from synch.h.
435	*/	451	*/
436	int thread_join_timeout(thread_t *t, uint32_t usec, int flags)	452	int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
437	{	453	{
438	ipl_t ipl;	454	ipl_t ipl;
439	int rc;	455	int rc;
440		456
441	if (t == THREAD)	457	if (t == THREAD)
442	return EINVAL;	458	return EINVAL;
443		459
444	/*	460	/*
445	* Since thread join can only be called once on an undetached thread,	461	* Since thread join can only be called once on an undetached thread,
446	* the thread pointer is guaranteed to be still valid.	462	* the thread pointer is guaranteed to be still valid.
447	*/	463	*/
448		464
449	ipl = interrupts_disable();	465	ipl = interrupts_disable();
450	spinlock_lock(&t->lock);	466	spinlock_lock(&t->lock);
451	ASSERT(!t->detached);	467	ASSERT(!t->detached);
452	spinlock_unlock(&t->lock);	468	spinlock_unlock(&t->lock);
453	interrupts_restore(ipl);	469	interrupts_restore(ipl);
454		470
455	rc = waitq_sleep_timeout(&t->join_wq, usec, flags);	471	rc = waitq_sleep_timeout(&t->join_wq, usec, flags);
456		472
457	return rc;	473	return rc;
458	}	474	}
459		475
460	/** Detach thread.	476	/** Detach thread.
461	*	477	*
462	* Mark the thread as detached, if the thread is already in the Undead state,	478	* Mark the thread as detached, if the thread is already in the Undead state,
463	* deallocate its resources.	479	* deallocate its resources.
464	*	480	*
465	* @param t Thread to be detached.	481	* @param t Thread to be detached.
466	*/	482	*/
467	void thread_detach(thread_t *t)	483	void thread_detach(thread_t *t)
468	{	484	{
469	ipl_t ipl;	485	ipl_t ipl;
470		486
471	/*	487	/*
472	* Since the thread is expected to not be already detached,	488	* Since the thread is expected to not be already detached,
473	* pointer to it must be still valid.	489	* pointer to it must be still valid.
474	*/	490	*/
475	ipl = interrupts_disable();	491	ipl = interrupts_disable();
476	spinlock_lock(&t->lock);	492	spinlock_lock(&t->lock);
477	ASSERT(!t->detached);	493	ASSERT(!t->detached);
478	if (t->state == Undead) {	494	if (t->state == Undead) {
479	thread_destroy(t); /* unlocks &t->lock */	495	thread_destroy(t); /* unlocks &t->lock */
480	interrupts_restore(ipl);	496	interrupts_restore(ipl);
481	return;	497	return;
482	} else {	498	} else {
483	t->detached = true;	499	t->detached = true;
484	}	500	}

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/proc/thread.c @ 3137 – Rev 2032 → 2039