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