Rev 1573 | Rev 1580 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1573 | Rev 1579 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** |
29 | /** |
30 | * @file task.c |
30 | * @file task.c |
31 | * @brief Task management. |
31 | * @brief Task management. |
32 | */ |
32 | */ |
33 | 33 | ||
34 | #include <main/uinit.h> |
34 | #include <main/uinit.h> |
35 | #include <proc/thread.h> |
35 | #include <proc/thread.h> |
36 | #include <proc/task.h> |
36 | #include <proc/task.h> |
37 | #include <proc/uarg.h> |
37 | #include <proc/uarg.h> |
38 | #include <mm/as.h> |
38 | #include <mm/as.h> |
39 | #include <mm/slab.h> |
39 | #include <mm/slab.h> |
40 | #include <synch/spinlock.h> |
40 | #include <synch/spinlock.h> |
41 | #include <arch.h> |
41 | #include <arch.h> |
42 | #include <panic.h> |
42 | #include <panic.h> |
43 | #include <adt/btree.h> |
43 | #include <adt/btree.h> |
44 | #include <adt/list.h> |
44 | #include <adt/list.h> |
45 | #include <ipc/ipc.h> |
45 | #include <ipc/ipc.h> |
46 | #include <security/cap.h> |
46 | #include <security/cap.h> |
47 | #include <memstr.h> |
47 | #include <memstr.h> |
48 | #include <print.h> |
48 | #include <print.h> |
49 | #include <elf.h> |
49 | #include <elf.h> |
- | 50 | #include <errno.h> |
|
50 | #include <syscall/copy.h> |
51 | #include <syscall/copy.h> |
51 | 52 | ||
52 | #ifndef LOADED_PROG_STACK_PAGES_NO |
53 | #ifndef LOADED_PROG_STACK_PAGES_NO |
53 | #define LOADED_PROG_STACK_PAGES_NO 1 |
54 | #define LOADED_PROG_STACK_PAGES_NO 1 |
54 | #endif |
55 | #endif |
55 | 56 | ||
56 | SPINLOCK_INITIALIZE(tasks_lock); |
57 | SPINLOCK_INITIALIZE(tasks_lock); |
57 | btree_t tasks_btree; |
58 | btree_t tasks_btree; |
58 | static task_id_t task_counter = 0; |
59 | static task_id_t task_counter = 0; |
59 | 60 | ||
- | 61 | static void ktask_cleanup(void *); |
|
- | 62 | ||
60 | /** Initialize tasks |
63 | /** Initialize tasks |
61 | * |
64 | * |
62 | * Initialize kernel tasks support. |
65 | * Initialize kernel tasks support. |
63 | * |
66 | * |
64 | */ |
67 | */ |
65 | void task_init(void) |
68 | void task_init(void) |
66 | { |
69 | { |
67 | TASK = NULL; |
70 | TASK = NULL; |
68 | btree_create(&tasks_btree); |
71 | btree_create(&tasks_btree); |
69 | } |
72 | } |
70 | 73 | ||
71 | 74 | ||
72 | /** Create new task |
75 | /** Create new task |
73 | * |
76 | * |
74 | * Create new task with no threads. |
77 | * Create new task with no threads. |
75 | * |
78 | * |
76 | * @param as Task's address space. |
79 | * @param as Task's address space. |
77 | * @param name Symbolic name. |
80 | * @param name Symbolic name. |
78 | * |
81 | * |
79 | * @return New task's structure |
82 | * @return New task's structure |
80 | * |
83 | * |
81 | */ |
84 | */ |
82 | task_t *task_create(as_t *as, char *name) |
85 | task_t *task_create(as_t *as, char *name) |
83 | { |
86 | { |
84 | ipl_t ipl; |
87 | ipl_t ipl; |
85 | task_t *ta; |
88 | task_t *ta; |
86 | int i; |
89 | int i; |
87 | 90 | ||
88 | ta = (task_t *) malloc(sizeof(task_t), 0); |
91 | ta = (task_t *) malloc(sizeof(task_t), 0); |
89 | 92 | ||
90 | task_create_arch(ta); |
93 | task_create_arch(ta); |
91 | 94 | ||
92 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
95 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
93 | list_initialize(&ta->th_head); |
96 | list_initialize(&ta->th_head); |
94 | ta->as = as; |
97 | ta->as = as; |
95 | ta->name = name; |
98 | ta->name = name; |
96 | 99 | ||
- | 100 | ta->refcount = 0; |
|
- | 101 | ||
97 | ta->capabilities = 0; |
102 | ta->capabilities = 0; |
- | 103 | ta->accept_new_threads = true; |
|
98 | 104 | ||
99 | ipc_answerbox_init(&ta->answerbox); |
105 | ipc_answerbox_init(&ta->answerbox); |
100 | for (i=0; i < IPC_MAX_PHONES;i++) |
106 | for (i=0; i < IPC_MAX_PHONES;i++) |
101 | ipc_phone_init(&ta->phones[i]); |
107 | ipc_phone_init(&ta->phones[i]); |
102 | if (ipc_phone_0) |
108 | if (ipc_phone_0) |
103 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
109 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
104 | atomic_set(&ta->active_calls, 0); |
110 | atomic_set(&ta->active_calls, 0); |
105 | 111 | ||
106 | mutex_initialize(&ta->futexes_lock); |
112 | mutex_initialize(&ta->futexes_lock); |
107 | btree_create(&ta->futexes); |
113 | btree_create(&ta->futexes); |
108 | 114 | ||
109 | ipl = interrupts_disable(); |
115 | ipl = interrupts_disable(); |
110 | 116 | ||
111 | /* |
117 | /* |
112 | * Increment address space reference count. |
118 | * Increment address space reference count. |
113 | * TODO: Reconsider the locking scheme. |
119 | * TODO: Reconsider the locking scheme. |
114 | */ |
120 | */ |
115 | mutex_lock(&as->lock); |
121 | mutex_lock(&as->lock); |
116 | as->refcount++; |
122 | as->refcount++; |
117 | mutex_unlock(&as->lock); |
123 | mutex_unlock(&as->lock); |
118 | 124 | ||
119 | spinlock_lock(&tasks_lock); |
125 | spinlock_lock(&tasks_lock); |
120 | 126 | ||
121 | ta->taskid = ++task_counter; |
127 | ta->taskid = ++task_counter; |
122 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
128 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
123 | 129 | ||
124 | spinlock_unlock(&tasks_lock); |
130 | spinlock_unlock(&tasks_lock); |
125 | interrupts_restore(ipl); |
131 | interrupts_restore(ipl); |
126 | 132 | ||
127 | return ta; |
133 | return ta; |
128 | } |
134 | } |
129 | 135 | ||
- | 136 | /** Destroy task. |
|
- | 137 | * |
|
- | 138 | * @param t Task to be destroyed. |
|
- | 139 | */ |
|
- | 140 | void task_destroy(task_t *t) |
|
- | 141 | { |
|
- | 142 | } |
|
- | 143 | ||
130 | /** Create new task with 1 thread and run it |
144 | /** Create new task with 1 thread and run it |
131 | * |
145 | * |
132 | * @param program_addr Address of program executable image. |
146 | * @param program_addr Address of program executable image. |
133 | * @param name Program name. |
147 | * @param name Program name. |
134 | * |
148 | * |
135 | * @return Task of the running program or NULL on error. |
149 | * @return Task of the running program or NULL on error. |
136 | */ |
150 | */ |
137 | task_t * task_run_program(void *program_addr, char *name) |
151 | task_t * task_run_program(void *program_addr, char *name) |
138 | { |
152 | { |
139 | as_t *as; |
153 | as_t *as; |
140 | as_area_t *a; |
154 | as_area_t *a; |
141 | int rc; |
155 | int rc; |
142 | thread_t *t; |
156 | thread_t *t; |
143 | task_t *task; |
157 | task_t *task; |
144 | uspace_arg_t *kernel_uarg; |
158 | uspace_arg_t *kernel_uarg; |
145 | 159 | ||
146 | as = as_create(0); |
160 | as = as_create(0); |
147 | ASSERT(as); |
161 | ASSERT(as); |
148 | 162 | ||
149 | rc = elf_load((elf_header_t *) program_addr, as); |
163 | rc = elf_load((elf_header_t *) program_addr, as); |
150 | if (rc != EE_OK) { |
164 | if (rc != EE_OK) { |
151 | as_destroy(as); |
165 | as_destroy(as); |
152 | return NULL; |
166 | return NULL; |
153 | } |
167 | } |
154 | 168 | ||
155 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
169 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
156 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
170 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
157 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
171 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
158 | kernel_uarg->uspace_thread_function = NULL; |
172 | kernel_uarg->uspace_thread_function = NULL; |
159 | kernel_uarg->uspace_thread_arg = NULL; |
173 | kernel_uarg->uspace_thread_arg = NULL; |
160 | kernel_uarg->uspace_uarg = NULL; |
174 | kernel_uarg->uspace_uarg = NULL; |
161 | 175 | ||
162 | task = task_create(as, name); |
176 | task = task_create(as, name); |
163 | ASSERT(task); |
177 | ASSERT(task); |
164 | 178 | ||
165 | /* |
179 | /* |
166 | * Create the data as_area. |
180 | * Create the data as_area. |
167 | */ |
181 | */ |
168 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
182 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
169 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
183 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
170 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
184 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
171 | 185 | ||
172 | t = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
186 | t = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
173 | ASSERT(t); |
187 | ASSERT(t); |
174 | thread_ready(t); |
188 | thread_ready(t); |
175 | 189 | ||
176 | return task; |
190 | return task; |
177 | } |
191 | } |
178 | 192 | ||
179 | /** Syscall for reading task ID from userspace. |
193 | /** Syscall for reading task ID from userspace. |
180 | * |
194 | * |
181 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
195 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
182 | * |
196 | * |
183 | * @return 0 on success or an error code from @ref errno.h. |
197 | * @return 0 on success or an error code from @ref errno.h. |
184 | */ |
198 | */ |
185 | __native sys_task_get_id(task_id_t *uspace_task_id) |
199 | __native sys_task_get_id(task_id_t *uspace_task_id) |
186 | { |
200 | { |
187 | /* |
201 | /* |
188 | * No need to acquire lock on TASK because taskid |
202 | * No need to acquire lock on TASK because taskid |
189 | * remains constant for the lifespan of the task. |
203 | * remains constant for the lifespan of the task. |
190 | */ |
204 | */ |
191 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
205 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
192 | } |
206 | } |
193 | 207 | ||
194 | /** Find task structure corresponding to task ID. |
208 | /** Find task structure corresponding to task ID. |
195 | * |
209 | * |
196 | * The tasks_lock must be already held by the caller of this function |
210 | * The tasks_lock must be already held by the caller of this function |
197 | * and interrupts must be disabled. |
211 | * and interrupts must be disabled. |
198 | * |
212 | * |
199 | * @param id Task ID. |
213 | * @param id Task ID. |
200 | * |
214 | * |
201 | * @return Task structure address or NULL if there is no such task ID. |
215 | * @return Task structure address or NULL if there is no such task ID. |
202 | */ |
216 | */ |
203 | task_t *task_find_by_id(task_id_t id) |
217 | task_t *task_find_by_id(task_id_t id) |
204 | { |
218 | { |
205 | btree_node_t *leaf; |
219 | btree_node_t *leaf; |
206 | 220 | ||
207 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
221 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
208 | } |
222 | } |
209 | 223 | ||
- | 224 | /** Kill task. |
|
- | 225 | * |
|
- | 226 | * @param id ID of the task to be killed. |
|
- | 227 | * |
|
- | 228 | * @return 0 on success or an error code from errno.h |
|
- | 229 | */ |
|
- | 230 | int task_kill(task_id_t id) |
|
- | 231 | { |
|
- | 232 | ipl_t ipl; |
|
- | 233 | task_t *ta; |
|
- | 234 | thread_t *t; |
|
- | 235 | link_t *cur; |
|
- | 236 | ||
- | 237 | ipl = interrupts_disable(); |
|
- | 238 | spinlock_lock(&tasks_lock); |
|
- | 239 | ||
- | 240 | if (!(ta = task_find_by_id(id))) { |
|
- | 241 | spinlock_unlock(&tasks_lock); |
|
- | 242 | interrupts_restore(ipl); |
|
- | 243 | return ENOENT; |
|
- | 244 | } |
|
- | 245 | ||
- | 246 | spinlock_lock(&ta->lock); |
|
- | 247 | ta->refcount++; |
|
- | 248 | spinlock_unlock(&ta->lock); |
|
- | 249 | ||
- | 250 | t = thread_create(ktask_cleanup, NULL, ta, 0, "ktask_cleanup"); |
|
- | 251 | ||
- | 252 | spinlock_lock(&ta->lock); |
|
- | 253 | ta->refcount--; |
|
- | 254 | ||
- | 255 | for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) { |
|
- | 256 | thread_t *thr; |
|
- | 257 | bool sleeping = false; |
|
- | 258 | ||
- | 259 | thr = list_get_instance(cur, thread_t, th_link); |
|
- | 260 | if (thr == t) |
|
- | 261 | continue; |
|
- | 262 | ||
- | 263 | spinlock_lock(&thr->lock); |
|
- | 264 | thr->interrupted = true; |
|
- | 265 | if (thr->state == Sleeping) |
|
- | 266 | sleeping = true; |
|
- | 267 | spinlock_unlock(&thr->lock); |
|
- | 268 | ||
- | 269 | if (sleeping) |
|
- | 270 | waitq_interrupt_sleep(thr); |
|
- | 271 | } |
|
- | 272 | ||
- | 273 | thread_ready(t); |
|
- | 274 | ||
- | 275 | return 0; |
|
- | 276 | } |
|
- | 277 | ||
210 | /** Print task list */ |
278 | /** Print task list */ |
211 | void task_print_list(void) |
279 | void task_print_list(void) |
212 | { |
280 | { |
213 | link_t *cur; |
281 | link_t *cur; |
214 | ipl_t ipl; |
282 | ipl_t ipl; |
215 | 283 | ||
216 | /* Messing with thread structures, avoid deadlock */ |
284 | /* Messing with thread structures, avoid deadlock */ |
217 | ipl = interrupts_disable(); |
285 | ipl = interrupts_disable(); |
218 | spinlock_lock(&tasks_lock); |
286 | spinlock_lock(&tasks_lock); |
219 | 287 | ||
220 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
288 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
221 | btree_node_t *node; |
289 | btree_node_t *node; |
222 | int i; |
290 | int i; |
223 | 291 | ||
224 | node = list_get_instance(cur, btree_node_t, leaf_link); |
292 | node = list_get_instance(cur, btree_node_t, leaf_link); |
225 | for (i = 0; i < node->keys; i++) { |
293 | for (i = 0; i < node->keys; i++) { |
226 | task_t *t; |
294 | task_t *t; |
227 | int j; |
295 | int j; |
228 | 296 | ||
229 | t = (task_t *) node->value[i]; |
297 | t = (task_t *) node->value[i]; |
230 | 298 | ||
231 | spinlock_lock(&t->lock); |
299 | spinlock_lock(&t->lock); |
232 | printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd", |
300 | printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd", |
233 | t->name, t->taskid, t, t->as, atomic_get(&t->active_calls)); |
301 | t->name, t->taskid, t, t->as, atomic_get(&t->active_calls)); |
234 | for (j=0; j < IPC_MAX_PHONES; j++) { |
302 | for (j=0; j < IPC_MAX_PHONES; j++) { |
235 | if (t->phones[j].callee) |
303 | if (t->phones[j].callee) |
236 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
304 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
237 | } |
305 | } |
238 | printf("\n"); |
306 | printf("\n"); |
239 | spinlock_unlock(&t->lock); |
307 | spinlock_unlock(&t->lock); |
240 | } |
308 | } |
241 | } |
309 | } |
242 | 310 | ||
243 | spinlock_unlock(&tasks_lock); |
311 | spinlock_unlock(&tasks_lock); |
244 | interrupts_restore(ipl); |
312 | interrupts_restore(ipl); |
245 | } |
313 | } |
- | 314 | ||
- | 315 | /** Kernel thread used to cleanup the task. */ |
|
- | 316 | void ktask_cleanup(void *arg) |
|
- | 317 | { |
|
- | 318 | /* |
|
- | 319 | * TODO: |
|
- | 320 | * Wait until it is save to cleanup the task (i.e. all other threads exit) |
|
- | 321 | * and do the cleanup (e.g. close IPC communication and release used futexes). |
|
- | 322 | * When this thread exits, the task refcount drops to zero and the task structure is |
|
- | 323 | * cleaned. |
|
- | 324 | */ |
|
- | 325 | } |
|
246 | 326 |