Subversion Repositories HelenOS-historic

Rev

Rev 1168 | 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 <memstr.h>
  42. #include <print.h>
  43. #include <elf.h>
  44.  
  45.  
  46. #ifndef LOADED_PROG_STACK_PAGES_NO
  47. #define LOADED_PROG_STACK_PAGES_NO 1
  48. #endif
  49.  
  50. SPINLOCK_INITIALIZE(tasks_lock);
  51. btree_t tasks_btree;
  52. static task_id_t task_counter = 0;
  53.  
  54. /** Initialize tasks
  55.  *
  56.  * Initialize kernel tasks support.
  57.  *
  58.  */
  59. void task_init(void)
  60. {
  61.     TASK = NULL;
  62.     btree_create(&tasks_btree);
  63. }
  64.  
  65.  
  66. /** Create new task
  67.  *
  68.  * Create new task with no threads.
  69.  *
  70.  * @param as Task's address space.
  71.  * @param name Symbolic name.
  72.  *
  73.  * @return New task's structure
  74.  *
  75.  */
  76. task_t *task_create(as_t *as, char *name)
  77. {
  78.     ipl_t ipl;
  79.     task_t *ta;
  80.     int i;
  81.    
  82.     ta = (task_t *) malloc(sizeof(task_t), 0);
  83.  
  84.     spinlock_initialize(&ta->lock, "task_ta_lock");
  85.     list_initialize(&ta->th_head);
  86.     ta->as = as;
  87.     ta->name = name;
  88.  
  89.    
  90.     ipc_answerbox_init(&ta->answerbox);
  91.     for (i=0; i < IPC_MAX_PHONES;i++)
  92.         ipc_phone_init(&ta->phones[i]);
  93.     if (ipc_phone_0)
  94.         ipc_phone_connect(&ta->phones[0], ipc_phone_0);
  95.     atomic_set(&ta->active_calls, 0);
  96.    
  97.     ipl = interrupts_disable();
  98.     spinlock_lock(&tasks_lock);
  99.  
  100.     ta->taskid = ++task_counter;
  101.     btree_insert(&tasks_btree, (__native) ta, (void *) ta, NULL);
  102.  
  103.     spinlock_unlock(&tasks_lock);
  104.     interrupts_restore(ipl);
  105.  
  106.     return ta;
  107. }
  108.  
  109. /** Create new task with 1 thread and run it
  110.  *
  111.  * @param programe_addr Address of program executable image.
  112.  * @param name Program name.
  113.  *
  114.  * @return Task of the running program or NULL on error
  115.  */
  116. task_t * task_run_program(void *program_addr, char *name)
  117. {
  118.     as_t *as;
  119.     as_area_t *a;
  120.     int rc;
  121.     thread_t *t;
  122.     task_t *task;
  123.     uspace_arg_t *kernel_uarg;
  124.  
  125.     as = as_create(0);
  126.     ASSERT(as);
  127.  
  128.     rc = elf_load((elf_header_t *) program_addr, as);
  129.     if (rc != EE_OK) {
  130.         as_free(as);
  131.         return NULL;
  132.     }
  133.    
  134.     kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
  135.     kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
  136.     kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
  137.     kernel_uarg->uspace_thread_function = NULL;
  138.     kernel_uarg->uspace_thread_arg = NULL;
  139.     kernel_uarg->uspace_uarg = NULL;
  140.    
  141.     task = task_create(as, name);
  142.     ASSERT(task);
  143.  
  144.     /*
  145.      * Create the data as_area.
  146.      */
  147.     a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, USTACK_ADDRESS);
  148.  
  149.     t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
  150.     ASSERT(t);
  151.     thread_ready(t);
  152.    
  153.     return task;
  154. }
  155.  
  156. /** Print task list */
  157. void task_print_list(void)
  158. {
  159.     link_t *cur;
  160.     ipl_t ipl;
  161.    
  162.     /* Messing with thread structures, avoid deadlock */
  163.     ipl = interrupts_disable();
  164.     spinlock_lock(&tasks_lock);
  165.  
  166.     for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
  167.         btree_node_t *node;
  168.         int i;
  169.        
  170.         node = list_get_instance(cur, btree_node_t, leaf_link);
  171.         for (i = 0; i < node->keys; i++) {
  172.             task_t *t;
  173.             int j;
  174.  
  175.             t = (task_t *) node->value[i];
  176.        
  177.             spinlock_lock(&t->lock);
  178.             printf("%s: address=%P, taskid=%Q, as=%P, ActiveCalls: %d",
  179.                 t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
  180.             for (j=0; j < IPC_MAX_PHONES; j++) {
  181.                 if (t->phones[j].callee)
  182.                     printf(" Ph(%d): %P ", j, t->phones[j].callee);
  183.             }
  184.             printf("\n");
  185.             spinlock_unlock(&t->lock);
  186.         }
  187.     }
  188.  
  189.     spinlock_unlock(&tasks_lock);
  190.     interrupts_restore(ipl);
  191.    
  192. }
  193.