Rev 1460 | Rev 1573 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1460 | Rev 1468 | ||
---|---|---|---|
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 <syscall/copy.h> |
50 | #include <syscall/copy.h> |
51 | 51 | ||
52 | #ifndef LOADED_PROG_STACK_PAGES_NO |
52 | #ifndef LOADED_PROG_STACK_PAGES_NO |
53 | #define LOADED_PROG_STACK_PAGES_NO 1 |
53 | #define LOADED_PROG_STACK_PAGES_NO 1 |
54 | #endif |
54 | #endif |
55 | 55 | ||
56 | SPINLOCK_INITIALIZE(tasks_lock); |
56 | SPINLOCK_INITIALIZE(tasks_lock); |
57 | btree_t tasks_btree; |
57 | btree_t tasks_btree; |
58 | static task_id_t task_counter = 0; |
58 | static task_id_t task_counter = 0; |
59 | 59 | ||
60 | /** Initialize tasks |
60 | /** Initialize tasks |
61 | * |
61 | * |
62 | * Initialize kernel tasks support. |
62 | * Initialize kernel tasks support. |
63 | * |
63 | * |
64 | */ |
64 | */ |
65 | void task_init(void) |
65 | void task_init(void) |
66 | { |
66 | { |
67 | TASK = NULL; |
67 | TASK = NULL; |
68 | btree_create(&tasks_btree); |
68 | btree_create(&tasks_btree); |
69 | } |
69 | } |
70 | 70 | ||
71 | 71 | ||
72 | /** Create new task |
72 | /** Create new task |
73 | * |
73 | * |
74 | * Create new task with no threads. |
74 | * Create new task with no threads. |
75 | * |
75 | * |
76 | * @param as Task's address space. |
76 | * @param as Task's address space. |
77 | * @param name Symbolic name. |
77 | * @param name Symbolic name. |
78 | * |
78 | * |
79 | * @return New task's structure |
79 | * @return New task's structure |
80 | * |
80 | * |
81 | */ |
81 | */ |
82 | task_t *task_create(as_t *as, char *name) |
82 | task_t *task_create(as_t *as, char *name) |
83 | { |
83 | { |
84 | ipl_t ipl; |
84 | ipl_t ipl; |
85 | task_t *ta; |
85 | task_t *ta; |
86 | int i; |
86 | int i; |
87 | 87 | ||
88 | ta = (task_t *) malloc(sizeof(task_t), 0); |
88 | ta = (task_t *) malloc(sizeof(task_t), 0); |
89 | 89 | ||
90 | task_create_arch(ta); |
90 | task_create_arch(ta); |
91 | 91 | ||
92 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
92 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
93 | list_initialize(&ta->th_head); |
93 | list_initialize(&ta->th_head); |
94 | ta->as = as; |
94 | ta->as = as; |
95 | ta->name = name; |
95 | ta->name = name; |
96 | 96 | ||
97 | ta->capabilities = 0; |
97 | ta->capabilities = 0; |
98 | 98 | ||
99 | ipc_answerbox_init(&ta->answerbox); |
99 | ipc_answerbox_init(&ta->answerbox); |
100 | for (i=0; i < IPC_MAX_PHONES;i++) |
100 | for (i=0; i < IPC_MAX_PHONES;i++) |
101 | ipc_phone_init(&ta->phones[i]); |
101 | ipc_phone_init(&ta->phones[i]); |
102 | if (ipc_phone_0) |
102 | if (ipc_phone_0) |
103 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
103 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
104 | atomic_set(&ta->active_calls, 0); |
104 | atomic_set(&ta->active_calls, 0); |
105 | 105 | ||
106 | mutex_initialize(&ta->futexes_lock); |
106 | mutex_initialize(&ta->futexes_lock); |
107 | btree_create(&ta->futexes); |
107 | btree_create(&ta->futexes); |
108 | 108 | ||
109 | ipl = interrupts_disable(); |
109 | ipl = interrupts_disable(); |
- | 110 | ||
- | 111 | /* |
|
- | 112 | * Increment address space reference count. |
|
- | 113 | * TODO: Reconsider the locking scheme. |
|
- | 114 | */ |
|
- | 115 | mutex_lock(&as->lock); |
|
- | 116 | as->refcount++; |
|
- | 117 | mutex_unlock(&as->lock); |
|
- | 118 | ||
110 | spinlock_lock(&tasks_lock); |
119 | spinlock_lock(&tasks_lock); |
111 | 120 | ||
112 | ta->taskid = ++task_counter; |
121 | ta->taskid = ++task_counter; |
113 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
122 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
114 | 123 | ||
115 | spinlock_unlock(&tasks_lock); |
124 | spinlock_unlock(&tasks_lock); |
116 | interrupts_restore(ipl); |
125 | interrupts_restore(ipl); |
117 | 126 | ||
118 | return ta; |
127 | return ta; |
119 | } |
128 | } |
120 | 129 | ||
121 | /** Create new task with 1 thread and run it |
130 | /** Create new task with 1 thread and run it |
122 | * |
131 | * |
123 | * @param program_addr Address of program executable image. |
132 | * @param program_addr Address of program executable image. |
124 | * @param name Program name. |
133 | * @param name Program name. |
125 | * |
134 | * |
126 | * @return Task of the running program or NULL on error. |
135 | * @return Task of the running program or NULL on error. |
127 | */ |
136 | */ |
128 | task_t * task_run_program(void *program_addr, char *name) |
137 | task_t * task_run_program(void *program_addr, char *name) |
129 | { |
138 | { |
130 | as_t *as; |
139 | as_t *as; |
131 | as_area_t *a; |
140 | as_area_t *a; |
132 | int rc; |
141 | int rc; |
133 | thread_t *t; |
142 | thread_t *t; |
134 | task_t *task; |
143 | task_t *task; |
135 | uspace_arg_t *kernel_uarg; |
144 | uspace_arg_t *kernel_uarg; |
136 | 145 | ||
137 | as = as_create(0); |
146 | as = as_create(0); |
138 | ASSERT(as); |
147 | ASSERT(as); |
139 | 148 | ||
140 | rc = elf_load((elf_header_t *) program_addr, as); |
149 | rc = elf_load((elf_header_t *) program_addr, as); |
141 | if (rc != EE_OK) { |
150 | if (rc != EE_OK) { |
142 | as_free(as); |
151 | as_destroy(as); |
143 | return NULL; |
152 | return NULL; |
144 | } |
153 | } |
145 | 154 | ||
146 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
155 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
147 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
156 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
148 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
157 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
149 | kernel_uarg->uspace_thread_function = NULL; |
158 | kernel_uarg->uspace_thread_function = NULL; |
150 | kernel_uarg->uspace_thread_arg = NULL; |
159 | kernel_uarg->uspace_thread_arg = NULL; |
151 | kernel_uarg->uspace_uarg = NULL; |
160 | kernel_uarg->uspace_uarg = NULL; |
152 | 161 | ||
153 | task = task_create(as, name); |
162 | task = task_create(as, name); |
154 | ASSERT(task); |
163 | ASSERT(task); |
155 | 164 | ||
156 | /* |
165 | /* |
157 | * Create the data as_area. |
166 | * Create the data as_area. |
158 | */ |
167 | */ |
159 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
168 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
160 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
169 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
161 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
170 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
162 | 171 | ||
163 | t = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
172 | t = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
164 | ASSERT(t); |
173 | ASSERT(t); |
165 | thread_ready(t); |
174 | thread_ready(t); |
166 | 175 | ||
167 | return task; |
176 | return task; |
168 | } |
177 | } |
169 | 178 | ||
170 | /** Syscall for reading task ID from userspace. |
179 | /** Syscall for reading task ID from userspace. |
171 | * |
180 | * |
172 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
181 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
173 | * |
182 | * |
174 | * @return 0 on success or an error code from @ref errno.h. |
183 | * @return 0 on success or an error code from @ref errno.h. |
175 | */ |
184 | */ |
176 | __native sys_task_get_id(task_id_t *uspace_task_id) |
185 | __native sys_task_get_id(task_id_t *uspace_task_id) |
177 | { |
186 | { |
178 | /* |
187 | /* |
179 | * No need to acquire lock on TASK because taskid |
188 | * No need to acquire lock on TASK because taskid |
180 | * remains constant for the lifespan of the task. |
189 | * remains constant for the lifespan of the task. |
181 | */ |
190 | */ |
182 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
191 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
183 | } |
192 | } |
184 | 193 | ||
185 | /** Find task structure corresponding to task ID. |
194 | /** Find task structure corresponding to task ID. |
186 | * |
195 | * |
187 | * The tasks_lock must be already held by the caller of this function |
196 | * The tasks_lock must be already held by the caller of this function |
188 | * and interrupts must be disabled. |
197 | * and interrupts must be disabled. |
189 | * |
198 | * |
190 | * @param id Task ID. |
199 | * @param id Task ID. |
191 | * |
200 | * |
192 | * @return Task structure address or NULL if there is no such task ID. |
201 | * @return Task structure address or NULL if there is no such task ID. |
193 | */ |
202 | */ |
194 | task_t *task_find_by_id(task_id_t id) |
203 | task_t *task_find_by_id(task_id_t id) |
195 | { |
204 | { |
196 | btree_node_t *leaf; |
205 | btree_node_t *leaf; |
197 | 206 | ||
198 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
207 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
199 | } |
208 | } |
200 | 209 | ||
201 | /** Print task list */ |
210 | /** Print task list */ |
202 | void task_print_list(void) |
211 | void task_print_list(void) |
203 | { |
212 | { |
204 | link_t *cur; |
213 | link_t *cur; |
205 | ipl_t ipl; |
214 | ipl_t ipl; |
206 | 215 | ||
207 | /* Messing with thread structures, avoid deadlock */ |
216 | /* Messing with thread structures, avoid deadlock */ |
208 | ipl = interrupts_disable(); |
217 | ipl = interrupts_disable(); |
209 | spinlock_lock(&tasks_lock); |
218 | spinlock_lock(&tasks_lock); |
210 | 219 | ||
211 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
220 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
212 | btree_node_t *node; |
221 | btree_node_t *node; |
213 | int i; |
222 | int i; |
214 | 223 | ||
215 | node = list_get_instance(cur, btree_node_t, leaf_link); |
224 | node = list_get_instance(cur, btree_node_t, leaf_link); |
216 | for (i = 0; i < node->keys; i++) { |
225 | for (i = 0; i < node->keys; i++) { |
217 | task_t *t; |
226 | task_t *t; |
218 | int j; |
227 | int j; |
219 | 228 | ||
220 | t = (task_t *) node->value[i]; |
229 | t = (task_t *) node->value[i]; |
221 | 230 | ||
222 | spinlock_lock(&t->lock); |
231 | spinlock_lock(&t->lock); |
223 | printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd", |
232 | printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd", |
224 | t->name, t, t->taskid, t->as, atomic_get(&t->active_calls)); |
233 | t->name, t, t->taskid, t->as, atomic_get(&t->active_calls)); |
225 | for (j=0; j < IPC_MAX_PHONES; j++) { |
234 | for (j=0; j < IPC_MAX_PHONES; j++) { |
226 | if (t->phones[j].callee) |
235 | if (t->phones[j].callee) |
227 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
236 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
228 | } |
237 | } |
229 | printf("\n"); |
238 | printf("\n"); |
230 | spinlock_unlock(&t->lock); |
239 | spinlock_unlock(&t->lock); |
231 | } |
240 | } |
232 | } |
241 | } |
233 | 242 | ||
234 | spinlock_unlock(&tasks_lock); |
243 | spinlock_unlock(&tasks_lock); |
235 | interrupts_restore(ipl); |
244 | interrupts_restore(ipl); |
236 | } |
245 | } |
237 | 246 |