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>
 
 
#ifndef LOADED_PROG_STACK_PAGES_NO
#define LOADED_PROG_STACK_PAGES_NO 1
#endif
 
 
/** 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);
 
/** AVL 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;
    }
 
    mutex_initialize(&t->udebug.lock);
 
    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. The caller must
 *          guarantee that the task won't cease to exist during the
 *          call. The task's lock may not be held.
 * @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(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;
   
    /* Init debugging stuff */
    udebug_thread_initialize(&t->udebug);
 
    /* 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 specified task.
     */
    ipl = interrupts_disable();
    spinlock_lock(&task->lock);
    atomic_inc(&task->refcount);
    /* Must not count kbox thread into lifecount */
    if (t->flags & THREAD_FLAG_USPACE)
        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 (THREAD->flags & THREAD_FLAG_USPACE) {
        /* Generate udebug THREAD_E event */
        udebug_thread_e_event();
 
        if (atomic_predec(&TASK->lifecount) == 0) {
            /*
             * We are the last userspace thread in the task that
             * still has not exited. With the exception of the
             * moment the task was created, new userspace threads
             * can only be created by threads of the same task.
             * We are safe to perform cleanup.
             */
            ipc_cleanup();
            futex_cleanup();
            LOG("Cleanup of task %" PRIu64" 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 = avltree_get_instance(node, thread_t, threads_tree_node);
   
    uint64_t cycles;
    char suffix;
    order(t->cycles, &cycles, &suffix);
 
#ifdef __32_BITS__
    printf("%-6" PRIu64" %-10s %10p %-8s %10p %-3" PRIu32 " %10p %10p %9" PRIu64 "%c ",
        t->tid, t->name, t, thread_states[t->state], t->task,
        t->task->context, t->thread_code, t->kstack, cycles, suffix);
#endif
 
#ifdef __64_BITS__
    printf("%-6" PRIu64" %-10s %18p %-8s %18p %-3" PRIu32 " %18p %18p %9" PRIu64 "%c ",
        t->tid, t->name, t, thread_states[t->state], t->task,
        t->task->context, t->thread_code, t->kstack, cycles, suffix);
#endif
           
    if (t->cpu)
        printf("%-4u", t->cpu->id);
    else
        printf("none");
           
    if (t->state == Sleeping) {
#ifdef __32_BITS__
        printf(" %10p", t->sleep_queue);
#endif
 
#ifdef __64_BITS__
        printf(" %18p", t->sleep_queue);
#endif
    }
           
    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);
 
#ifdef __32_BITS__  
    printf("tid    name       address    state    task       "
        "ctx code       stack      cycles     cpu  "
        "waitqueue\n");
    printf("------ ---------- ---------- -------- ---------- "
        "--- ---------- ---------- ---------- ---- "
        "----------\n");
#endif
 
#ifdef __64_BITS__
    printf("tid    name       address            state    task               "
        "ctx code               stack              cycles     cpu  "
        "waitqueue\n");
    printf("------ ---------- ------------------ -------- ------------------ "
        "--- ------------------ ------------------ ---------- ---- "
        "------------------\n");
#endif
 
    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;
}
 
 
/** Create new user task with 1 thread from image
 *
 * @param program_addr Address of program executable image.
 * @param name Program name.
 *
 * @return Initialized main thread of the task or NULL on error.
 */
thread_t *thread_create_program(void *program_addr, char *name)
{
    as_t *as;
    as_area_t *area;
    unsigned int rc;
    task_t *task;
    uspace_arg_t *kernel_uarg;
   
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
    if (kernel_uarg == NULL)
        return NULL;
   
    kernel_uarg->uspace_entry =
        (void *) ((elf_header_t *) program_addr)->e_entry;
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
    kernel_uarg->uspace_thread_function = NULL;
    kernel_uarg->uspace_thread_arg = NULL;
    kernel_uarg->uspace_uarg = NULL;
 
    as = as_create(0);
    if (as == NULL) {
        free(kernel_uarg);
        return NULL;
    }
 
    rc = elf_load((elf_header_t *) program_addr, as);
    if (rc != EE_OK) {
        free(kernel_uarg);
        as_destroy(as);
        return NULL;
    }
   
    /*
     * Create the data as_area.
     */
    area = as_area_create(as,
        AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
        LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
        AS_AREA_ATTR_NONE, &anon_backend, NULL);
    if (area == NULL) {
        free(kernel_uarg);
        as_destroy(as);
        return NULL;
    }
   
    task = task_create(as, name);
    if (task == NULL) {
        free(kernel_uarg);
        as_destroy(as);
        return NULL;
    }
   
    /*
     * Create the main thread.
     */
    return thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
        "uinit", false);
}
 
 
/** 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);
 
        /* Generate udebug THREAD_B event */
        udebug_thread_b_event(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 3034	Rev 3424
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
-		71
70	#include <console/klog.h>	72	#ifndef LOADED_PROG_STACK_PAGES_NO
-		73	#define LOADED_PROG_STACK_PAGES_NO 1
-		74	#endif
71		75
72		76
73	/** Thread states */	77	/** Thread states */
74	char *thread_states[] = {	78	char *thread_states[] = {
75	"Invalid",	79	"Invalid",
76	"Running",	80	"Running",
77	"Sleeping",	81	"Sleeping",
78	"Ready",	82	"Ready",
79	"Entering",	83	"Entering",
80	"Exiting",	84	"Exiting",
81	"Lingering"	85	"Lingering"
82	};	86	};
83		87
84	/** Lock protecting the threads_tree AVL tree.	88	/** Lock protecting the threads_tree AVL tree.
85	*	89	*
86	* For locking rules, see declaration thereof.	90	* For locking rules, see declaration thereof.
87	*/	91	*/
88	SPINLOCK_INITIALIZE(threads_lock);	92	SPINLOCK_INITIALIZE(threads_lock);
89		93
90	/** AVL tree of all threads.	94	/** AVL tree of all threads.
91	*	95	*
92	* When a thread is found in the threads_tree AVL tree, it is guaranteed to	96	* When a thread is found in the threads_tree AVL tree, it is guaranteed to
93	* exist as long as the threads_lock is held.	97	* exist as long as the threads_lock is held.
94	*/	98	*/
95	avltree_t threads_tree;	99	avltree_t threads_tree;
96		100
97	SPINLOCK_INITIALIZE(tidlock);	101	SPINLOCK_INITIALIZE(tidlock);
98	thread_id_t last_tid = 0;	102	thread_id_t last_tid = 0;
99		103
100	static slab_cache_t *thread_slab;	104	static slab_cache_t *thread_slab;
101	#ifdef ARCH_HAS_FPU	105	#ifdef ARCH_HAS_FPU
102	slab_cache_t *fpu_context_slab;	106	slab_cache_t *fpu_context_slab;
103	#endif	107	#endif
104		108
105	/** Thread wrapper.	109	/** Thread wrapper.
106	*	110	*
107	* This wrapper is provided to ensure that every thread makes a call to	111	* This wrapper is provided to ensure that every thread makes a call to
108	* thread_exit() when its implementing function returns.	112	* thread_exit() when its implementing function returns.
109	*	113	*
110	* interrupts_disable() is assumed.	114	* interrupts_disable() is assumed.
111	*	115	*
112	*/	116	*/
113	static void cushion(void)	117	static void cushion(void)
114	{	118	{
115	void (f)(void ) = THREAD->thread_code;	119	void (f)(void ) = THREAD->thread_code;
116	void *arg = THREAD->thread_arg;	120	void *arg = THREAD->thread_arg;
117	THREAD->last_cycle = get_cycle();	121	THREAD->last_cycle = get_cycle();
118		122
119	/* This is where each thread wakes up after its creation */	123	/* This is where each thread wakes up after its creation */
120	spinlock_unlock(&THREAD->lock);	124	spinlock_unlock(&THREAD->lock);
121	interrupts_enable();	125	interrupts_enable();
122		126
123	f(arg);	127	f(arg);
124		128
125	/* Accumulate accounting to the task */	129	/* Accumulate accounting to the task */
126	ipl_t ipl = interrupts_disable();	130	ipl_t ipl = interrupts_disable();
127		131
128	spinlock_lock(&THREAD->lock);	132	spinlock_lock(&THREAD->lock);
129	if (!THREAD->uncounted) {	133	if (!THREAD->uncounted) {
130	thread_update_accounting();	134	thread_update_accounting();
131	uint64_t cycles = THREAD->cycles;	135	uint64_t cycles = THREAD->cycles;
132	THREAD->cycles = 0;	136	THREAD->cycles = 0;
133	spinlock_unlock(&THREAD->lock);	137	spinlock_unlock(&THREAD->lock);
134		138
135	spinlock_lock(&TASK->lock);	139	spinlock_lock(&TASK->lock);
136	TASK->cycles += cycles;	140	TASK->cycles += cycles;
137	spinlock_unlock(&TASK->lock);	141	spinlock_unlock(&TASK->lock);
138	} else	142	} else
139	spinlock_unlock(&THREAD->lock);	143	spinlock_unlock(&THREAD->lock);
140		144
141	interrupts_restore(ipl);	145	interrupts_restore(ipl);
142		146
143	thread_exit();	147	thread_exit();
144	/* not reached */	148	/* not reached */
145	}	149	}
146		150
147	/** Initialization and allocation for thread_t structure */	151	/** Initialization and allocation for thread_t structure */
148	static int thr_constructor(void *obj, int kmflags)	152	static int thr_constructor(void *obj, int kmflags)
149	{	153	{
150	thread_t t = (thread_t ) obj;	154	thread_t t = (thread_t ) obj;
151		155
152	spinlock_initialize(&t->lock, "thread_t_lock");	156	spinlock_initialize(&t->lock, "thread_t_lock");
153	link_initialize(&t->rq_link);	157	link_initialize(&t->rq_link);
154	link_initialize(&t->wq_link);	158	link_initialize(&t->wq_link);
155	link_initialize(&t->th_link);	159	link_initialize(&t->th_link);
156		160
157	/* call the architecture-specific part of the constructor */	161	/* call the architecture-specific part of the constructor */
158	thr_constructor_arch(t);	162	thr_constructor_arch(t);
159		163
160	#ifdef ARCH_HAS_FPU	164	#ifdef ARCH_HAS_FPU
161	#ifdef CONFIG_FPU_LAZY	165	#ifdef CONFIG_FPU_LAZY
162	t->saved_fpu_context = NULL;	166	t->saved_fpu_context = NULL;
163	#else	167	#else
164	t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);	168	t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
165	if (!t->saved_fpu_context)	169	if (!t->saved_fpu_context)
166	return -1;	170	return -1;
167	#endif	171	#endif
168	#endif	172	#endif
169		173
170	t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);	174	t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA \| kmflags);
171	if (!t->kstack) {	175	if (!t->kstack) {
172	#ifdef ARCH_HAS_FPU	176	#ifdef ARCH_HAS_FPU
173	if (t->saved_fpu_context)	177	if (t->saved_fpu_context)
174	slab_free(fpu_context_slab, t->saved_fpu_context);	178	slab_free(fpu_context_slab, t->saved_fpu_context);
175	#endif	179	#endif
176	return -1;	180	return -1;
177	}	181	}
178		182
179	mutex_initialize(&t->udebug.lock);	183	mutex_initialize(&t->udebug.lock);
180		184
181	return 0;	185	return 0;
182	}	186	}
183		187
184	/** Destruction of thread_t object */	188	/** Destruction of thread_t object */
185	static int thr_destructor(void *obj)	189	static int thr_destructor(void *obj)
186	{	190	{
187	thread_t t = (thread_t ) obj;	191	thread_t t = (thread_t ) obj;
188		192
189	/* call the architecture-specific part of the destructor */	193	/* call the architecture-specific part of the destructor */
190	thr_destructor_arch(t);	194	thr_destructor_arch(t);
191		195
192	frame_free(KA2PA(t->kstack));	196	frame_free(KA2PA(t->kstack));
193	#ifdef ARCH_HAS_FPU	197	#ifdef ARCH_HAS_FPU
194	if (t->saved_fpu_context)	198	if (t->saved_fpu_context)
195	slab_free(fpu_context_slab, t->saved_fpu_context);	199	slab_free(fpu_context_slab, t->saved_fpu_context);
196	#endif	200	#endif
197	return 1; /* One page freed */	201	return 1; /* One page freed */
198	}	202	}
199		203
200	/** Initialize threads	204	/** Initialize threads
201	*	205	*
202	* Initialize kernel threads support.	206	* Initialize kernel threads support.
203	*	207	*
204	*/	208	*/
205	void thread_init(void)	209	void thread_init(void)
206	{	210	{
207	THREAD = NULL;	211	THREAD = NULL;
208	atomic_set(&nrdy,0);	212	atomic_set(&nrdy,0);
209	thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,	213	thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
210	thr_constructor, thr_destructor, 0);	214	thr_constructor, thr_destructor, 0);
211		215
212	#ifdef ARCH_HAS_FPU	216	#ifdef ARCH_HAS_FPU
213	fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),	217	fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
214	FPU_CONTEXT_ALIGN, NULL, NULL, 0);	218	FPU_CONTEXT_ALIGN, NULL, NULL, 0);
215	#endif	219	#endif
216		220
217	avltree_create(&threads_tree);	221	avltree_create(&threads_tree);
218	}	222	}
219		223
220	/** Make thread ready	224	/** Make thread ready
221	*	225	*
222	* Switch thread t to the ready state.	226	* Switch thread t to the ready state.
223	*	227	*
224	* @param t Thread to make ready.	228	* @param t Thread to make ready.
225	*	229	*
226	*/	230	*/
227	void thread_ready(thread_t *t)	231	void thread_ready(thread_t *t)
228	{	232	{
229	cpu_t *cpu;	233	cpu_t *cpu;
230	runq_t *r;	234	runq_t *r;
231	ipl_t ipl;	235	ipl_t ipl;
232	int i, avg;	236	int i, avg;
233		237
234	ipl = interrupts_disable();	238	ipl = interrupts_disable();
235		239
236	spinlock_lock(&t->lock);	240	spinlock_lock(&t->lock);
237		241
238	ASSERT(!(t->state == Ready));	242	ASSERT(!(t->state == Ready));
239		243
240	i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;	244	i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;
241		245
242	cpu = CPU;	246	cpu = CPU;
243	if (t->flags & THREAD_FLAG_WIRED) {	247	if (t->flags & THREAD_FLAG_WIRED) {
244	ASSERT(t->cpu != NULL);	248	ASSERT(t->cpu != NULL);
245	cpu = t->cpu;	249	cpu = t->cpu;
246	}	250	}
247	t->state = Ready;	251	t->state = Ready;
248	spinlock_unlock(&t->lock);	252	spinlock_unlock(&t->lock);
249		253
250	/*	254	/*
251	* Append t to respective ready queue on respective processor.	255	* Append t to respective ready queue on respective processor.
252	*/	256	*/
253	r = &cpu->rq[i];	257	r = &cpu->rq[i];
254	spinlock_lock(&r->lock);	258	spinlock_lock(&r->lock);
255	list_append(&t->rq_link, &r->rq_head);	259	list_append(&t->rq_link, &r->rq_head);
256	r->n++;	260	r->n++;
257	spinlock_unlock(&r->lock);	261	spinlock_unlock(&r->lock);
258		262
259	atomic_inc(&nrdy);	263	atomic_inc(&nrdy);
260	avg = atomic_get(&nrdy) / config.cpu_active;	264	avg = atomic_get(&nrdy) / config.cpu_active;
261	atomic_inc(&cpu->nrdy);	265	atomic_inc(&cpu->nrdy);
262		266
263	interrupts_restore(ipl);	267	interrupts_restore(ipl);
264	}	268	}
265		269
266	/** Create new thread	270	/** Create new thread
267	*	271	*
268	* Create a new thread.	272	* Create a new thread.
269	*	273	*
270	* @param func Thread's implementing function.	274	* @param func Thread's implementing function.
271	* @param arg Thread's implementing function argument.	275	* @param arg Thread's implementing function argument.
272	* @param task Task to which the thread belongs. The caller must	276	* @param task Task to which the thread belongs. The caller must
273	* guarantee that the task won't cease to exist during the	277	* guarantee that the task won't cease to exist during the
274	* call. The task's lock may not be held.	278	* call. The task's lock may not be held.
275	* @param flags Thread flags.	279	* @param flags Thread flags.
276	* @param name Symbolic name.	280	* @param name Symbolic name.
277	* @param uncounted Thread's accounting doesn't affect accumulated task	281	* @param uncounted Thread's accounting doesn't affect accumulated task
278	* accounting.	282	* accounting.
279	*	283	*
280	* @return New thread's structure on success, NULL on failure.	284	* @return New thread's structure on success, NULL on failure.
281	*	285	*
282	*/	286	*/
283	thread_t thread_create(void ( func)(void ), void arg, task_t *task,	287	thread_t thread_create(void ( func)(void ), void arg, task_t *task,
284	int flags, char *name, bool uncounted)	288	int flags, char *name, bool uncounted)
285	{	289	{
286	thread_t *t;	290	thread_t *t;
287	ipl_t ipl;	291	ipl_t ipl;
288		292
289	t = (thread_t *) slab_alloc(thread_slab, 0);	293	t = (thread_t *) slab_alloc(thread_slab, 0);
290	if (!t)	294	if (!t)
291	return NULL;	295	return NULL;
292		296
293	/* Not needed, but good for debugging */	297	/* Not needed, but good for debugging */
294	memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES,	298	memsetb(t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);
295	0);	-
296		299
297	ipl = interrupts_disable();	300	ipl = interrupts_disable();
298	spinlock_lock(&tidlock);	301	spinlock_lock(&tidlock);
299	t->tid = ++last_tid;	302	t->tid = ++last_tid;
300	spinlock_unlock(&tidlock);	303	spinlock_unlock(&tidlock);
301	interrupts_restore(ipl);	304	interrupts_restore(ipl);
302		305
303	context_save(&t->saved_context);	306	context_save(&t->saved_context);
304	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,	307	context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,
305	THREAD_STACK_SIZE);	308	THREAD_STACK_SIZE);
306		309
307	the_initialize((the_t *) t->kstack);	310	the_initialize((the_t *) t->kstack);
308		311
309	ipl = interrupts_disable();	312	ipl = interrupts_disable();
310	t->saved_context.ipl = interrupts_read();	313	t->saved_context.ipl = interrupts_read();
311	interrupts_restore(ipl);	314	interrupts_restore(ipl);
312		315
313	memcpy(t->name, name, THREAD_NAME_BUFLEN);	316	memcpy(t->name, name, THREAD_NAME_BUFLEN);
314		317
315	t->thread_code = func;	318	t->thread_code = func;
316	t->thread_arg = arg;	319	t->thread_arg = arg;
317	t->ticks = -1;	320	t->ticks = -1;
318	t->cycles = 0;	321	t->cycles = 0;
319	t->uncounted = uncounted;	322	t->uncounted = uncounted;
320	t->priority = -1; /* start in rq[0] */	323	t->priority = -1; /* start in rq[0] */
321	t->cpu = NULL;	324	t->cpu = NULL;
322	t->flags = flags;	325	t->flags = flags;
323	t->state = Entering;	326	t->state = Entering;
324	t->call_me = NULL;	327	t->call_me = NULL;
325	t->call_me_with = NULL;	328	t->call_me_with = NULL;
326		329
327	timeout_initialize(&t->sleep_timeout);	330	timeout_initialize(&t->sleep_timeout);
328	t->sleep_interruptible = false;	331	t->sleep_interruptible = false;
329	t->sleep_queue = NULL;	332	t->sleep_queue = NULL;
330	t->timeout_pending = 0;	333	t->timeout_pending = 0;
331		334
332	t->in_copy_from_uspace = false;	335	t->in_copy_from_uspace = false;
333	t->in_copy_to_uspace = false;	336	t->in_copy_to_uspace = false;
334		337
335	t->interrupted = false;	338	t->interrupted = false;
336	t->detached = false;	339	t->detached = false;
337	waitq_initialize(&t->join_wq);	340	waitq_initialize(&t->join_wq);
338		341
339	t->rwlock_holder_type = RWLOCK_NONE;	342	t->rwlock_holder_type = RWLOCK_NONE;
340		343
341	t->task = task;	344	t->task = task;
342		345
343	t->fpu_context_exists = 0;	346	t->fpu_context_exists = 0;
344	t->fpu_context_engaged = 0;	347	t->fpu_context_engaged = 0;
345		348
346	avltree_node_initialize(&t->threads_tree_node);	349	avltree_node_initialize(&t->threads_tree_node);
347	t->threads_tree_node.key = (uintptr_t) t;	350	t->threads_tree_node.key = (uintptr_t) t;
348		351
349	/* Init debugging stuff */	352	/* Init debugging stuff */
350	udebug_thread_initialize(&t->udebug);	353	udebug_thread_initialize(&t->udebug);
351		354
352	/* might depend on previous initialization */	355	/* might depend on previous initialization */
353	thread_create_arch(t);	356	thread_create_arch(t);
354		357
355	if (!(flags & THREAD_FLAG_NOATTACH))	358	if (!(flags & THREAD_FLAG_NOATTACH))
356	thread_attach(t, task);	359	thread_attach(t, task);
357		360
358	return t;	361	return t;
359	}	362	}
360		363
361	/** Destroy thread memory structure	364	/** Destroy thread memory structure
362	*	365	*
363	* Detach thread from all queues, cpus etc. and destroy it.	366	* Detach thread from all queues, cpus etc. and destroy it.
364	*	367	*
365	* Assume thread->lock is held!!	368	* Assume thread->lock is held!!
366	*/	369	*/
367	void thread_destroy(thread_t *t)	370	void thread_destroy(thread_t *t)
368	{	371	{
369	ASSERT(t->state == Exiting \|\| t->state == Lingering);	372	ASSERT(t->state == Exiting \|\| t->state == Lingering);
370	ASSERT(t->task);	373	ASSERT(t->task);
371	ASSERT(t->cpu);	374	ASSERT(t->cpu);
372		375
373	spinlock_lock(&t->cpu->lock);	376	spinlock_lock(&t->cpu->lock);
374	if (t->cpu->fpu_owner == t)	377	if (t->cpu->fpu_owner == t)
375	t->cpu->fpu_owner = NULL;	378	t->cpu->fpu_owner = NULL;
376	spinlock_unlock(&t->cpu->lock);	379	spinlock_unlock(&t->cpu->lock);
377		380
378	spinlock_unlock(&t->lock);	381	spinlock_unlock(&t->lock);
379		382
380	spinlock_lock(&threads_lock);	383	spinlock_lock(&threads_lock);
381	avltree_delete(&threads_tree, &t->threads_tree_node);	384	avltree_delete(&threads_tree, &t->threads_tree_node);
382	spinlock_unlock(&threads_lock);	385	spinlock_unlock(&threads_lock);
383		386
384	/*	387	/*
385	* Detach from the containing task.	388	* Detach from the containing task.
386	*/	389	*/
387	spinlock_lock(&t->task->lock);	390	spinlock_lock(&t->task->lock);
388	list_remove(&t->th_link);	391	list_remove(&t->th_link);
389	spinlock_unlock(&t->task->lock);	392	spinlock_unlock(&t->task->lock);
390		393
391	/*	394	/*
392	* t is guaranteed to be the very last thread of its task.	395	* t is guaranteed to be the very last thread of its task.
393	* It is safe to destroy the task.	396	* It is safe to destroy the task.
394	*/	397	*/
395	if (atomic_predec(&t->task->refcount) == 0)	398	if (atomic_predec(&t->task->refcount) == 0)
396	task_destroy(t->task);	399	task_destroy(t->task);
397		400
398	slab_free(thread_slab, t);	401	slab_free(thread_slab, t);
399	}	402	}
400		403
401	/** Make the thread visible to the system.	404	/** Make the thread visible to the system.
402	*	405	*
403	* Attach the thread structure to the current task and make it visible in the	406	* Attach the thread structure to the current task and make it visible in the
404	* threads_tree.	407	* threads_tree.
405	*	408	*
406	* @param t Thread to be attached to the task.	409	* @param t Thread to be attached to the task.
407	* @param task Task to which the thread is to be attached.	410	* @param task Task to which the thread is to be attached.
408	*/	411	*/
409	void thread_attach(thread_t t, task_t task)	412	void thread_attach(thread_t t, task_t task)
410	{	413	{
411	ipl_t ipl;	414	ipl_t ipl;
412		415
413	/*	416	/*
414	* Attach to the specified task.	417	* Attach to the specified task.
415	*/	418	*/
416	ipl = interrupts_disable();	419	ipl = interrupts_disable();
417	spinlock_lock(&task->lock);	420	spinlock_lock(&task->lock);
418	atomic_inc(&task->refcount);	421	atomic_inc(&task->refcount);
419	/* Must not count kbox thread into lifecount */	422	/* Must not count kbox thread into lifecount */
420	if (t->flags & THREAD_FLAG_USPACE)	423	if (t->flags & THREAD_FLAG_USPACE)
421	atomic_inc(&task->lifecount);	424	atomic_inc(&task->lifecount);
422	list_append(&t->th_link, &task->th_head);	425	list_append(&t->th_link, &task->th_head);
423	spinlock_unlock(&task->lock);	426	spinlock_unlock(&task->lock);
424		427
425	/*	428	/*
426	* Register this thread in the system-wide list.	429	* Register this thread in the system-wide list.
427	*/	430	*/
428	spinlock_lock(&threads_lock);	431	spinlock_lock(&threads_lock);
429	avltree_insert(&threads_tree, &t->threads_tree_node);	432	avltree_insert(&threads_tree, &t->threads_tree_node);
430	spinlock_unlock(&threads_lock);	433	spinlock_unlock(&threads_lock);
431		434
432	interrupts_restore(ipl);	435	interrupts_restore(ipl);
433	}	436	}
434		437
435	/** Terminate thread.	438	/** Terminate thread.
436	*	439	*
437	* End current thread execution and switch it to the exiting state. All pending	440	* End current thread execution and switch it to the exiting state. All pending
438	* timeouts are executed.	441	* timeouts are executed.
439	*/	442	*/
440	void thread_exit(void)	443	void thread_exit(void)
441	{	444	{
442	ipl_t ipl;	445	ipl_t ipl;
443		446
444	if (THREAD->flags & THREAD_FLAG_USPACE) {	447	if (THREAD->flags & THREAD_FLAG_USPACE) {
445	/* Generate udebug THREAD_E event */	448	/* Generate udebug THREAD_E event */
446	udebug_thread_e_event();	449	udebug_thread_e_event();
447		450
448	if (atomic_predec(&TASK->lifecount) == 0) {	451	if (atomic_predec(&TASK->lifecount) == 0) {
449	/*	452	/*
450	* We are the last userspace thread in the task that	453	* We are the last userspace thread in the task that
451	* still has not exited. With the exception of the	454	* still has not exited. With the exception of the
452	* moment the task was created, new userspace threads	455	* moment the task was created, new userspace threads
453	* can only be created by threads of the same task.	456	* can only be created by threads of the same task.
454	* We are safe to perform cleanup.	457	* We are safe to perform cleanup.
455	*/	458	*/
456	ipc_cleanup();	459	ipc_cleanup();
457	futex_cleanup();	460	futex_cleanup();
458	klog_printf("Cleanup of task %llu completed.",	461	LOG("Cleanup of task %" PRIu64" completed.", TASK->taskid);
459	TASK->taskid);	-
460	}	462	}
461	}	463	}
462		464
463	restart:	465	restart:
464	ipl = interrupts_disable();	466	ipl = interrupts_disable();
465	spinlock_lock(&THREAD->lock);	467	spinlock_lock(&THREAD->lock);
466	if (THREAD->timeout_pending) {	468	if (THREAD->timeout_pending) {
467	/* busy waiting for timeouts in progress */	469	/* busy waiting for timeouts in progress */
468	spinlock_unlock(&THREAD->lock);	470	spinlock_unlock(&THREAD->lock);
469	interrupts_restore(ipl);	471	interrupts_restore(ipl);
470	goto restart;	472	goto restart;
471	}	473	}
472		474
473	THREAD->state = Exiting;	475	THREAD->state = Exiting;
474	spinlock_unlock(&THREAD->lock);	476	spinlock_unlock(&THREAD->lock);
475	scheduler();	477	scheduler();
476		478
477	/* Not reached */	479	/* Not reached */
478	while (1)	480	while (1)
479	;	481	;
480	}	482	}
481		483
482		484
483	/** Thread sleep	485	/** Thread sleep
484	*	486	*
485	* Suspend execution of the current thread.	487	* Suspend execution of the current thread.
486	*	488	*
487	* @param sec Number of seconds to sleep.	489	* @param sec Number of seconds to sleep.
488	*	490	*
489	*/	491	*/
490	void thread_sleep(uint32_t sec)	492	void thread_sleep(uint32_t sec)
491	{	493	{
492	thread_usleep(sec * 1000000);	494	thread_usleep(sec * 1000000);
493	}	495	}
494		496
495	/** Wait for another thread to exit.	497	/** Wait for another thread to exit.
496	*	498	*

Subversion Repositories HelenOS

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