Subversion Repositories HelenOS-historic

Rev

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