Subversion Repositories HelenOS

Rev

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