Subversion Repositories HelenOS-historic

Rev

Rev 1409 | Rev 1468 | 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. /**
  30.  * @file    task.c
  31.  * @brief   Task management.
  32.  */
  33.  
  34. #include <main/uinit.h>
  35. #include <proc/thread.h>
  36. #include <proc/task.h>
  37. #include <proc/uarg.h>
  38. #include <mm/as.h>
  39. #include <mm/slab.h>
  40. #include <synch/spinlock.h>
  41. #include <arch.h>
  42. #include <panic.h>
  43. #include <adt/btree.h>
  44. #include <adt/list.h>
  45. #include <ipc/ipc.h>
  46. #include <security/cap.h>
  47. #include <memstr.h>
  48. #include <print.h>
  49. #include <elf.h>
  50. #include <syscall/copy.h>
  51.  
  52. #ifndef LOADED_PROG_STACK_PAGES_NO
  53. #define LOADED_PROG_STACK_PAGES_NO 1
  54. #endif
  55.  
  56. SPINLOCK_INITIALIZE(tasks_lock);
  57. btree_t tasks_btree;
  58. static task_id_t task_counter = 0;
  59.  
  60. /** Initialize tasks
  61.  *
  62.  * Initialize kernel tasks support.
  63.  *
  64.  */
  65. void task_init(void)
  66. {
  67.     TASK = NULL;
  68.     btree_create(&tasks_btree);
  69. }
  70.  
  71.  
  72. /** Create new task
  73.  *
  74.  * Create new task with no threads.
  75.  *
  76.  * @param as Task's address space.
  77.  * @param name Symbolic name.
  78.  *
  79.  * @return New task's structure
  80.  *
  81.  */
  82. task_t *task_create(as_t *as, char *name)
  83. {
  84.     ipl_t ipl;
  85.     task_t *ta;
  86.     int i;
  87.    
  88.     ta = (task_t *) malloc(sizeof(task_t), 0);
  89.  
  90.     task_create_arch(ta);
  91.  
  92.     spinlock_initialize(&ta->lock, "task_ta_lock");
  93.     list_initialize(&ta->th_head);
  94.     ta->as = as;
  95.     ta->name = name;
  96.  
  97.     ta->capabilities = 0;
  98.    
  99.     ipc_answerbox_init(&ta->answerbox);
  100.     for (i=0; i < IPC_MAX_PHONES;i++)
  101.         ipc_phone_init(&ta->phones[i]);
  102.     if (ipc_phone_0)
  103.         ipc_phone_connect(&ta->phones[0], ipc_phone_0);
  104.     atomic_set(&ta->active_calls, 0);
  105.    
  106.     ipl = interrupts_disable();
  107.     spinlock_lock(&tasks_lock);
  108.  
  109.     ta->taskid = ++task_counter;
  110.     btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
  111.  
  112.     spinlock_unlock(&tasks_lock);
  113.     interrupts_restore(ipl);
  114.  
  115.     return ta;
  116. }
  117.  
  118. /** Create new task with 1 thread and run it
  119.  *
  120.  * @param program_addr Address of program executable image.
  121.  * @param name Program name.
  122.  *
  123.  * @return Task of the running program or NULL on error.
  124.  */
  125. task_t * task_run_program(void *program_addr, char *name)
  126. {
  127.     as_t *as;
  128.     as_area_t *a;
  129.     int rc;
  130.     thread_t *t;
  131.     task_t *task;
  132.     uspace_arg_t *kernel_uarg;
  133.  
  134.     as = as_create(0);
  135.     ASSERT(as);
  136.  
  137.     rc = elf_load((elf_header_t *) program_addr, as);
  138.     if (rc != EE_OK) {
  139.         as_free(as);
  140.         return NULL;
  141.     }
  142.    
  143.     kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
  144.     kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
  145.     kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
  146.     kernel_uarg->uspace_thread_function = NULL;
  147.     kernel_uarg->uspace_thread_arg = NULL;
  148.     kernel_uarg->uspace_uarg = NULL;
  149.    
  150.     task = task_create(as, name);
  151.     ASSERT(task);
  152.  
  153.     /*
  154.      * Create the data as_area.
  155.      */
  156.     a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
  157.         LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
  158.         USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
  159.  
  160.     t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
  161.     ASSERT(t);
  162.     thread_ready(t);
  163.    
  164.     return task;
  165. }
  166.  
  167. /** Syscall for reading task ID from userspace.
  168.  *
  169.  * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
  170.  *
  171.  * @return 0 on success or an error code from @ref errno.h.
  172.  */
  173. __native sys_task_get_id(task_id_t *uspace_task_id)
  174. {
  175.     /*
  176.      * No need to acquire lock on TASK because taskid
  177.      * remains constant for the lifespan of the task.
  178.      */
  179.     return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
  180. }
  181.  
  182. /** Find task structure corresponding to task ID.
  183.  *
  184.  * The tasks_lock must be already held by the caller of this function
  185.  * and interrupts must be disabled.
  186.  *
  187.  * @param id Task ID.
  188.  *
  189.  * @return Task structure address or NULL if there is no such task ID.
  190.  */
  191. task_t *task_find_by_id(task_id_t id)
  192. {
  193.     btree_node_t *leaf;
  194.    
  195.     return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
  196. }
  197.  
  198. /** Print task list */
  199. void task_print_list(void)
  200. {
  201.     link_t *cur;
  202.     ipl_t ipl;
  203.    
  204.     /* Messing with thread structures, avoid deadlock */
  205.     ipl = interrupts_disable();
  206.     spinlock_lock(&tasks_lock);
  207.  
  208.     for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
  209.         btree_node_t *node;
  210.         int i;
  211.        
  212.         node = list_get_instance(cur, btree_node_t, leaf_link);
  213.         for (i = 0; i < node->keys; i++) {
  214.             task_t *t;
  215.             int j;
  216.  
  217.             t = (task_t *) node->value[i];
  218.        
  219.             spinlock_lock(&t->lock);
  220.             printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
  221.                 t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
  222.             for (j=0; j < IPC_MAX_PHONES; j++) {
  223.                 if (t->phones[j].callee)
  224.                     printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
  225.             }
  226.             printf("\n");
  227.             spinlock_unlock(&t->lock);
  228.         }
  229.     }
  230.  
  231.     spinlock_unlock(&tasks_lock);
  232.     interrupts_restore(ipl);
  233. }
  234.