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