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