Subversion Repositories HelenOS

Rev

Rev 2867 | Rev 2903 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2001-2004 Jakub Jermar
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  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
  15.  *   derived from this software without specific prior written permission.
  16.  *
  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
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  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
  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
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. /** @addtogroup genericproc
  30.  * @{
  31.  */
  32.  
  33. /**
  34.  * @file
  35.  * @brief   Thread management functions.
  36.  */
  37.  
  38. #include <proc/scheduler.h>
  39. #include <proc/thread.h>
  40. #include <proc/task.h>
  41. #include <proc/uarg.h>
  42. #include <mm/frame.h>
  43. #include <mm/page.h>
  44. #include <arch/asm.h>
  45. #include <arch/cycle.h>
  46. #include <arch.h>
  47. #include <synch/synch.h>
  48. #include <synch/spinlock.h>
  49. #include <synch/waitq.h>
  50. #include <synch/rwlock.h>
  51. #include <cpu.h>
  52. #include <func.h>
  53. #include <context.h>
  54. #include <adt/avl.h>
  55. #include <adt/list.h>
  56. #include <time/clock.h>
  57. #include <time/timeout.h>
  58. #include <config.h>
  59. #include <arch/interrupt.h>
  60. #include <smp/ipi.h>
  61. #include <arch/faddr.h>
  62. #include <atomic.h>
  63. #include <memstr.h>
  64. #include <print.h>
  65. #include <mm/slab.h>
  66. #include <debug.h>
  67. #include <main/uinit.h>
  68. #include <syscall/copy.h>
  69. #include <errno.h>
  70. #include <console/klog.h>
  71.  
  72.  
  73. /** Thread states */
  74. char *thread_states[] = {
  75.     "Invalid",
  76.     "Running",
  77.     "Sleeping",
  78.     "Ready",
  79.     "Entering",
  80.     "Exiting",
  81.     "Lingering"
  82. };
  83.  
  84. /** Lock protecting the threads_tree AVL tree.
  85.  *
  86.  * For locking rules, see declaration thereof.
  87.  */
  88. SPINLOCK_INITIALIZE(threads_lock);
  89.  
  90. /** ALV tree of all threads.
  91.  *
  92.  * 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.
  94.  */
  95. avltree_t threads_tree;    
  96.  
  97. SPINLOCK_INITIALIZE(tidlock);
  98. thread_id_t last_tid = 0;
  99.  
  100. static slab_cache_t *thread_slab;
  101. #ifdef ARCH_HAS_FPU
  102. slab_cache_t *fpu_context_slab;
  103. #endif
  104.  
  105. /** Thread wrapper.
  106.  *
  107.  * This wrapper is provided to ensure that every thread makes a call to
  108.  * thread_exit() when its implementing function returns.
  109.  *
  110.  * interrupts_disable() is assumed.
  111.  *
  112.  */
  113. static void cushion(void)
  114. {
  115.     void (*f)(void *) = THREAD->thread_code;
  116.     void *arg = THREAD->thread_arg;
  117.     THREAD->last_cycle = get_cycle();
  118.  
  119.     /* This is where each thread wakes up after its creation */
  120.     spinlock_unlock(&THREAD->lock);
  121.     interrupts_enable();
  122.  
  123.     f(arg);
  124.    
  125.     /* Accumulate accounting to the task */
  126.     ipl_t ipl = interrupts_disable();
  127.    
  128.     spinlock_lock(&THREAD->lock);
  129.     if (!THREAD->uncounted) {
  130.         thread_update_accounting();
  131.         uint64_t cycles = THREAD->cycles;
  132.         THREAD->cycles = 0;
  133.         spinlock_unlock(&THREAD->lock);
  134.        
  135.         spinlock_lock(&TASK->lock);
  136.         TASK->cycles += cycles;
  137.         spinlock_unlock(&TASK->lock);
  138.     } else
  139.         spinlock_unlock(&THREAD->lock);
  140.    
  141.     interrupts_restore(ipl);
  142.    
  143.     thread_exit();
  144.     /* not reached */
  145. }
  146.  
  147. /** Initialization and allocation for thread_t structure */
  148. static int thr_constructor(void *obj, int kmflags)
  149. {
  150.     thread_t *t = (thread_t *) obj;
  151.  
  152.     spinlock_initialize(&t->lock, "thread_t_lock");
  153.     link_initialize(&t->rq_link);
  154.     link_initialize(&t->wq_link);
  155.     link_initialize(&t->th_link);
  156.  
  157.     /* call the architecture-specific part of the constructor */
  158.     thr_constructor_arch(t);
  159.    
  160. #ifdef ARCH_HAS_FPU
  161. #ifdef CONFIG_FPU_LAZY
  162.     t->saved_fpu_context = NULL;
  163. #else
  164.     t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
  165.     if (!t->saved_fpu_context)
  166.         return -1;
  167. #endif
  168. #endif 
  169.  
  170.     t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags);
  171.     if (!t->kstack) {
  172. #ifdef ARCH_HAS_FPU
  173.         if (t->saved_fpu_context)
  174.             slab_free(fpu_context_slab, t->saved_fpu_context);
  175. #endif
  176.         return -1;
  177.     }
  178.  
  179.     spinlock_initialize(&t->debug_lock, "thread_debug_lock");
  180.  
  181.     return 0;
  182. }
  183.  
  184. /** Destruction of thread_t object */
  185. static int thr_destructor(void *obj)
  186. {
  187.     thread_t *t = (thread_t *) obj;
  188.  
  189.     /* call the architecture-specific part of the destructor */
  190.     thr_destructor_arch(t);
  191.  
  192.     frame_free(KA2PA(t->kstack));
  193. #ifdef ARCH_HAS_FPU
  194.     if (t->saved_fpu_context)
  195.         slab_free(fpu_context_slab, t->saved_fpu_context);
  196. #endif
  197.     return 1; /* One page freed */
  198. }
  199.  
  200. /** Initialize threads
  201.  *
  202.  * Initialize kernel threads support.
  203.  *
  204.  */
  205. void thread_init(void)
  206. {
  207.     THREAD = NULL;
  208.     atomic_set(&nrdy,0);
  209.     thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
  210.         thr_constructor, thr_destructor, 0);
  211.  
  212. #ifdef ARCH_HAS_FPU
  213.     fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
  214.         FPU_CONTEXT_ALIGN, NULL, NULL, 0);
  215. #endif
  216.  
  217.     avltree_create(&threads_tree);
  218. }
  219.  
  220. /** Make thread ready
  221.  *
  222.  * Switch thread t to the ready state.
  223.  *
  224.  * @param t Thread to make ready.
  225.  *
  226.  */
  227. void thread_ready(thread_t *t)
  228. {
  229.     cpu_t *cpu;
  230.     runq_t *r;
  231.     ipl_t ipl;
  232.     int i, avg;
  233.  
  234.     ipl = interrupts_disable();
  235.  
  236.     spinlock_lock(&t->lock);
  237.  
  238.     ASSERT(!(t->state == Ready));
  239.  
  240.     i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority;
  241.    
  242.     cpu = CPU;
  243.     if (t->flags & THREAD_FLAG_WIRED) {
  244.         ASSERT(t->cpu != NULL);
  245.         cpu = t->cpu;
  246.     }
  247.     t->state = Ready;
  248.     spinlock_unlock(&t->lock);
  249.    
  250.     /*
  251.      * Append t to respective ready queue on respective processor.
  252.      */
  253.     r = &cpu->rq[i];
  254.     spinlock_lock(&r->lock);
  255.     list_append(&t->rq_link, &r->rq_head);
  256.     r->n++;
  257.     spinlock_unlock(&r->lock);
  258.  
  259.     atomic_inc(&nrdy);
  260.     avg = atomic_get(&nrdy) / config.cpu_active;
  261.     atomic_inc(&cpu->nrdy);
  262.  
  263.     interrupts_restore(ipl);
  264. }
  265.  
  266. /** Create new thread
  267.  *
  268.  * Create a new thread.
  269.  *
  270.  * @param func      Thread's implementing function.
  271.  * @param arg       Thread's implementing function argument.
  272.  * @param task      Task to which the thread belongs.
  273.  * @param flags     Thread flags.
  274.  * @param name      Symbolic name.
  275.  * @param uncounted Thread's accounting doesn't affect accumulated task
  276.  *          accounting.
  277.  *
  278.  * @return New thread's structure on success, NULL on failure.
  279.  *
  280.  */
  281. thread_t *thread_create(void (* func)(void *), void *arg, task_t *task,
  282.     int flags, char *name, bool uncounted)
  283. {
  284.     thread_t *t;
  285.     ipl_t ipl;
  286.    
  287.     t = (thread_t *) slab_alloc(thread_slab, 0);
  288.     if (!t)
  289.         return NULL;
  290.    
  291.     /* Not needed, but good for debugging */
  292.     memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES,
  293.         0);
  294.    
  295.     ipl = interrupts_disable();
  296.     spinlock_lock(&tidlock);
  297.     t->tid = ++last_tid;
  298.     spinlock_unlock(&tidlock);
  299.     interrupts_restore(ipl);
  300.    
  301.     context_save(&t->saved_context);
  302.     context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack,
  303.         THREAD_STACK_SIZE);
  304.    
  305.     the_initialize((the_t *) t->kstack);
  306.    
  307.     ipl = interrupts_disable();
  308.     t->saved_context.ipl = interrupts_read();
  309.     interrupts_restore(ipl);
  310.    
  311.     memcpy(t->name, name, THREAD_NAME_BUFLEN);
  312.    
  313.     t->thread_code = func;
  314.     t->thread_arg = arg;
  315.     t->ticks = -1;
  316.     t->cycles = 0;
  317.     t->uncounted = uncounted;
  318.     t->priority = -1;       /* start in rq[0] */
  319.     t->cpu = NULL;
  320.     t->flags = flags;
  321.     t->state = Entering;
  322.     t->call_me = NULL;
  323.     t->call_me_with = NULL;
  324.    
  325.     timeout_initialize(&t->sleep_timeout);
  326.     t->sleep_interruptible = false;
  327.     t->sleep_queue = NULL;
  328.     t->timeout_pending = 0;
  329.  
  330.     t->in_copy_from_uspace = false;
  331.     t->in_copy_to_uspace = false;
  332.  
  333.     t->interrupted = false;
  334.     t->detached = false;
  335.     waitq_initialize(&t->join_wq);
  336.    
  337.     t->rwlock_holder_type = RWLOCK_NONE;
  338.        
  339.     t->task = task;
  340.    
  341.     t->fpu_context_exists = 0;
  342.     t->fpu_context_engaged = 0;
  343.  
  344.     avltree_node_initialize(&t->threads_tree_node);
  345.     t->threads_tree_node.key = (uintptr_t) t;
  346.    
  347.     /* Init debugging stuff */
  348.     waitq_initialize(&t->go_wq);
  349.     t->debug_go_call = NULL;
  350.     t->uspace_state = NULL;
  351.     t->debug_stop = true;
  352.     t->debug_stoppable = true;
  353.     t->debug_active = false;
  354.     t->cur_event = 0;   /* none */
  355.  
  356.     /* might depend on previous initialization */
  357.     thread_create_arch(t); 
  358.  
  359.     if (!(flags & THREAD_FLAG_NOATTACH))
  360.         thread_attach(t, task);
  361.  
  362.     return t;
  363. }
  364.  
  365. /** Destroy thread structure of an unattached thread.
  366.  *
  367.  * Thread t must only have been created and never attached.
  368.  */
  369. void thread_unattached_free(thread_t *t)
  370. {
  371.     slab_free(thread_slab, t);
  372. }
  373.  
  374.  
  375. /** Destroy thread memory structure
  376.  *
  377.  * Detach thread from all queues, cpus etc. and destroy it.
  378.  *
  379.  * Assume thread->lock is held!!
  380.  */
  381. void thread_destroy(thread_t *t)
  382. {
  383.     ASSERT(t->state == Exiting || t->state == Lingering);
  384.     ASSERT(t->task);
  385.     ASSERT(t->cpu);
  386.  
  387.     spinlock_lock(&t->cpu->lock);
  388.     if (t->cpu->fpu_owner == t)
  389.         t->cpu->fpu_owner = NULL;
  390.     spinlock_unlock(&t->cpu->lock);
  391.  
  392.     spinlock_unlock(&t->lock);
  393.  
  394.     spinlock_lock(&threads_lock);
  395.     avltree_delete(&threads_tree, &t->threads_tree_node);
  396.     spinlock_unlock(&threads_lock);
  397.  
  398.     /*
  399.      * Detach from the containing task.
  400.      */
  401.     spinlock_lock(&t->task->lock);
  402.     list_remove(&t->th_link);
  403.     spinlock_unlock(&t->task->lock);   
  404.  
  405.     /*
  406.      * t is guaranteed to be the very last thread of its task.
  407.      * It is safe to destroy the task.
  408.      */
  409.     if (atomic_predec(&t->task->refcount) == 0)
  410.         task_destroy(t->task);
  411.    
  412.     slab_free(thread_slab, t);
  413. }
  414.  
  415. /** Attach thread to the given task.
  416.  *
  417.  * The task's lock must already be held and interrupts must be disabled.
  418.  *
  419.  * @param t Thread to be attached to the task.
  420.  * @param task  Task to which the thread is to be attached.
  421.  */
  422. static void _thread_attach_task(thread_t *t, task_t *task)
  423. {
  424.     atomic_inc(&task->refcount);
  425.     atomic_inc(&task->lifecount);
  426.  
  427.     list_append(&t->th_link, &task->th_head);
  428.  
  429.     /*
  430.      * Copy task debugging state to thread struct.
  431.      * The thread needs to know it is being debugged,
  432.      * otherwise it would neither stop nor respond to
  433.      * debug ops.
  434.      */
  435.     if (t->flags & THREAD_FLAG_USPACE) {
  436.         if (task->dt_state == UDEBUG_TS_BEGINNING ||
  437.             task->dt_state == UDEBUG_TS_ACTIVE) {
  438.             t->debug_active = true;
  439.         }
  440.     }
  441. }
  442.  
  443. /** Add thread to the threads tree.
  444.  *
  445.  * Interrupts must be already disabled.
  446.  *
  447.  * @param t Thread to be attached to the task.
  448.  * @param task  Task to which the thread is to be attached.
  449.  */
  450. static void _thread_attach_tree(thread_t *t)
  451. {
  452.     /*
  453.      * Register this thread in the system-wide list.
  454.      */
  455.     spinlock_lock(&threads_lock);
  456.     avltree_insert(&threads_tree, &t->threads_tree_node);
  457.     spinlock_unlock(&threads_lock);
  458. }
  459.  
  460.  
  461. /** Make the thread visible to the system.
  462.  *
  463.  * Attach the thread structure to the current task and make it visible in the
  464.  * threads_tree.
  465.  *
  466.  * @param t Thread to be attached to the task.
  467.  * @param task  Task to which the thread is to be attached.
  468.  */
  469. void thread_attach(thread_t *t, task_t *task)
  470. {
  471.     ipl_t ipl;
  472.  
  473.     ipl = interrupts_disable();
  474.  
  475.     /*
  476.      * Attach to the current task.
  477.      */
  478.     spinlock_lock(&task->lock);
  479.     _thread_attach_task(t, task);
  480.     spinlock_unlock(&task->lock);
  481.  
  482.     /*
  483.      * Register this thread in the system-wide list.
  484.      */
  485.     _thread_attach_tree(t);
  486.    
  487.     interrupts_restore(ipl);
  488. }
  489.  
  490. /** Attach thread to a task given by its ID.
  491.  *
  492.  * Unlike thread_attach(), this function allows to attach a thread
  493.  * to an arbitrary task.
  494.  *
  495.  * @param t     Thread to be attached to the task.
  496.  * @param taskid    Task id to which the thread is to be attached.
  497.  * @return      An error code from errno.h
  498.  */
  499. int thread_attach_by_id(thread_t *t, task_id_t taskid)
  500. {
  501.     ipl_t ipl;
  502.     task_t *task;
  503.  
  504.     ipl = interrupts_disable();
  505.  
  506.     spinlock_lock(&tasks_lock);
  507.     task = task_find_by_id(taskid);
  508.     if (task == NULL) {
  509.         spinlock_unlock(&tasks_lock);
  510.         interrupts_restore(ipl);
  511.         return ENOENT;
  512.     }
  513.  
  514.     spinlock_lock(&task->lock);
  515.     spinlock_unlock(&tasks_lock);
  516.  
  517.     /*
  518.      * Attach to the current task.
  519.      */
  520.     _thread_attach_task(t, task);
  521.  
  522.     spinlock_unlock(&task->lock);
  523.  
  524.     /*
  525.      * Register this thread in the system-wide list.
  526.      */
  527.     _thread_attach_tree(t);
  528.    
  529.     interrupts_restore(ipl);
  530.  
  531.     return EOK;
  532. }
  533.  
  534.  
  535. /** Terminate thread.
  536.  *
  537.  * End current thread execution and switch it to the exiting state. All pending
  538.  * timeouts are executed.
  539.  */
  540. void thread_exit(void)
  541. {
  542.     ipl_t ipl;
  543.  
  544.     if (atomic_predec(&TASK->lifecount) == 0) {
  545.         /*
  546.          * We are the last thread in the task that still has not exited.
  547.          * With the exception of the moment the task was created, new
  548.          * threads can only be created by threads of the same task.
  549.          * We are safe to perform cleanup.
  550.          */
  551.         if (THREAD->flags & THREAD_FLAG_USPACE) {
  552.             ipc_cleanup();
  553.                 futex_cleanup();
  554.             klog_printf("Cleanup of task %llu completed.",
  555.                 TASK->taskid);
  556.         }
  557.     }
  558.  
  559. restart:
  560.     ipl = interrupts_disable();
  561.     spinlock_lock(&THREAD->lock);
  562.     if (THREAD->timeout_pending) {
  563.         /* busy waiting for timeouts in progress */
  564.         spinlock_unlock(&THREAD->lock);
  565.         interrupts_restore(ipl);
  566.         goto restart;
  567.     }
  568.    
  569.     THREAD->state = Exiting;
  570.     spinlock_unlock(&THREAD->lock);
  571.     scheduler();
  572.  
  573.     /* Not reached */
  574.     while (1)
  575.         ;
  576. }
  577.  
  578.  
  579. /** Thread sleep
  580.  *
  581.  * Suspend execution of the current thread.
  582.  *
  583.  * @param sec Number of seconds to sleep.
  584.  *
  585.  */
  586. void thread_sleep(uint32_t sec)
  587. {
  588.     thread_usleep(sec * 1000000);
  589. }
  590.  
  591. /** Wait for another thread to exit.
  592.  *
  593.  * @param t Thread to join on exit.
  594.  * @param usec Timeout in microseconds.
  595.  * @param flags Mode of operation.
  596.  *
  597.  * @return An error code from errno.h or an error code from synch.h.
  598.  */
  599. int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
  600. {
  601.     ipl_t ipl;
  602.     int rc;
  603.  
  604.     if (t == THREAD)
  605.         return EINVAL;
  606.  
  607.     /*
  608.      * Since thread join can only be called once on an undetached thread,
  609.      * the thread pointer is guaranteed to be still valid.
  610.      */
  611.    
  612.     ipl = interrupts_disable();
  613.     spinlock_lock(&t->lock);
  614.     ASSERT(!t->detached);
  615.     spinlock_unlock(&t->lock);
  616.     interrupts_restore(ipl);
  617.    
  618.     rc = waitq_sleep_timeout(&t->join_wq, usec, flags);
  619.    
  620.     return rc; 
  621. }
  622.  
  623. /** Detach thread.
  624.  *
  625.  * Mark the thread as detached, if the thread is already in the Lingering
  626.  * state, deallocate its resources.
  627.  *
  628.  * @param t Thread to be detached.
  629.  */
  630. void thread_detach(thread_t *t)
  631. {
  632.     ipl_t ipl;
  633.  
  634.     /*
  635.      * Since the thread is expected not to be already detached,
  636.      * pointer to it must be still valid.
  637.      */
  638.     ipl = interrupts_disable();
  639.     spinlock_lock(&t->lock);
  640.     ASSERT(!t->detached);
  641.     if (t->state == Lingering) {
  642.         thread_destroy(t);  /* unlocks &t->lock */
  643.         interrupts_restore(ipl);
  644.         return;
  645.     } else {
  646.         t->detached = true;
  647.     }
  648.     spinlock_unlock(&t->lock);
  649.     interrupts_restore(ipl);
  650. }
  651.  
  652. /** Thread usleep
  653.  *
  654.  * Suspend execution of the current thread.
  655.  *
  656.  * @param usec Number of microseconds to sleep.
  657.  *
  658.  */
  659. void thread_usleep(uint32_t usec)
  660. {
  661.     waitq_t wq;
  662.                  
  663.     waitq_initialize(&wq);
  664.  
  665.     (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
  666. }
  667.  
  668. /** Register thread out-of-context invocation
  669.  *
  670.  * Register a function and its argument to be executed
  671.  * on next context switch to the current thread.
  672.  *
  673.  * @param call_me      Out-of-context function.
  674.  * @param call_me_with Out-of-context function argument.
  675.  *
  676.  */
  677. void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
  678. {
  679.     ipl_t ipl;
  680.    
  681.     ipl = interrupts_disable();
  682.     spinlock_lock(&THREAD->lock);
  683.     THREAD->call_me = call_me;
  684.     THREAD->call_me_with = call_me_with;
  685.     spinlock_unlock(&THREAD->lock);
  686.     interrupts_restore(ipl);
  687. }
  688.  
  689. static bool thread_walker(avltree_node_t *node, void *arg)
  690. {
  691.     thread_t *t;
  692.        
  693.     t = avltree_get_instance(node, thread_t, threads_tree_node);
  694.  
  695.     uint64_t cycles;
  696.     char suffix;
  697.     order(t->cycles, &cycles, &suffix);
  698.    
  699.     if (sizeof(void *) == 4)
  700.         printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ",
  701.             t->tid, t->name, t, thread_states[t->state], t->task,
  702.             t->task->context, t->thread_code, t->kstack, cycles, suffix);
  703.     else
  704.         printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ",
  705.             t->tid, t->name, t, thread_states[t->state], t->task,
  706.             t->task->context, t->thread_code, t->kstack, cycles, suffix);
  707.            
  708.     if (t->cpu)
  709.         printf("%-4zd", t->cpu->id);
  710.     else
  711.         printf("none");
  712.            
  713.     if (t->state == Sleeping) {
  714.         if (sizeof(uintptr_t) == 4)
  715.             printf(" %#10zx", t->sleep_queue);
  716.         else
  717.             printf(" %#18zx", t->sleep_queue);
  718.     }
  719.            
  720.     printf("\n");
  721.  
  722.     return true;
  723. }
  724.  
  725. /** Print list of threads debug info */
  726. void thread_print_list(void)
  727. {
  728.     ipl_t ipl;
  729.    
  730.     /* Messing with thread structures, avoid deadlock */
  731.     ipl = interrupts_disable();
  732.     spinlock_lock(&threads_lock);
  733.    
  734.     if (sizeof(uintptr_t) == 4) {
  735.         printf("tid    name       address    state    task       "
  736.             "ctx code       stack      cycles     cpu  "
  737.             "waitqueue\n");
  738.         printf("------ ---------- ---------- -------- ---------- "
  739.             "--- ---------- ---------- ---------- ---- "
  740.             "----------\n");
  741.     } else {
  742.         printf("tid    name       address            state    task               "
  743.             "ctx code               stack              cycles     cpu  "
  744.             "waitqueue\n");
  745.         printf("------ ---------- ------------------ -------- ------------------ "
  746.             "--- ------------------ ------------------ ---------- ---- "
  747.             "------------------\n");
  748.     }
  749.  
  750.     avltree_walk(&threads_tree, thread_walker, NULL);
  751.  
  752.     spinlock_unlock(&threads_lock);
  753.     interrupts_restore(ipl);
  754. }
  755.  
  756. /** Check whether thread exists.
  757.  *
  758.  * Note that threads_lock must be already held and
  759.  * interrupts must be already disabled.
  760.  *
  761.  * @param t Pointer to thread.
  762.  *
  763.  * @return True if thread t is known to the system, false otherwise.
  764.  */
  765. bool thread_exists(thread_t *t)
  766. {
  767.     avltree_node_t *node;
  768.  
  769.     node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t));
  770.    
  771.     return node != NULL;
  772. }
  773.  
  774.  
  775. /** Update accounting of current thread.
  776.  *
  777.  * Note that thread_lock on THREAD must be already held and
  778.  * interrupts must be already disabled.
  779.  *
  780.  */
  781. void thread_update_accounting(void)
  782. {
  783.     uint64_t time = get_cycle();
  784.     THREAD->cycles += time - THREAD->last_cycle;
  785.     THREAD->last_cycle = time;
  786. }
  787.  
  788. /** Process syscall to create new thread.
  789.  *
  790.  */
  791. unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
  792.     thread_id_t *uspace_thread_id)
  793. {
  794.     thread_t *t;
  795.     char namebuf[THREAD_NAME_BUFLEN];
  796.     uspace_arg_t *kernel_uarg;
  797.     int rc;
  798.  
  799.     rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN);
  800.     if (rc != 0)
  801.         return (unative_t) rc;
  802.  
  803.     /*
  804.      * In case of failure, kernel_uarg will be deallocated in this function.
  805.      * In case of success, kernel_uarg will be freed in uinit().
  806.      */
  807.     kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
  808.    
  809.     rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
  810.     if (rc != 0) {
  811.         free(kernel_uarg);
  812.         return (unative_t) rc;
  813.     }
  814.  
  815.     t = thread_create(uinit, kernel_uarg, TASK,
  816.         THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
  817.     if (t) {
  818.         if (uspace_thread_id != NULL) {
  819.             int rc;
  820.  
  821.             rc = copy_to_uspace(uspace_thread_id, &t->tid,
  822.                 sizeof(t->tid));
  823.             if (rc != 0) {
  824.                 /*
  825.                  * We have encountered a failure, but the thread
  826.                  * has already been created. We need to undo its
  827.                  * creation now.
  828.                  */
  829.  
  830.                 /*
  831.                  * The new thread structure is initialized, but
  832.                  * is still not visible to the system.
  833.                  * We can safely deallocate it.
  834.                  */
  835.                 slab_free(thread_slab, t);
  836.                 free(kernel_uarg);
  837.  
  838.                 return (unative_t) rc;
  839.              }
  840.         }
  841.         thread_attach(t, TASK);
  842.         thread_ready(t);
  843.  
  844.         udebug_new_thread_event(t);
  845.  
  846.         return 0;
  847.     } else
  848.         free(kernel_uarg);
  849.  
  850.     return (unative_t) ENOMEM;
  851. }
  852.  
  853. /** Process syscall to terminate thread.
  854.  *
  855.  */
  856. unative_t sys_thread_exit(int uspace_status)
  857. {
  858.     thread_exit();
  859.     /* Unreachable */
  860.     return 0;
  861. }
  862.  
  863. /** Syscall for getting TID.
  864.  *
  865.  * @param uspace_thread_id Userspace address of 8-byte buffer where to store
  866.  * current thread ID.
  867.  *
  868.  * @return 0 on success or an error code from @ref errno.h.
  869.  */
  870. unative_t sys_thread_get_id(thread_id_t *uspace_thread_id)
  871. {
  872.     /*
  873.      * No need to acquire lock on THREAD because tid
  874.      * remains constant for the lifespan of the thread.
  875.      */
  876.     return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
  877.         sizeof(THREAD->tid));
  878. }
  879.  
  880. /** @}
  881.  */
  882.