Subversion Repositories HelenOS

Rev

Rev 1040 | Rev 1060 | 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 <mm/as.h>
  33. #include <mm/slab.h>
  34.  
  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.  
  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.  *
  65.  * @return New task's structure
  66.  *
  67.  */
  68. task_t *task_create(as_t *as)
  69. {
  70.     ipl_t ipl;
  71.     task_t *ta;
  72.     int i;
  73.    
  74.     ta = (task_t *) malloc(sizeof(task_t), 0);
  75.  
  76.     spinlock_initialize(&ta->lock, "task_ta_lock");
  77.     list_initialize(&ta->th_head);
  78.     list_initialize(&ta->tasks_link);
  79.     ta->as = as;
  80.  
  81.    
  82.     ipc_answerbox_init(&ta->answerbox);
  83.     for (i=0; i < IPC_MAX_PHONES;i++)
  84.         ipc_phone_init(&ta->phones[i]);
  85.     if (ipc_phone_0)
  86.         ipc_phone_connect(&ta->phones[0], ipc_phone_0);
  87.     atomic_set(&ta->active_calls, 0);
  88.    
  89.     ipl = interrupts_disable();
  90.     spinlock_lock(&tasks_lock);
  91.  
  92.     ta->taskid = ++task_counter;
  93.     list_append(&ta->tasks_link, &tasks_head);
  94.  
  95.     spinlock_unlock(&tasks_lock);
  96.     interrupts_restore(ipl);
  97.  
  98.     return ta;
  99. }
  100.  
  101. /** Create new task with 1 thread and run it
  102.  *
  103.  * @return Task of the running program or NULL on error
  104.  */
  105. task_t * task_run_program(void *program_addr)
  106. {
  107.     as_t *as;
  108.     as_area_t *a;
  109.     int rc;
  110.     thread_t *t;
  111.     task_t *task;
  112.  
  113.     as = as_create(0);
  114.  
  115.     rc = elf_load((elf_header_t *) program_addr, as);
  116.     if (rc != EE_OK) {
  117.         as_free(as);
  118.         return NULL;
  119.     }
  120.    
  121.     task = task_create(as);
  122.     t = thread_create(uinit, (void *)((elf_header_t *)program_addr)->e_entry,
  123.               task, THREAD_USER_STACK);
  124.    
  125.     /*
  126.      * Create the data as_area.
  127.      */
  128.     a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);
  129.    
  130.     thread_ready(t);
  131.  
  132.     return task;
  133. }
  134.