Rev 3149 | Rev 3203 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3149 | Rev 3191 | ||
---|---|---|---|
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 | /** @addtogroup main |
29 | /** @addtogroup main |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Kernel initialization thread. |
35 | * @brief Kernel initialization thread. |
36 | * |
36 | * |
37 | * This file contains kinit kernel thread which carries out |
37 | * This file contains kinit kernel thread which carries out |
38 | * high level system initialization. |
38 | * high level system initialization. |
39 | * |
39 | * |
40 | * This file is responsible for finishing SMP configuration |
40 | * This file is responsible for finishing SMP configuration |
41 | * and creation of userspace init tasks. |
41 | * and creation of userspace init tasks. |
42 | */ |
42 | */ |
43 | 43 | ||
44 | #include <main/kinit.h> |
44 | #include <main/kinit.h> |
45 | #include <config.h> |
45 | #include <config.h> |
46 | #include <arch.h> |
46 | #include <arch.h> |
47 | #include <proc/scheduler.h> |
47 | #include <proc/scheduler.h> |
48 | #include <proc/task.h> |
48 | #include <proc/task.h> |
49 | #include <proc/thread.h> |
49 | #include <proc/thread.h> |
50 | #include <panic.h> |
50 | #include <panic.h> |
51 | #include <func.h> |
51 | #include <func.h> |
52 | #include <cpu.h> |
52 | #include <cpu.h> |
53 | #include <arch/asm.h> |
53 | #include <arch/asm.h> |
54 | #include <mm/page.h> |
54 | #include <mm/page.h> |
55 | #include <arch/mm/page.h> |
55 | #include <arch/mm/page.h> |
56 | #include <mm/as.h> |
56 | #include <mm/as.h> |
57 | #include <mm/frame.h> |
57 | #include <mm/frame.h> |
58 | #include <print.h> |
58 | #include <print.h> |
59 | #include <memstr.h> |
59 | #include <memstr.h> |
60 | #include <console/console.h> |
60 | #include <console/console.h> |
61 | #include <interrupt.h> |
61 | #include <interrupt.h> |
62 | #include <console/kconsole.h> |
62 | #include <console/kconsole.h> |
63 | #include <security/cap.h> |
63 | #include <security/cap.h> |
64 | #include <lib/rd.h> |
64 | #include <lib/rd.h> |
65 | #include <ipc/ipc.h> |
65 | #include <ipc/ipc.h> |
66 | 66 | ||
67 | #ifdef CONFIG_SMP |
67 | #ifdef CONFIG_SMP |
68 | #include <smp/smp.h> |
68 | #include <smp/smp.h> |
69 | #endif /* CONFIG_SMP */ |
69 | #endif /* CONFIG_SMP */ |
70 | 70 | ||
71 | #include <synch/waitq.h> |
71 | #include <synch/waitq.h> |
72 | #include <synch/spinlock.h> |
72 | #include <synch/spinlock.h> |
73 | 73 | ||
74 | /** Kernel initialization thread. |
74 | /** Kernel initialization thread. |
75 | * |
75 | * |
76 | * kinit takes care of higher level kernel |
76 | * kinit takes care of higher level kernel |
77 | * initialization (i.e. thread creation, |
77 | * initialization (i.e. thread creation, |
78 | * userspace initialization etc.). |
78 | * userspace initialization etc.). |
79 | * |
79 | * |
80 | * @param arg Not used. |
80 | * @param arg Not used. |
81 | */ |
81 | */ |
82 | void kinit(void *arg) |
82 | void kinit(void *arg) |
83 | { |
83 | { |
84 | thread_t *t; |
84 | thread_t *t; |
85 | 85 | ||
86 | /* |
86 | /* |
87 | * Detach kinit as nobody will call thread_join_timeout() on it. |
87 | * Detach kinit as nobody will call thread_join_timeout() on it. |
88 | */ |
88 | */ |
89 | thread_detach(THREAD); |
89 | thread_detach(THREAD); |
90 | 90 | ||
91 | interrupts_disable(); |
91 | interrupts_disable(); |
92 | 92 | ||
93 | #ifdef CONFIG_SMP |
93 | #ifdef CONFIG_SMP |
94 | if (config.cpu_count > 1) { |
94 | if (config.cpu_count > 1) { |
95 | waitq_initialize(&ap_completion_wq); |
95 | waitq_initialize(&ap_completion_wq); |
96 | /* |
96 | /* |
97 | * Create the kmp thread and wait for its completion. |
97 | * Create the kmp thread and wait for its completion. |
98 | * cpu1 through cpuN-1 will come up consecutively and |
98 | * cpu1 through cpuN-1 will come up consecutively and |
99 | * not mess together with kcpulb threads. |
99 | * not mess together with kcpulb threads. |
100 | * Just a beautification. |
100 | * Just a beautification. |
101 | */ |
101 | */ |
102 | if ((t = thread_create(kmp, NULL, TASK, THREAD_FLAG_WIRED, |
102 | if ((t = thread_create(kmp, NULL, TASK, THREAD_FLAG_WIRED, |
103 | "kmp", true))) { |
103 | "kmp", true))) { |
104 | spinlock_lock(&t->lock); |
104 | spinlock_lock(&t->lock); |
105 | t->cpu = &cpus[0]; |
105 | t->cpu = &cpus[0]; |
106 | spinlock_unlock(&t->lock); |
106 | spinlock_unlock(&t->lock); |
107 | thread_ready(t); |
107 | thread_ready(t); |
108 | } else |
108 | } else |
109 | panic("thread_create/kmp\n"); |
109 | panic("thread_create/kmp\n"); |
110 | thread_join(t); |
110 | thread_join(t); |
111 | thread_detach(t); |
111 | thread_detach(t); |
112 | } |
112 | } |
113 | #endif /* CONFIG_SMP */ |
113 | #endif /* CONFIG_SMP */ |
114 | /* |
114 | /* |
115 | * Now that all CPUs are up, we can report what we've found. |
115 | * Now that all CPUs are up, we can report what we've found. |
116 | */ |
116 | */ |
117 | cpu_list(); |
117 | cpu_list(); |
118 | 118 | ||
119 | #ifdef CONFIG_SMP |
119 | #ifdef CONFIG_SMP |
120 | if (config.cpu_count > 1) { |
120 | if (config.cpu_count > 1) { |
121 | count_t i; |
121 | count_t i; |
122 | 122 | ||
123 | /* |
123 | /* |
124 | * For each CPU, create its load balancing thread. |
124 | * For each CPU, create its load balancing thread. |
125 | */ |
125 | */ |
126 | for (i = 0; i < config.cpu_count; i++) { |
126 | for (i = 0; i < config.cpu_count; i++) { |
127 | 127 | ||
128 | if ((t = thread_create(kcpulb, NULL, TASK, |
128 | if ((t = thread_create(kcpulb, NULL, TASK, |
129 | THREAD_FLAG_WIRED, "kcpulb", true))) { |
129 | THREAD_FLAG_WIRED, "kcpulb", true))) { |
130 | spinlock_lock(&t->lock); |
130 | spinlock_lock(&t->lock); |
131 | t->cpu = &cpus[i]; |
131 | t->cpu = &cpus[i]; |
132 | spinlock_unlock(&t->lock); |
132 | spinlock_unlock(&t->lock); |
133 | thread_ready(t); |
133 | thread_ready(t); |
134 | } else |
134 | } else |
135 | panic("thread_create/kcpulb\n"); |
135 | panic("thread_create/kcpulb\n"); |
136 | 136 | ||
137 | } |
137 | } |
138 | } |
138 | } |
139 | #endif /* CONFIG_SMP */ |
139 | #endif /* CONFIG_SMP */ |
140 | 140 | ||
141 | /* |
141 | /* |
142 | * At this point SMP, if present, is configured. |
142 | * At this point SMP, if present, is configured. |
143 | */ |
143 | */ |
144 | arch_post_smp_init(); |
144 | arch_post_smp_init(); |
145 | 145 | ||
146 | /* |
146 | /* |
147 | * Create kernel console. |
147 | * Create kernel console. |
148 | */ |
148 | */ |
149 | t = thread_create(kconsole, (void *) "kconsole", TASK, 0, "kconsole", false); |
149 | t = thread_create(kconsole, (void *) "kconsole", TASK, 0, "kconsole", |
- | 150 | false); |
|
150 | if (t) |
151 | if (t) |
151 | thread_ready(t); |
152 | thread_ready(t); |
152 | else |
153 | else |
153 | panic("thread_create/kconsole\n"); |
154 | panic("thread_create/kconsole\n"); |
154 | 155 | ||
155 | interrupts_enable(); |
156 | interrupts_enable(); |
156 | 157 | ||
157 | /* |
158 | /* |
158 | * Create user tasks, load RAM disk images. |
159 | * Create user tasks, load RAM disk images. |
159 | */ |
160 | */ |
160 | count_t i; |
161 | count_t i; |
161 | thread_t *threads[CONFIG_INIT_TASKS]; |
162 | thread_t *threads[CONFIG_INIT_TASKS]; |
162 | 163 | ||
163 | for (i = 0; i < init.cnt; i++) { |
164 | for (i = 0; i < init.cnt; i++) { |
164 | if (init.tasks[i].addr % FRAME_SIZE) { |
165 | if (init.tasks[i].addr % FRAME_SIZE) { |
165 | printf("init[%" PRIc "].addr is not frame aligned", i); |
166 | printf("init[%" PRIc "].addr is not frame aligned", i); |
166 | continue; |
167 | continue; |
167 | } |
168 | } |
168 | 169 | ||
169 | int rc = task_parse_initial((void *) init.tasks[i].addr, |
170 | int rc = task_parse_initial((void *) init.tasks[i].addr, |
170 | "uspace", &threads[i]); |
171 | "uspace", &threads[i]); |
171 | 172 | ||
172 | if (rc == 0 && threads[i] != NULL) { |
173 | if (rc == 0 && threads[i] != NULL) { |
173 | /* |
174 | /* |
174 | * Set capabilities to init userspace tasks. |
175 | * Set capabilities to init userspace tasks. |
175 | */ |
176 | */ |
176 | cap_set(threads[i]->task, CAP_CAP | CAP_MEM_MANAGER | |
177 | cap_set(threads[i]->task, CAP_CAP | CAP_MEM_MANAGER | |
177 | CAP_IO_MANAGER | CAP_PREEMPT_CONTROL | CAP_IRQ_REG); |
178 | CAP_IO_MANAGER | CAP_PREEMPT_CONTROL | CAP_IRQ_REG); |
178 | 179 | ||
179 | 180 | ||
180 | if (!ipc_phone_0) |
181 | if (!ipc_phone_0) |
181 | ipc_phone_0 = &threads[i]->task->answerbox; |
182 | ipc_phone_0 = &threads[i]->task->answerbox; |
182 | } else if (rc == 0) { |
183 | } else if (rc == 0) { |
183 | /* It was the program loader and was registered */ |
184 | /* It was the program loader and was registered */ |
184 | } else { |
185 | } else { |
185 | /* RAM disk image */ |
186 | /* RAM disk image */ |
186 | int rd = init_rd((rd_header_t *) init.tasks[i].addr, |
187 | int rd = init_rd((rd_header_t *) init.tasks[i].addr, |
187 | init.tasks[i].size); |
188 | init.tasks[i].size); |
188 | 189 | ||
189 | if (rd != RE_OK) |
190 | if (rd != RE_OK) |
190 | printf("Init binary %" PRIc " not used, error code %d.\n", i, rd); |
191 | printf("Init binary %" PRIc " not used, error " |
- | 192 | "code %d.\n", i, rd); |
|
191 | } |
193 | } |
192 | } |
194 | } |
193 | 195 | ||
194 | /* |
196 | /* |
195 | * Run user tasks with reasonable delays |
197 | * Run user tasks with reasonable delays |
196 | */ |
198 | */ |
197 | for (i = 0; i < init.cnt; i++) { |
199 | for (i = 0; i < init.cnt; i++) { |
198 | if (threads[i] != NULL) { |
200 | if (threads[i] != NULL) { |
199 | thread_usleep(50000); |
201 | thread_usleep(50000); |
200 | thread_ready(threads[i]); |
202 | thread_ready(threads[i]); |
201 | } |
203 | } |
202 | } |
204 | } |
203 | 205 | ||
204 | if (!stdin) { |
206 | if (!stdin) { |
205 | while (1) { |
207 | while (1) { |
206 | thread_sleep(1); |
208 | thread_sleep(1); |
207 | printf("kinit... "); |
209 | printf("kinit... "); |
208 | } |
210 | } |
209 | } |
211 | } |
210 | } |
212 | } |
211 | 213 | ||
212 | /** @} |
214 | /** @} |
213 | */ |
215 | */ |
214 | 216 |