Subversion Repositories HelenOS

Rev

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