Subversion Repositories HelenOS

Rev

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