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