Subversion Repositories HelenOS-historic

Rev

Rev 1170 | Rev 1176 | 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.     spinlock_initialize(&ta->lock, "task_ta_lock");
  86.     list_initialize(&ta->th_head);
  87.     ta->as = as;
  88.     ta->name = name;
  89.  
  90.     ta->capabilities = 0;
  91.    
  92.     ipc_answerbox_init(&ta->answerbox);
  93.     for (i=0; i < IPC_MAX_PHONES;i++)
  94.         ipc_phone_init(&ta->phones[i]);
  95.     if (ipc_phone_0)
  96.         ipc_phone_connect(&ta->phones[0], ipc_phone_0);
  97.     atomic_set(&ta->active_calls, 0);
  98.    
  99.     ipl = interrupts_disable();
  100.     spinlock_lock(&tasks_lock);
  101.  
  102.     ta->taskid = ++task_counter;
  103.     btree_insert(&tasks_btree, (__native) ta, (void *) ta, NULL);
  104.  
  105.     spinlock_unlock(&tasks_lock);
  106.     interrupts_restore(ipl);
  107.  
  108.     return ta;
  109. }
  110.  
  111. /** Create new task with 1 thread and run it
  112.  *
  113.  * @param programe_addr Address of program executable image.
  114.  * @param name Program name.
  115.  *
  116.  * @return Task of the running program or NULL on error
  117.  */
  118. task_t * task_run_program(void *program_addr, char *name)
  119. {
  120.     as_t *as;
  121.     as_area_t *a;
  122.     int rc;
  123.     thread_t *t;
  124.     task_t *task;
  125.     uspace_arg_t *kernel_uarg;
  126.  
  127.     as = as_create(0);
  128.     ASSERT(as);
  129.  
  130.     rc = elf_load((elf_header_t *) program_addr, as);
  131.     if (rc != EE_OK) {
  132.         as_free(as);
  133.         return NULL;
  134.     }
  135.    
  136.     kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
  137.     kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
  138.     kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
  139.     kernel_uarg->uspace_thread_function = NULL;
  140.     kernel_uarg->uspace_thread_arg = NULL;
  141.     kernel_uarg->uspace_uarg = NULL;
  142.    
  143.     task = task_create(as, name);
  144.     ASSERT(task);
  145.  
  146.     /*
  147.      * Create the data as_area.
  148.      */
  149.     a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, USTACK_ADDRESS);
  150.  
  151.     t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
  152.     ASSERT(t);
  153.     thread_ready(t);
  154.    
  155.     return task;
  156. }
  157.  
  158. /** Print task list */
  159. void task_print_list(void)
  160. {
  161.     link_t *cur;
  162.     ipl_t ipl;
  163.    
  164.     /* Messing with thread structures, avoid deadlock */
  165.     ipl = interrupts_disable();
  166.     spinlock_lock(&tasks_lock);
  167.  
  168.     for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
  169.         btree_node_t *node;
  170.         int i;
  171.        
  172.         node = list_get_instance(cur, btree_node_t, leaf_link);
  173.         for (i = 0; i < node->keys; i++) {
  174.             task_t *t;
  175.             int j;
  176.  
  177.             t = (task_t *) node->value[i];
  178.        
  179.             spinlock_lock(&t->lock);
  180.             printf("%s: address=%P, taskid=%Q, as=%P, ActiveCalls: %d",
  181.                 t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
  182.             for (j=0; j < IPC_MAX_PHONES; j++) {
  183.                 if (t->phones[j].callee)
  184.                     printf(" Ph(%d): %P ", j, t->phones[j].callee);
  185.             }
  186.             printf("\n");
  187.             spinlock_unlock(&t->lock);
  188.         }
  189.     }
  190.  
  191.     spinlock_unlock(&tasks_lock);
  192.     interrupts_restore(ipl);
  193.    
  194. }
  195.