Rev 3022 | Rev 4156 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3022 | Rev 4055 | ||
---|---|---|---|
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 Main initialization kernel function for all processors. |
35 | * @brief Main initialization kernel function for all processors. |
36 | * |
36 | * |
37 | * During kernel boot, all processors, after architecture dependent |
37 | * During kernel boot, all processors, after architecture dependent |
38 | * initialization, start executing code found in this file. After |
38 | * initialization, start executing code found in this file. After |
39 | * bringing up all subsystems, control is passed to scheduler(). |
39 | * bringing up all subsystems, control is passed to scheduler(). |
40 | * |
40 | * |
41 | * The bootstrap processor starts executing main_bsp() while |
41 | * The bootstrap processor starts executing main_bsp() while |
42 | * the application processors start executing main_ap(). |
42 | * the application processors start executing main_ap(). |
43 | * |
43 | * |
44 | * @see scheduler() |
44 | * @see scheduler() |
45 | * @see main_bsp() |
45 | * @see main_bsp() |
46 | * @see main_ap() |
46 | * @see main_ap() |
47 | */ |
47 | */ |
48 | 48 | ||
49 | #include <arch/asm.h> |
49 | #include <arch/asm.h> |
50 | #include <context.h> |
50 | #include <context.h> |
51 | #include <print.h> |
51 | #include <print.h> |
52 | #include <panic.h> |
52 | #include <panic.h> |
53 | #include <debug.h> |
53 | #include <debug.h> |
54 | #include <config.h> |
54 | #include <config.h> |
55 | #include <time/clock.h> |
55 | #include <time/clock.h> |
56 | #include <time/timeout.h> |
56 | #include <time/timeout.h> |
57 | #include <proc/scheduler.h> |
57 | #include <proc/scheduler.h> |
58 | #include <proc/thread.h> |
58 | #include <proc/thread.h> |
59 | #include <proc/task.h> |
59 | #include <proc/task.h> |
60 | #include <proc/tasklet.h> |
60 | #include <proc/tasklet.h> |
61 | #include <main/kinit.h> |
61 | #include <main/kinit.h> |
62 | #include <main/version.h> |
62 | #include <main/version.h> |
63 | #include <console/kconsole.h> |
63 | #include <console/kconsole.h> |
- | 64 | #include <console/console.h> |
|
64 | #include <cpu.h> |
65 | #include <cpu.h> |
65 | #include <align.h> |
66 | #include <align.h> |
66 | #include <interrupt.h> |
67 | #include <interrupt.h> |
67 | #include <mm/frame.h> |
68 | #include <mm/frame.h> |
68 | #include <mm/page.h> |
69 | #include <mm/page.h> |
69 | #include <genarch/mm/page_pt.h> |
70 | #include <genarch/mm/page_pt.h> |
70 | #include <mm/tlb.h> |
71 | #include <mm/tlb.h> |
71 | #include <mm/as.h> |
72 | #include <mm/as.h> |
72 | #include <mm/slab.h> |
73 | #include <mm/slab.h> |
73 | #include <synch/waitq.h> |
74 | #include <synch/waitq.h> |
74 | #include <synch/futex.h> |
75 | #include <synch/futex.h> |
75 | #include <arch/arch.h> |
76 | #include <arch/arch.h> |
76 | #include <arch.h> |
77 | #include <arch.h> |
77 | #include <arch/faddr.h> |
78 | #include <arch/faddr.h> |
78 | #include <ipc/ipc.h> |
79 | #include <ipc/ipc.h> |
79 | #include <macros.h> |
80 | #include <macros.h> |
80 | #include <adt/btree.h> |
81 | #include <adt/btree.h> |
81 | #include <console/klog.h> |
- | |
82 | #include <smp/smp.h> |
82 | #include <smp/smp.h> |
83 | #include <ddi/ddi.h> |
83 | #include <ddi/ddi.h> |
- | 84 | #include <main/main.h> |
|
84 | 85 | ||
85 | /** Global configuration structure. */ |
86 | /** Global configuration structure. */ |
86 | config_t config; |
87 | config_t config; |
87 | 88 | ||
88 | /** Initial user-space tasks */ |
89 | /** Initial user-space tasks */ |
89 | init_t init = { |
90 | init_t init = { |
90 | .cnt = 0 |
91 | .cnt = 0 |
91 | }; |
92 | }; |
92 | 93 | ||
93 | /** Boot allocations. */ |
94 | /** Boot allocations. */ |
94 | ballocs_t ballocs = { |
95 | ballocs_t ballocs = { |
95 | .base = NULL, |
96 | .base = NULL, |
96 | .size = 0 |
97 | .size = 0 |
97 | }; |
98 | }; |
98 | 99 | ||
99 | context_t ctx; |
100 | context_t ctx; |
100 | 101 | ||
101 | /* |
102 | /* |
102 | * These 'hardcoded' variables will be intialized by |
103 | * These 'hardcoded' variables will be intialized by |
103 | * the linker or the low level assembler code with |
104 | * the linker or the low level assembler code with |
104 | * appropriate sizes and addresses. |
105 | * appropriate sizes and addresses. |
105 | */ |
106 | */ |
106 | 107 | ||
107 | /**< Virtual address of where the kernel is loaded. */ |
108 | /** Virtual address of where the kernel is loaded. */ |
108 | uintptr_t hardcoded_load_address = 0; |
109 | uintptr_t hardcoded_load_address = 0; |
109 | /**< Size of the kernel code in bytes. */ |
110 | /** Size of the kernel code in bytes. */ |
110 | size_t hardcoded_ktext_size = 0; |
111 | size_t hardcoded_ktext_size = 0; |
111 | /**< Size of the kernel data in bytes. */ |
112 | /** Size of the kernel data in bytes. */ |
112 | size_t hardcoded_kdata_size = 0; |
113 | size_t hardcoded_kdata_size = 0; |
113 | /**< Lowest safe stack virtual address. */ |
114 | /** Lowest safe stack virtual address. */ |
114 | uintptr_t stack_safe = 0; |
115 | uintptr_t stack_safe = 0; |
115 | 116 | ||
116 | void main_bsp(void); |
- | |
117 | void main_ap(void); |
- | |
118 | - | ||
119 | /* |
117 | /* |
120 | * These two functions prevent stack from underflowing during the |
118 | * These two functions prevent stack from underflowing during the |
121 | * kernel boot phase when SP is set to the very top of the reserved |
119 | * kernel boot phase when SP is set to the very top of the reserved |
122 | * space. The stack could get corrupted by a fooled compiler-generated |
120 | * space. The stack could get corrupted by a fooled compiler-generated |
123 | * pop sequence otherwise. |
121 | * pop sequence otherwise. |
124 | */ |
122 | */ |
125 | static void main_bsp_separated_stack(void); |
123 | static void main_bsp_separated_stack(void); |
126 | #ifdef CONFIG_SMP |
124 | #ifdef CONFIG_SMP |
127 | static void main_ap_separated_stack(void); |
125 | static void main_ap_separated_stack(void); |
128 | #endif |
126 | #endif |
129 | 127 | ||
130 | #define CONFIG_STACK_SIZE ((1 << STACK_FRAMES) * STACK_SIZE) |
128 | #define CONFIG_STACK_SIZE ((1 << STACK_FRAMES) * STACK_SIZE) |
131 | 129 | ||
132 | /** Main kernel routine for bootstrap CPU. |
130 | /** Main kernel routine for bootstrap CPU. |
133 | * |
131 | * |
134 | * Initializes the kernel by bootstrap CPU. |
132 | * The code here still runs on the boot stack, which knows nothing about |
135 | * This function passes control directly to |
133 | * preemption counts. Because of that, this function cannot directly call |
- | 134 | * functions that disable or enable preemption (e.g. spinlock_lock()). The |
|
- | 135 | * primary task of this function is to calculate address of a new stack and |
|
136 | * main_bsp_separated_stack(). |
136 | * switch to it. |
137 | * |
137 | * |
138 | * Assuming interrupts_disable(). |
138 | * Assuming interrupts_disable(). |
139 | * |
139 | * |
140 | */ |
140 | */ |
141 | void main_bsp(void) |
141 | void main_bsp(void) |
142 | { |
142 | { |
143 | config.cpu_count = 1; |
143 | config.cpu_count = 1; |
144 | config.cpu_active = 1; |
144 | config.cpu_active = 1; |
145 | 145 | ||
146 | config.base = hardcoded_load_address; |
146 | config.base = hardcoded_load_address; |
147 | config.kernel_size = ALIGN_UP(hardcoded_ktext_size + |
147 | config.kernel_size = ALIGN_UP(hardcoded_ktext_size + |
148 | hardcoded_kdata_size, PAGE_SIZE); |
148 | hardcoded_kdata_size, PAGE_SIZE); |
149 | config.stack_size = CONFIG_STACK_SIZE; |
149 | config.stack_size = CONFIG_STACK_SIZE; |
150 | 150 | ||
151 | /* Initialy the stack is placed just after the kernel */ |
151 | /* Initialy the stack is placed just after the kernel */ |
152 | config.stack_base = config.base + config.kernel_size; |
152 | config.stack_base = config.base + config.kernel_size; |
153 | 153 | ||
154 | /* Avoid placing stack on top of init */ |
154 | /* Avoid placing stack on top of init */ |
155 | count_t i; |
155 | count_t i; |
156 | for (i = 0; i < init.cnt; i++) { |
156 | for (i = 0; i < init.cnt; i++) { |
157 | if (PA_overlaps(config.stack_base, config.stack_size, |
157 | if (PA_overlaps(config.stack_base, config.stack_size, |
158 | init.tasks[i].addr, init.tasks[i].size)) |
158 | init.tasks[i].addr, init.tasks[i].size)) |
159 | config.stack_base = ALIGN_UP(init.tasks[i].addr + |
159 | config.stack_base = ALIGN_UP(init.tasks[i].addr + |
160 | init.tasks[i].size, config.stack_size); |
160 | init.tasks[i].size, config.stack_size); |
161 | } |
161 | } |
162 | 162 | ||
163 | /* Avoid placing stack on top of boot allocations. */ |
163 | /* Avoid placing stack on top of boot allocations. */ |
164 | if (ballocs.size) { |
164 | if (ballocs.size) { |
165 | if (PA_overlaps(config.stack_base, config.stack_size, |
165 | if (PA_overlaps(config.stack_base, config.stack_size, |
166 | ballocs.base, ballocs.size)) |
166 | ballocs.base, ballocs.size)) |
167 | config.stack_base = ALIGN_UP(ballocs.base + |
167 | config.stack_base = ALIGN_UP(ballocs.base + |
168 | ballocs.size, PAGE_SIZE); |
168 | ballocs.size, PAGE_SIZE); |
169 | } |
169 | } |
170 | 170 | ||
171 | if (config.stack_base < stack_safe) |
171 | if (config.stack_base < stack_safe) |
172 | config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE); |
172 | config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE); |
173 | 173 | ||
174 | context_save(&ctx); |
174 | context_save(&ctx); |
175 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base, |
175 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base, |
176 | THREAD_STACK_SIZE); |
176 | THREAD_STACK_SIZE); |
177 | context_restore(&ctx); |
177 | context_restore(&ctx); |
178 | /* not reached */ |
178 | /* not reached */ |
179 | } |
179 | } |
180 | 180 | ||
181 | 181 | ||
182 | /** Main kernel routine for bootstrap CPU using new stack. |
182 | /** Main kernel routine for bootstrap CPU using new stack. |
183 | * |
183 | * |
184 | * Second part of main_bsp(). |
184 | * Second part of main_bsp(). |
185 | * |
185 | * |
186 | */ |
186 | */ |
187 | void main_bsp_separated_stack(void) |
187 | void main_bsp_separated_stack(void) |
188 | { |
188 | { |
189 | task_t *k; |
- | |
190 | thread_t *t; |
189 | /* Keep this the first thing. */ |
191 | count_t i; |
- | |
192 | - | ||
193 | the_initialize(THE); |
190 | the_initialize(THE); |
194 | 191 | ||
- | 192 | version_print(); |
|
- | 193 | ||
- | 194 | LOG("\nconfig.base=%#" PRIp " config.kernel_size=%" PRIs |
|
- | 195 | "\nconfig.stack_base=%#" PRIp " config.stack_size=%" PRIs, |
|
- | 196 | config.base, config.kernel_size, config.stack_base, |
|
- | 197 | config.stack_size); |
|
- | 198 | ||
- | 199 | #ifdef CONFIG_KCONSOLE |
|
195 | /* |
200 | /* |
196 | * kconsole data structures must be initialized very early |
201 | * kconsole data structures must be initialized very early |
197 | * because other subsystems will register their respective |
202 | * because other subsystems will register their respective |
198 | * commands. |
203 | * commands. |
199 | */ |
204 | */ |
200 | kconsole_init(); |
205 | LOG_EXEC(kconsole_init()); |
- | 206 | #endif |
|
201 | 207 | ||
202 | /* |
208 | /* |
203 | * Exception handler initialization, before architecture |
209 | * Exception handler initialization, before architecture |
204 | * starts adding its own handlers |
210 | * starts adding its own handlers |
205 | */ |
211 | */ |
206 | exc_init(); |
212 | LOG_EXEC(exc_init()); |
207 | 213 | ||
208 | /* |
214 | /* |
209 | * Memory management subsystems initialization. |
215 | * Memory management subsystems initialization. |
210 | */ |
216 | */ |
211 | arch_pre_mm_init(); |
217 | LOG_EXEC(arch_pre_mm_init()); |
212 | frame_init(); |
218 | LOG_EXEC(frame_init()); |
213 | /* Initialize at least 1 memory segment big enough for slab to work. */ |
- | |
214 | slab_cache_init(); |
- | |
215 | btree_init(); |
- | |
216 | as_init(); |
- | |
217 | page_init(); |
- | |
218 | tlb_init(); |
- | |
219 | ddi_init(); |
- | |
220 | tasklet_init(); |
- | |
221 | arch_post_mm_init(); |
- | |
222 | 219 | ||
- | 220 | /* Initialize at least 1 memory segment big enough for slab to work. */ |
|
- | 221 | LOG_EXEC(slab_cache_init()); |
|
- | 222 | LOG_EXEC(btree_init()); |
|
223 | version_print(); |
223 | LOG_EXEC(as_init()); |
224 | printf("kernel: %.*p hardcoded_ktext_size=%zd KB, " |
224 | LOG_EXEC(page_init()); |
- | 225 | LOG_EXEC(tlb_init()); |
|
225 | "hardcoded_kdata_size=%zd KB\n", sizeof(uintptr_t) * 2, |
226 | LOG_EXEC(ddi_init()); |
226 | config.base, SIZE2KB(hardcoded_ktext_size), |
227 | LOG_EXEC(tasklet_init()); |
227 | SIZE2KB(hardcoded_kdata_size)); |
228 | LOG_EXEC(arch_post_mm_init()); |
228 | printf("stack: %.*p size=%zd KB\n", sizeof(uintptr_t) * 2, |
229 | LOG_EXEC(arch_pre_smp_init()); |
229 | config.stack_base, SIZE2KB(config.stack_size)); |
230 | LOG_EXEC(smp_init()); |
230 | 231 | ||
231 | arch_pre_smp_init(); |
- | |
232 | smp_init(); |
- | |
233 | /* Slab must be initialized after we know the number of processors. */ |
232 | /* Slab must be initialized after we know the number of processors. */ |
234 | slab_enable_cpucache(); |
233 | LOG_EXEC(slab_enable_cpucache()); |
235 | 234 | ||
236 | printf("Detected %zu CPU(s), %llu MB free memory\n", |
235 | printf("Detected %" PRIc " CPU(s), %" PRIu64" MiB free memory\n", |
237 | config.cpu_count, SIZE2MB(zone_total_size())); |
236 | config.cpu_count, SIZE2MB(zone_total_size())); |
238 | cpu_init(); |
- | |
239 | 237 | ||
- | 238 | LOG_EXEC(cpu_init()); |
|
- | 239 | ||
240 | calibrate_delay_loop(); |
240 | LOG_EXEC(calibrate_delay_loop()); |
241 | clock_counter_init(); |
241 | LOG_EXEC(clock_counter_init()); |
242 | timeout_init(); |
242 | LOG_EXEC(timeout_init()); |
243 | scheduler_init(); |
243 | LOG_EXEC(scheduler_init()); |
244 | task_init(); |
244 | LOG_EXEC(task_init()); |
245 | thread_init(); |
245 | LOG_EXEC(thread_init()); |
246 | futex_init(); |
246 | LOG_EXEC(futex_init()); |
247 | klog_init(); |
- | |
248 | 247 | ||
249 | if (init.cnt > 0) { |
248 | if (init.cnt > 0) { |
- | 249 | count_t i; |
|
250 | for (i = 0; i < init.cnt; i++) |
250 | for (i = 0; i < init.cnt; i++) |
251 | printf("init[%zd].addr=%.*p, init[%zd].size=%zd\n", i, |
251 | LOG("init[%" PRIc "].addr=%#" PRIp ", init[%" PRIc |
252 | sizeof(uintptr_t) * 2, init.tasks[i].addr, i, |
252 | "].size=%#" PRIs "\n", i, init.tasks[i].addr, i, |
253 | init.tasks[i].size); |
253 | init.tasks[i].size); |
254 | } else |
254 | } else |
255 | printf("No init binaries found\n"); |
255 | printf("No init binaries found\n"); |
256 | 256 | ||
257 | ipc_init(); |
257 | LOG_EXEC(ipc_init()); |
- | 258 | LOG_EXEC(klog_init()); |
|
- | 259 | LOG_EXEC(console_init()); |
|
- | 260 | ||
- | 261 | #ifdef CONFIG_KCONSOLE |
|
- | 262 | LOG_EXEC(kconsole_notify_init()); |
|
- | 263 | #endif |
|
258 | 264 | ||
259 | /* |
265 | /* |
260 | * Create kernel task. |
266 | * Create kernel task. |
261 | */ |
267 | */ |
262 | k = task_create(AS_KERNEL, "kernel"); |
268 | task_t *kernel = task_create(AS_KERNEL, "kernel"); |
263 | if (!k) |
269 | if (!kernel) |
264 | panic("can't create kernel task\n"); |
270 | panic("Cannot create kernel task."); |
265 | 271 | ||
266 | /* |
272 | /* |
267 | * Create the first thread. |
273 | * Create the first thread. |
268 | */ |
274 | */ |
- | 275 | thread_t *kinit_thread |
|
269 | t = thread_create(kinit, NULL, k, 0, "kinit", true); |
276 | = thread_create(kinit, NULL, kernel, 0, "kinit", true); |
270 | if (!t) |
277 | if (!kinit_thread) |
271 | panic("can't create kinit thread\n"); |
278 | panic("Cannot create kinit thread."); |
272 | thread_ready(t); |
279 | LOG_EXEC(thread_ready(kinit_thread)); |
273 | 280 | ||
274 | /* |
281 | /* |
275 | * This call to scheduler() will return to kinit, |
282 | * This call to scheduler() will return to kinit, |
276 | * starting the thread of kernel threads. |
283 | * starting the thread of kernel threads. |
277 | */ |
284 | */ |
278 | scheduler(); |
285 | scheduler(); |
279 | /* not reached */ |
286 | /* not reached */ |
280 | } |
287 | } |
281 | 288 | ||
282 | 289 | ||
283 | #ifdef CONFIG_SMP |
290 | #ifdef CONFIG_SMP |
284 | /** Main kernel routine for application CPUs. |
291 | /** Main kernel routine for application CPUs. |
285 | * |
292 | * |
286 | * Executed by application processors, temporary stack |
293 | * Executed by application processors, temporary stack |
287 | * is at ctx.sp which was set during BSP boot. |
294 | * is at ctx.sp which was set during BSP boot. |
288 | * This function passes control directly to |
295 | * This function passes control directly to |
289 | * main_ap_separated_stack(). |
296 | * main_ap_separated_stack(). |
290 | * |
297 | * |
291 | * Assuming interrupts_disable()'d. |
298 | * Assuming interrupts_disable()'d. |
292 | * |
299 | * |
293 | */ |
300 | */ |
294 | void main_ap(void) |
301 | void main_ap(void) |
295 | { |
302 | { |
296 | /* |
303 | /* |
297 | * Incrementing the active CPU counter will guarantee that the |
304 | * Incrementing the active CPU counter will guarantee that the |
298 | * *_init() functions can find out that they need to |
305 | * *_init() functions can find out that they need to |
299 | * do initialization for AP only. |
306 | * do initialization for AP only. |
300 | */ |
307 | */ |
301 | config.cpu_active++; |
308 | config.cpu_active++; |
302 | 309 | ||
303 | /* |
310 | /* |
304 | * The THE structure is well defined because ctx.sp is used as stack. |
311 | * The THE structure is well defined because ctx.sp is used as stack. |
305 | */ |
312 | */ |
306 | the_initialize(THE); |
313 | the_initialize(THE); |
307 | 314 | ||
308 | arch_pre_mm_init(); |
315 | arch_pre_mm_init(); |
309 | frame_init(); |
316 | frame_init(); |
310 | page_init(); |
317 | page_init(); |
311 | tlb_init(); |
318 | tlb_init(); |
312 | arch_post_mm_init(); |
319 | arch_post_mm_init(); |
313 | 320 | ||
314 | cpu_init(); |
321 | cpu_init(); |
315 | calibrate_delay_loop(); |
322 | calibrate_delay_loop(); |
316 | arch_post_cpu_init(); |
323 | arch_post_cpu_init(); |
317 | 324 | ||
318 | the_copy(THE, (the_t *) CPU->stack); |
325 | the_copy(THE, (the_t *) CPU->stack); |
319 | 326 | ||
320 | /* |
327 | /* |
321 | * If we woke kmp up before we left the kernel stack, we could |
328 | * If we woke kmp up before we left the kernel stack, we could |
322 | * collide with another CPU coming up. To prevent this, we |
329 | * collide with another CPU coming up. To prevent this, we |
323 | * switch to this cpu's private stack prior to waking kmp up. |
330 | * switch to this cpu's private stack prior to waking kmp up. |
324 | */ |
331 | */ |
- | 332 | context_save(&CPU->saved_context); |
|
325 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), |
333 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), |
326 | (uintptr_t) CPU->stack, CPU_STACK_SIZE); |
334 | (uintptr_t) CPU->stack, CPU_STACK_SIZE); |
327 | context_restore(&CPU->saved_context); |
335 | context_restore(&CPU->saved_context); |
328 | /* not reached */ |
336 | /* not reached */ |
329 | } |
337 | } |
330 | 338 | ||
331 | 339 | ||
332 | /** Main kernel routine for application CPUs using new stack. |
340 | /** Main kernel routine for application CPUs using new stack. |
333 | * |
341 | * |
334 | * Second part of main_ap(). |
342 | * Second part of main_ap(). |
335 | * |
343 | * |
336 | */ |
344 | */ |
337 | void main_ap_separated_stack(void) |
345 | void main_ap_separated_stack(void) |
338 | { |
346 | { |
339 | /* |
347 | /* |
340 | * Configure timeouts for this cpu. |
348 | * Configure timeouts for this cpu. |
341 | */ |
349 | */ |
342 | timeout_init(); |
350 | timeout_init(); |
343 | 351 | ||
344 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST); |
352 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST); |
345 | scheduler(); |
353 | scheduler(); |
346 | /* not reached */ |
354 | /* not reached */ |
347 | } |
355 | } |
348 | #endif /* CONFIG_SMP */ |
356 | #endif /* CONFIG_SMP */ |
349 | 357 | ||
350 | /** @} |
358 | /** @} |
351 | */ |
359 | */ |
352 | 360 |