Subversion Repositories HelenOS-historic

Rev

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