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