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