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