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