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